/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/list-simple/dll2n_insert_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:42:28,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:42:28,949 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-16 04:42:28,954 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:42:28,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:42:28,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:42:28,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:42:28,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:42:28,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:42:28,986 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:42:28,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:42:28,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:42:28,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:42:28,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:42:28,988 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:42:28,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:42:28,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:42:28,989 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:42:28,989 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:42:28,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:42:28,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:42:28,990 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:42:28,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:42:28,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:42:28,990 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:42:28,990 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:42:28,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:42:28,990 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:42:28,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:42:28,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:42:28,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:42:28,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:42:28,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:42:28,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:42:28,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:42:28,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:42:28,992 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:42:28,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:42:28,992 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:42:28,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:42:28,993 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:42:28,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:42:28,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:42:28,993 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-16 04:42:29,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:42:29,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:42:29,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:42:29,185 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:42:29,185 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:42:29,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_insert_unequal.i [2023-12-16 04:42:30,160 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:42:30,380 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:42:30,381 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_insert_unequal.i [2023-12-16 04:42:30,389 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d053586/148ca061134843078b2320f9240373b3/FLAGc1c16bdbb [2023-12-16 04:42:30,400 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d053586/148ca061134843078b2320f9240373b3 [2023-12-16 04:42:30,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:42:30,403 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:42:30,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:42:30,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:42:30,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:42:30,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:42:30" (1/1) ... [2023-12-16 04:42:30,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5525a3c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:30, skipping insertion in model container [2023-12-16 04:42:30,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:42:30" (1/1) ... [2023-12-16 04:42:30,452 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:42:30,686 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_insert_unequal.i[24989,25002] [2023-12-16 04:42:30,690 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:42:30,698 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:42:30,738 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_insert_unequal.i[24989,25002] [2023-12-16 04:42:30,738 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:42:30,759 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:42:30,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:30 WrapperNode [2023-12-16 04:42:30,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:42:30,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:42:30,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:42:30,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:42:30,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:30" (1/1) ... [2023-12-16 04:42:30,773 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:30" (1/1) ... [2023-12-16 04:42:30,792 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 168 [2023-12-16 04:42:30,792 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:42:30,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:42:30,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:42:30,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:42:30,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:30" (1/1) ... [2023-12-16 04:42:30,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:30" (1/1) ... [2023-12-16 04:42:30,803 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:30" (1/1) ... [2023-12-16 04:42:30,817 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 21, 8]. 68 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 14 writes are split as follows [0, 13, 1]. [2023-12-16 04:42:30,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:30" (1/1) ... [2023-12-16 04:42:30,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:30" (1/1) ... [2023-12-16 04:42:30,824 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:30" (1/1) ... [2023-12-16 04:42:30,826 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:30" (1/1) ... [2023-12-16 04:42:30,827 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:30" (1/1) ... [2023-12-16 04:42:30,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:30" (1/1) ... [2023-12-16 04:42:30,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:42:30,831 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:42:30,831 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:42:30,831 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:42:30,832 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:30" (1/1) ... [2023-12-16 04:42:30,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:42:30,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:42:30,867 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-16 04:42:30,869 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-16 04:42:30,891 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-12-16 04:42:30,892 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-12-16 04:42:30,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:42:30,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:42:30,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-16 04:42:30,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:42:30,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:42:30,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-16 04:42:30,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 04:42:30,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:42:30,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 04:42:30,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-16 04:42:30,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-16 04:42:30,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-16 04:42:30,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-16 04:42:30,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-16 04:42:30,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-16 04:42:30,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 04:42:30,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-16 04:42:30,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-16 04:42:30,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-16 04:42:30,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:42:30,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:42:30,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-16 04:42:30,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:42:30,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:42:31,004 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:42:31,005 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:42:31,037 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-12-16 04:42:31,164 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:42:31,185 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:42:31,185 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-16 04:42:31,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:42:31 BoogieIcfgContainer [2023-12-16 04:42:31,186 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:42:31,187 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:42:31,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:42:31,189 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:42:31,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:42:30" (1/3) ... [2023-12-16 04:42:31,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@468a1bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:42:31, skipping insertion in model container [2023-12-16 04:42:31,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:30" (2/3) ... [2023-12-16 04:42:31,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@468a1bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:42:31, skipping insertion in model container [2023-12-16 04:42:31,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:42:31" (3/3) ... [2023-12-16 04:42:31,191 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_unequal.i [2023-12-16 04:42:31,202 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:42:31,202 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:42:31,234 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:42:31,238 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;@34efb65c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:42:31,238 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:42:31,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 28 states have (on average 1.75) internal successors, (49), 30 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:31,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 04:42:31,245 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:42:31,245 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:42:31,246 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:42:31,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:42:31,249 INFO L85 PathProgramCache]: Analyzing trace with hash 221915133, now seen corresponding path program 1 times [2023-12-16 04:42:31,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:42:31,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697809836] [2023-12-16 04:42:31,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:31,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:42:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:31,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:42:31,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:42:31,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697809836] [2023-12-16 04:42:31,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697809836] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:42:31,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:42:31,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:42:31,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240827876] [2023-12-16 04:42:31,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:42:31,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:42:31,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:42:31,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:42:31,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:42:31,446 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.75) internal successors, (49), 30 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:31,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:42:31,476 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2023-12-16 04:42:31,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:42:31,478 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-16 04:42:31,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:42:31,482 INFO L225 Difference]: With dead ends: 57 [2023-12-16 04:42:31,482 INFO L226 Difference]: Without dead ends: 24 [2023-12-16 04:42:31,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-16 04:42:31,488 INFO L413 NwaCegarLoop]: 41 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, 41 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-16 04:42:31,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:42:31,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-16 04:42:31,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-16 04:42:31,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2023-12-16 04:42:31,513 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 12 [2023-12-16 04:42:31,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:42:31,513 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2023-12-16 04:42:31,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:31,515 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2023-12-16 04:42:31,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 04:42:31,516 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:42:31,516 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:42:31,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:42:31,516 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:42:31,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:42:31,517 INFO L85 PathProgramCache]: Analyzing trace with hash 4252586, now seen corresponding path program 1 times [2023-12-16 04:42:31,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:42:31,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300471105] [2023-12-16 04:42:31,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:31,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:42:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:42:31,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:42:31,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300471105] [2023-12-16 04:42:31,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300471105] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:42:31,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:42:31,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:42:31,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871901141] [2023-12-16 04:42:31,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:42:31,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:42:31,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:42:31,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:42:31,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:42:31,721 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:31,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:42:31,745 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2023-12-16 04:42:31,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:42:31,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-16 04:42:31,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:42:31,746 INFO L225 Difference]: With dead ends: 47 [2023-12-16 04:42:31,746 INFO L226 Difference]: Without dead ends: 29 [2023-12-16 04:42:31,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:42:31,747 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:42:31,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 57 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:42:31,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-16 04:42:31,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2023-12-16 04:42:31,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:31,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2023-12-16 04:42:31,756 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 12 [2023-12-16 04:42:31,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:42:31,756 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2023-12-16 04:42:31,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:31,757 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2023-12-16 04:42:31,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 04:42:31,758 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:42:31,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:42:31,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:42:31,758 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:42:31,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:42:31,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1675711004, now seen corresponding path program 1 times [2023-12-16 04:42:31,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:42:31,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755219866] [2023-12-16 04:42:31,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:31,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:42:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:42:31,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:42:31,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755219866] [2023-12-16 04:42:31,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755219866] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:42:31,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:42:31,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:42:31,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667016041] [2023-12-16 04:42:31,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:42:31,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:42:31,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:42:31,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:42:31,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:42:31,867 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:31,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:42:31,893 INFO L93 Difference]: Finished difference Result 52 states and 73 transitions. [2023-12-16 04:42:31,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:42:31,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-16 04:42:31,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:42:31,895 INFO L225 Difference]: With dead ends: 52 [2023-12-16 04:42:31,895 INFO L226 Difference]: Without dead ends: 29 [2023-12-16 04:42:31,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:42:31,899 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:42:31,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 56 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:42:31,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-16 04:42:31,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2023-12-16 04:42:31,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:31,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2023-12-16 04:42:31,906 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 17 [2023-12-16 04:42:31,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:42:31,907 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2023-12-16 04:42:31,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:31,907 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2023-12-16 04:42:31,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 04:42:31,908 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:42:31,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:42:31,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:42:31,908 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:42:31,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:42:31,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1088904990, now seen corresponding path program 1 times [2023-12-16 04:42:31,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:42:31,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374653119] [2023-12-16 04:42:31,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:31,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:42:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:32,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:42:32,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:42:32,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374653119] [2023-12-16 04:42:32,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374653119] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:42:32,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309998654] [2023-12-16 04:42:32,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:32,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:42:32,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:42:32,007 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-16 04:42:32,035 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-16 04:42:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:32,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 04:42:32,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:42:32,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:42:32,181 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:42:32,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:42:32,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309998654] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:42:32,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:42:32,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-12-16 04:42:32,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409813338] [2023-12-16 04:42:32,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:42:32,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:42:32,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:42:32,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:42:32,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:42:32,208 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:32,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:42:32,245 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2023-12-16 04:42:32,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:42:32,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-16 04:42:32,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:42:32,248 INFO L225 Difference]: With dead ends: 48 [2023-12-16 04:42:32,248 INFO L226 Difference]: Without dead ends: 30 [2023-12-16 04:42:32,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:42:32,251 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:42:32,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 85 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:42:32,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-16 04:42:32,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-16 04:42:32,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:32,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2023-12-16 04:42:32,254 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 17 [2023-12-16 04:42:32,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:42:32,254 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2023-12-16 04:42:32,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:32,255 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2023-12-16 04:42:32,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-16 04:42:32,255 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:42:32,255 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:42:32,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-16 04:42:32,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:42:32,464 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:42:32,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:42:32,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1157750568, now seen corresponding path program 1 times [2023-12-16 04:42:32,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:42:32,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129530659] [2023-12-16 04:42:32,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:32,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:42:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:32,536 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 04:42:32,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:42:32,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129530659] [2023-12-16 04:42:32,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129530659] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:42:32,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:42:32,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:42:32,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834956236] [2023-12-16 04:42:32,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:42:32,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:42:32,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:42:32,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:42:32,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:42:32,538 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:32,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:42:32,556 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2023-12-16 04:42:32,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:42:32,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-16 04:42:32,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:42:32,559 INFO L225 Difference]: With dead ends: 44 [2023-12-16 04:42:32,559 INFO L226 Difference]: Without dead ends: 33 [2023-12-16 04:42:32,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:42:32,559 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:42:32,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 54 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:42:32,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-16 04:42:32,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2023-12-16 04:42:32,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:32,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2023-12-16 04:42:32,566 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 22 [2023-12-16 04:42:32,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:42:32,566 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2023-12-16 04:42:32,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:32,568 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2023-12-16 04:42:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 04:42:32,571 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:42:32,574 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:42:32,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 04:42:32,574 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:42:32,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:42:32,575 INFO L85 PathProgramCache]: Analyzing trace with hash 267537911, now seen corresponding path program 1 times [2023-12-16 04:42:32,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:42:32,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605612975] [2023-12-16 04:42:32,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:32,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:42:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:32,713 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 04:42:32,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:42:32,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605612975] [2023-12-16 04:42:32,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605612975] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:42:32,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:42:32,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:42:32,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657452520] [2023-12-16 04:42:32,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:42:32,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:42:32,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:42:32,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:42:32,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:42:32,715 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:32,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:42:32,738 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2023-12-16 04:42:32,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:42:32,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-16 04:42:32,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:42:32,739 INFO L225 Difference]: With dead ends: 44 [2023-12-16 04:42:32,739 INFO L226 Difference]: Without dead ends: 31 [2023-12-16 04:42:32,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:42:32,741 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 27 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:42:32,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 55 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:42:32,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-16 04:42:32,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-16 04:42:32,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:32,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2023-12-16 04:42:32,753 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 23 [2023-12-16 04:42:32,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:42:32,753 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2023-12-16 04:42:32,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:32,753 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2023-12-16 04:42:32,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 04:42:32,754 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:42:32,754 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:42:32,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 04:42:32,754 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:42:32,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:42:32,754 INFO L85 PathProgramCache]: Analyzing trace with hash 2111998660, now seen corresponding path program 1 times [2023-12-16 04:42:32,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:42:32,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089396347] [2023-12-16 04:42:32,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:32,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:42:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:33,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:42:33,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:42:33,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089396347] [2023-12-16 04:42:33,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089396347] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:42:33,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123077908] [2023-12-16 04:42:33,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:33,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:42:33,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:42:33,967 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:42:33,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 04:42:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:34,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 84 conjunts are in the unsatisfiable core [2023-12-16 04:42:34,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:42:34,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-16 04:42:34,510 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-16 04:42:34,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-16 04:42:34,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2023-12-16 04:42:34,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-12-16 04:42:34,637 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-16 04:42:34,637 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2023-12-16 04:42:34,645 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 24 treesize of output 11 [2023-12-16 04:42:34,772 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-16 04:42:34,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-16 04:42:34,861 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 48 treesize of output 31 [2023-12-16 04:42:34,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-16 04:42:34,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 19 [2023-12-16 04:42:35,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-12-16 04:42:35,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-16 04:42:35,040 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 20 treesize of output 15 [2023-12-16 04:42:35,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-16 04:42:35,120 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:42:35,120 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:42:47,881 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_592 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_586 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (store (store (store |c_#memory_int#1| .cse0 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_584) .cse0) .cse1 v_ArrVal_588)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_590) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_586) .cse0) .cse1) v_ArrVal_592)) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-12-16 04:42:47,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 52 [2023-12-16 04:42:47,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 40 [2023-12-16 04:42:48,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 290 treesize of output 288 [2023-12-16 04:42:48,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:42:48,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 133 [2023-12-16 04:42:48,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:42:48,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 317 treesize of output 281 [2023-12-16 04:42:48,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2023-12-16 04:42:48,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2023-12-16 04:42:48,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 107 [2023-12-16 04:42:48,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 48 [2023-12-16 04:42:48,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2023-12-16 04:42:48,443 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:42:48,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123077908] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:42:48,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:42:48,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 39 [2023-12-16 04:42:48,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707387168] [2023-12-16 04:42:48,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:42:48,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-16 04:42:48,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:42:48,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-16 04:42:48,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1325, Unknown=26, NotChecked=74, Total=1560 [2023-12-16 04:42:48,446 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 40 states, 40 states have (on average 1.575) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:49,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:42:49,478 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2023-12-16 04:42:49,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 04:42:49,478 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.575) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-16 04:42:49,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:42:49,479 INFO L225 Difference]: With dead ends: 59 [2023-12-16 04:42:49,479 INFO L226 Difference]: Without dead ends: 57 [2023-12-16 04:42:49,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=301, Invalid=2225, Unknown=28, NotChecked=98, Total=2652 [2023-12-16 04:42:49,480 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 91 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 04:42:49,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 207 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 710 Invalid, 0 Unknown, 68 Unchecked, 0.5s Time] [2023-12-16 04:42:49,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-16 04:42:49,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 37. [2023-12-16 04:42:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:49,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2023-12-16 04:42:49,484 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 23 [2023-12-16 04:42:49,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:42:49,484 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2023-12-16 04:42:49,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.575) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:49,484 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2023-12-16 04:42:49,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 04:42:49,484 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:42:49,484 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:42:49,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 04:42:49,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-16 04:42:49,685 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:42:49,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:42:49,686 INFO L85 PathProgramCache]: Analyzing trace with hash -215542309, now seen corresponding path program 1 times [2023-12-16 04:42:49,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:42:49,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371496919] [2023-12-16 04:42:49,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:49,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:42:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:49,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 04:42:49,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:42:49,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371496919] [2023-12-16 04:42:49,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371496919] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:42:49,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674511228] [2023-12-16 04:42:49,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:49,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:42:49,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:42:49,765 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:42:49,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 04:42:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:49,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-16 04:42:49,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:42:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 04:42:49,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:42:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 04:42:49,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674511228] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:42:49,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:42:49,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-12-16 04:42:49,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831540872] [2023-12-16 04:42:49,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:42:49,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:42:49,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:42:49,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:42:49,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:42:49,985 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:50,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:42:50,076 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2023-12-16 04:42:50,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:42:50,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-16 04:42:50,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:42:50,077 INFO L225 Difference]: With dead ends: 53 [2023-12-16 04:42:50,077 INFO L226 Difference]: Without dead ends: 42 [2023-12-16 04:42:50,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:42:50,078 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:42:50,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 144 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:42:50,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-16 04:42:50,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2023-12-16 04:42:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 37 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2023-12-16 04:42:50,081 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 24 [2023-12-16 04:42:50,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:42:50,081 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2023-12-16 04:42:50,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2023-12-16 04:42:50,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 04:42:50,082 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:42:50,082 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:42:50,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-16 04:42:50,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:42:50,291 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:42:50,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:42:50,292 INFO L85 PathProgramCache]: Analyzing trace with hash -158284007, now seen corresponding path program 1 times [2023-12-16 04:42:50,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:42:50,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080662900] [2023-12-16 04:42:50,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:50,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:42:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:50,423 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 04:42:50,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:42:50,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080662900] [2023-12-16 04:42:50,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080662900] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:42:50,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47258540] [2023-12-16 04:42:50,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:50,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:42:50,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:42:50,425 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:42:50,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-16 04:42:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:50,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-16 04:42:50,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:42:50,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-16 04:42:50,639 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 04:42:50,639 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:42:50,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-16 04:42:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 04:42:50,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47258540] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:42:50,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:42:50,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-12-16 04:42:50,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696503998] [2023-12-16 04:42:50,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:42:50,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 04:42:50,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:42:50,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 04:42:50,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-12-16 04:42:50,671 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:50,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:42:50,832 INFO L93 Difference]: Finished difference Result 69 states and 97 transitions. [2023-12-16 04:42:50,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:42:50,835 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-16 04:42:50,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:42:50,835 INFO L225 Difference]: With dead ends: 69 [2023-12-16 04:42:50,835 INFO L226 Difference]: Without dead ends: 38 [2023-12-16 04:42:50,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2023-12-16 04:42:50,836 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 75 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:42:50,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 216 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:42:50,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-16 04:42:50,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2023-12-16 04:42:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:50,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2023-12-16 04:42:50,839 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 24 [2023-12-16 04:42:50,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:42:50,839 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2023-12-16 04:42:50,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:50,839 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2023-12-16 04:42:50,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 04:42:50,840 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:42:50,840 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:42:50,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-16 04:42:51,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:42:51,046 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:42:51,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:42:51,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1047394134, now seen corresponding path program 1 times [2023-12-16 04:42:51,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:42:51,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375927500] [2023-12-16 04:42:51,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:51,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:42:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 04:42:51,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:42:51,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375927500] [2023-12-16 04:42:51,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375927500] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:42:51,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038848386] [2023-12-16 04:42:51,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:51,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:42:51,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:42:51,148 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:42:51,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-16 04:42:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:51,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 04:42:51,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:42:51,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-16 04:42:51,346 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 04:42:51,347 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:42:51,397 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 04:42:51,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038848386] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 04:42:51,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:42:51,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 11 [2023-12-16 04:42:51,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069017545] [2023-12-16 04:42:51,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:42:51,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:42:51,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:42:51,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:42:51,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:42:51,399 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:51,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:42:51,476 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2023-12-16 04:42:51,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:42:51,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-16 04:42:51,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:42:51,477 INFO L225 Difference]: With dead ends: 58 [2023-12-16 04:42:51,477 INFO L226 Difference]: Without dead ends: 51 [2023-12-16 04:42:51,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:42:51,478 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 52 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:42:51,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 88 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:42:51,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-16 04:42:51,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2023-12-16 04:42:51,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:51,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2023-12-16 04:42:51,481 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 24 [2023-12-16 04:42:51,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:42:51,481 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2023-12-16 04:42:51,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:51,482 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2023-12-16 04:42:51,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 04:42:51,482 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:42:51,482 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:42:51,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-16 04:42:51,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-16 04:42:51,687 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:42:51,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:42:51,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1628918440, now seen corresponding path program 2 times [2023-12-16 04:42:51,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:42:51,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909068338] [2023-12-16 04:42:51,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:51,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:42:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:51,793 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 04:42:51,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:42:51,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909068338] [2023-12-16 04:42:51,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909068338] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:42:51,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:42:51,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:42:51,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637157975] [2023-12-16 04:42:51,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:42:51,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:42:51,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:42:51,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:42:51,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:42:51,796 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:51,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:42:51,815 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2023-12-16 04:42:51,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:42:51,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-16 04:42:51,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:42:51,816 INFO L225 Difference]: With dead ends: 48 [2023-12-16 04:42:51,816 INFO L226 Difference]: Without dead ends: 31 [2023-12-16 04:42:51,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:42:51,817 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:42:51,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 63 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:42:51,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-16 04:42:51,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-16 04:42:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:51,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-12-16 04:42:51,822 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 24 [2023-12-16 04:42:51,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:42:51,822 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-12-16 04:42:51,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:51,822 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-12-16 04:42:51,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-16 04:42:51,823 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:42:51,823 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:42:51,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 04:42:51,823 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:42:51,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:42:51,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1888805217, now seen corresponding path program 1 times [2023-12-16 04:42:51,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:42:51,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128153286] [2023-12-16 04:42:51,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:51,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:42:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 04:42:51,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:42:51,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128153286] [2023-12-16 04:42:51,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128153286] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:42:51,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526660475] [2023-12-16 04:42:51,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:51,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:42:51,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:42:51,994 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:42:51,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-16 04:42:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:52,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 04:42:52,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:42:52,178 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 04:42:52,178 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:42:52,211 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 04:42:52,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526660475] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:42:52,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:42:52,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-12-16 04:42:52,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329406941] [2023-12-16 04:42:52,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:42:52,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 04:42:52,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:42:52,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 04:42:52,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:42:52,213 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:52,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:42:52,270 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2023-12-16 04:42:52,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:42:52,270 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-16 04:42:52,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:42:52,271 INFO L225 Difference]: With dead ends: 41 [2023-12-16 04:42:52,271 INFO L226 Difference]: Without dead ends: 32 [2023-12-16 04:42:52,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:42:52,272 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 16 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:42:52,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 124 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:42:52,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-16 04:42:52,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-12-16 04:42:52,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:52,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-12-16 04:42:52,276 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 25 [2023-12-16 04:42:52,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:42:52,277 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-12-16 04:42:52,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:42:52,277 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-12-16 04:42:52,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 04:42:52,279 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:42:52,279 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:42:52,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-16 04:42:52,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:42:52,485 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:42:52,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:42:52,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1576525531, now seen corresponding path program 1 times [2023-12-16 04:42:52,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:42:52,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765868622] [2023-12-16 04:42:52,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:52,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:42:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:53,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:42:53,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:42:53,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765868622] [2023-12-16 04:42:53,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765868622] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:42:53,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858795705] [2023-12-16 04:42:53,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:53,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:42:53,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:42:53,664 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:42:53,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-16 04:42:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:53,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 105 conjunts are in the unsatisfiable core [2023-12-16 04:42:54,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:42:54,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-16 04:42:54,080 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-16 04:42:54,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-16 04:42:54,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-16 04:42:54,175 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-16 04:42:54,175 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-12-16 04:42:54,263 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-16 04:42:54,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-16 04:42:54,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 04:42:54,358 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 37 treesize of output 26 [2023-12-16 04:42:54,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:42:54,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 22 [2023-12-16 04:42:54,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 24 treesize of output 20 [2023-12-16 04:42:54,509 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 35 [2023-12-16 04:42:54,520 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-16 04:42:54,520 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 68 [2023-12-16 04:42:54,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2023-12-16 04:42:54,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 19 [2023-12-16 04:42:54,587 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 52 treesize of output 35 [2023-12-16 04:42:54,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-12-16 04:42:54,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-16 04:42:54,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2023-12-16 04:42:54,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-16 04:42:54,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-16 04:42:54,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-16 04:42:54,770 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:42:54,770 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:42:54,847 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1464) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1466) .cse0) .cse1))))) is different from false [2023-12-16 04:42:54,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:42:54,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 92 [2023-12-16 04:42:54,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:42:54,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 346 treesize of output 345 [2023-12-16 04:42:54,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 156 [2023-12-16 04:42:54,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 298 [2023-12-16 04:42:55,344 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse16 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (= |c_ULTIMATE.start_dll_insert_~last~0#1.base| .cse5))) (let ((.cse7 (not .cse14)) (.cse2 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse3 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4)) (.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse6 (+ .cse16 4)) (.cse13 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse5))) (let ((.cse15 (and (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_arrayElimCell_48 Int) (v_DerPreprocessor_4 Int)) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1456))) (store .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1463))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1464) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) .cse5) .cse6)))) (or (forall ((v_arrayElimCell_50 Int)) (= (select .cse21 v_arrayElimCell_50) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 v_arrayElimCell_48)) (= (select .cse21 v_arrayElimCell_51) |c_ULTIMATE.start_main_~uneq~0#1|)))) (or (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_48 Int)) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1456))) (store .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1463))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1464) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 v_arrayElimCell_48)) (= (select .cse23 v_arrayElimCell_51) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse7) (or (and (forall ((v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_arrayElimCell_48 Int) (v_DerPreprocessor_4 Int)) (let ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1456))) (store .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1463))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1464) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) .cse5) .cse6)))) (or (forall ((v_arrayElimCell_50 Int)) (= (select .cse25 v_arrayElimCell_50) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 v_arrayElimCell_48))))) (or (forall ((v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_48 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1456))) (store .cse27 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse27 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1463))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1464) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) .cse5) .cse6)) v_arrayElimCell_48))) .cse13)) .cse14)))) (and (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1456))) (store .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1463))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1464) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) .cse5) .cse6)))) (or (forall ((v_arrayElimCell_50 Int)) (= (select .cse0 v_arrayElimCell_50) |c_ULTIMATE.start_main_~uneq~0#1|)) (= (select .cse0 v_arrayElimCell_51) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))) (or .cse7 (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (let ((.cse8 (select (store (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1456))) (store .cse9 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse9 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1463))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1464) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) .cse5) .cse6)))) (or (= (select .cse8 v_arrayElimCell_51) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))))) (or (and (forall ((v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (let ((.cse10 (select (store (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1456))) (store .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1463))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1464) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) .cse5) .cse6)))) (or (forall ((v_arrayElimCell_50 Int)) (= (select .cse10 v_arrayElimCell_50) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse10 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))) (or (forall ((v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1456))) (store .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1463))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1464) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) .cse5) .cse6)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) .cse13)) .cse14) (or .cse15 (= |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| .cse5)) (or .cse15 (= .cse16 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|)) (or (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (= (select (select (store (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1456))) (store .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1463))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1464) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) .cse5) .cse6)) v_arrayElimCell_51) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse7) (or (and (or .cse14 (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (= (select (select (store (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1456))) (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1463))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1464) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) .cse5) .cse6)) v_arrayElimCell_50) |c_ULTIMATE.start_main_~uneq~0#1|))) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (let ((.cse19 (select (store (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1456))) (store .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1463))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1464) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1465) .cse5) .cse6)))) (or (forall ((v_arrayElimCell_50 Int)) (= (select .cse19 v_arrayElimCell_50) |c_ULTIMATE.start_main_~uneq~0#1|)) (= (select .cse19 v_arrayElimCell_51) |c_ULTIMATE.start_main_~uneq~0#1|))))) (not .cse13))))))) is different from false [2023-12-16 04:42:56,579 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse29 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse30 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse4 (select .cse29 .cse30)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse16 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (= .cse4 .cse6))) (let ((.cse14 (not .cse9)) (.cse10 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse6)) (.cse2 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse3 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4)) (.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse29 .cse30 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse7 (+ .cse16 4))) (let ((.cse15 (and (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_arrayElimCell_48 Int) (v_DerPreprocessor_4 Int)) (let ((.cse22 (select (store (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1456))) (store .cse23 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse23 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1463))) .cse4 v_ArrVal_1464) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) .cse4 v_ArrVal_1465) .cse6) .cse7)))) (or (forall ((v_arrayElimCell_50 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 v_arrayElimCell_50))) (= (select .cse22 v_arrayElimCell_48) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 v_arrayElimCell_51))))) (or .cse14 (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_48 Int)) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1456))) (store .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1463))) .cse4 v_ArrVal_1464) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) .cse4 v_ArrVal_1465) .cse6) .cse7)))) (or (= (select .cse24 v_arrayElimCell_48) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 v_arrayElimCell_51)))))) (or (and (or (forall ((v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_arrayElimCell_48 Int)) (= (select (select (store (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1456))) (store .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1463))) .cse4 v_ArrVal_1464) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) .cse4 v_ArrVal_1465) .cse6) .cse7)) v_arrayElimCell_48) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse10) (forall ((v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_arrayElimCell_48 Int) (v_DerPreprocessor_4 Int)) (let ((.cse27 (select (store (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1456))) (store .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1463))) .cse4 v_ArrVal_1464) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) .cse4 v_ArrVal_1465) .cse6) .cse7)))) (or (forall ((v_arrayElimCell_50 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 v_arrayElimCell_50))) (= (select .cse27 v_arrayElimCell_48) |c_ULTIMATE.start_main_~uneq~0#1|))))) .cse9)))) (and (or (and (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1456))) (store .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1463))) .cse4 v_ArrVal_1464) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) .cse4 v_ArrVal_1465) .cse6) .cse7)))) (or (forall ((v_arrayElimCell_50 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 v_arrayElimCell_50))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 v_arrayElimCell_51))))) (or (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1456))) (store .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1463))) .cse4 v_ArrVal_1464) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) .cse4 v_ArrVal_1465) .cse6) .cse7)) v_arrayElimCell_50))) .cse9)) (not .cse10)) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (let ((.cse11 (select (store (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1456))) (store .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1463))) .cse4 v_ArrVal_1464) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) .cse4 v_ArrVal_1465) .cse6) .cse7)))) (or (forall ((v_arrayElimCell_50 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 v_arrayElimCell_50))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 v_arrayElimCell_51))))) (or (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1456))) (store .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1463))) .cse4 v_ArrVal_1464) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) .cse4 v_ArrVal_1465) .cse6) .cse7)) v_arrayElimCell_51))) .cse14) (or .cse15 (= |c_ULTIMATE.start_dll_insert_~last~0#1.base| .cse6)) (or .cse15 (= |c_ULTIMATE.start_dll_insert_~last~0#1.offset| .cse16)) (or (and (or (forall ((v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1456))) (store .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1463))) .cse4 v_ArrVal_1464) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) .cse4 v_ArrVal_1465) .cse6) .cse7)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) .cse10) (forall ((v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (let ((.cse18 (select (store (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1456))) (store .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1463))) .cse4 v_ArrVal_1464) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) .cse4 v_ArrVal_1465) .cse6) .cse7)))) (or (forall ((v_arrayElimCell_50 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 v_arrayElimCell_50))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))))) .cse9) (or (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_DerPreprocessor_4 Int)) (let ((.cse20 (select (store (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1456))) (store .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1463))) .cse4 v_ArrVal_1464) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) .cse4 v_ArrVal_1465) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 v_arrayElimCell_51))))) .cse14))))))) is different from false [2023-12-16 04:42:56,789 INFO L349 Elim1Store]: treesize reduction 613, result has 44.8 percent of original size [2023-12-16 04:42:56,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 7633 treesize of output 7639 [2023-12-16 04:42:56,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:42:56,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3787 treesize of output 3853 [2023-12-16 04:42:56,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:42:56,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3639 treesize of output 3632 [2023-12-16 04:42:56,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:42:56,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3453 treesize of output 3446 [2023-12-16 04:42:56,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3437 treesize of output 3429 [2023-12-16 04:42:56,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3429 treesize of output 3423 [2023-12-16 04:42:57,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-16 04:43:04,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-16 04:43:04,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 227 [2023-12-16 04:43:04,764 INFO L349 Elim1Store]: treesize reduction 139, result has 52.1 percent of original size [2023-12-16 04:43:04,765 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2630 treesize of output 2616 [2023-12-16 04:43:04,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:43:04,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 805 treesize of output 805 [2023-12-16 04:43:04,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1296 treesize of output 1290 [2023-12-16 04:43:04,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1256 treesize of output 1248 [2023-12-16 04:43:04,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-16 04:43:05,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-16 04:43:05,325 INFO L349 Elim1Store]: treesize reduction 278, result has 52.0 percent of original size [2023-12-16 04:43:05,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 5259 treesize of output 5231 [2023-12-16 04:43:05,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:43:05,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1601 treesize of output 1533 [2023-12-16 04:43:05,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:43:05,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2591 treesize of output 2587 [2023-12-16 04:43:05,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:43:05,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2511 treesize of output 2503 [2023-12-16 04:43:05,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:43:05,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 495 treesize of output 499 [2023-12-16 04:43:18,345 WARN L293 SmtUtils]: Spent 9.64s on a formula simplification that was a NOOP. DAG size: 1153 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-16 04:43:18,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:43:18,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 24 select indices, 24 select index equivalence classes, 0 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 276 case distinctions, treesize of input 2587 treesize of output 4729 Received shutdown request... [2023-12-16 04:43:37,661 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 04:43:37,661 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 04:43:37,670 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:43:37,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-16 04:43:37,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:37,877 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-280-3-1 context. [2023-12-16 04:43:37,881 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:43:37,882 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:43:37,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:43:37 BoogieIcfgContainer [2023-12-16 04:43:37,884 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:43:37,884 INFO L158 Benchmark]: Toolchain (without parser) took 67481.01ms. Allocated memory was 364.9MB in the beginning and 1.1GB in the end (delta: 728.8MB). Free memory was 320.8MB in the beginning and 570.5MB in the end (delta: -249.7MB). Peak memory consumption was 671.1MB. Max. memory is 8.0GB. [2023-12-16 04:43:37,884 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 201.3MB. Free memory is still 148.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:43:37,884 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.95ms. Allocated memory is still 364.9MB. Free memory was 320.3MB in the beginning and 301.6MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-16 04:43:37,884 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.20ms. Allocated memory is still 364.9MB. Free memory was 301.6MB in the beginning and 299.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 04:43:37,884 INFO L158 Benchmark]: Boogie Preprocessor took 38.15ms. Allocated memory is still 364.9MB. Free memory was 299.0MB in the beginning and 295.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 04:43:37,885 INFO L158 Benchmark]: RCFGBuilder took 354.35ms. Allocated memory is still 364.9MB. Free memory was 295.8MB in the beginning and 273.3MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-16 04:43:37,885 INFO L158 Benchmark]: TraceAbstraction took 66696.50ms. Allocated memory was 364.9MB in the beginning and 1.1GB in the end (delta: 728.8MB). Free memory was 272.7MB in the beginning and 570.5MB in the end (delta: -297.8MB). Peak memory consumption was 623.9MB. Max. memory is 8.0GB. [2023-12-16 04:43:37,885 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.09ms. Allocated memory is still 201.3MB. Free memory is still 148.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 355.95ms. Allocated memory is still 364.9MB. Free memory was 320.3MB in the beginning and 301.6MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.20ms. Allocated memory is still 364.9MB. Free memory was 301.6MB in the beginning and 299.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.15ms. Allocated memory is still 364.9MB. Free memory was 299.0MB in the beginning and 295.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 354.35ms. Allocated memory is still 364.9MB. Free memory was 295.8MB in the beginning and 273.3MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 66696.50ms. Allocated memory was 364.9MB in the beginning and 1.1GB in the end (delta: 728.8MB). Free memory was 272.7MB in the beginning and 570.5MB in the end (delta: -297.8MB). Peak memory consumption was 623.9MB. 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 - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 669). Cancelled while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-280-3-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 66.7s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 310 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 310 mSDsluCounter, 1190 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 68 IncrementalHoareTripleChecker+Unchecked, 877 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1132 IncrementalHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 313 mSDtfsCounter, 1132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 350 GetRequests, 239 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 14.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=10, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 45 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 497 ConstructedInterpolants, 17 QuantifiedInterpolants, 3384 SizeOfPredicates, 59 NumberOfNonLiveVariables, 1874 ConjunctsInSsa, 157 ConjunctsInUnsatCore, 24 InterpolantComputations, 7 PerfectInterpolantSequences, 121/154 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: Timeout Completed graceful shutdown