/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/forester-heap/sll-circular-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 03:19:23,840 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 03:19:23,914 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 03:19:23,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 03:19:23,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 03:19:23,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 03:19:23,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 03:19:23,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 03:19:23,942 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 03:19:23,945 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 03:19:23,945 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 03:19:23,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 03:19:23,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 03:19:23,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 03:19:23,947 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 03:19:23,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 03:19:23,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 03:19:23,947 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 03:19:23,947 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 03:19:23,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 03:19:23,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 03:19:23,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 03:19:23,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 03:19:23,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 03:19:23,949 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 03:19:23,949 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 03:19:23,949 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 03:19:23,950 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 03:19:23,950 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 03:19:23,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 03:19:23,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 03:19:23,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 03:19:23,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:19:23,951 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 03:19:23,951 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 03:19:23,952 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 03:19:23,952 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 03:19:23,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 03:19:23,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 03:19:23,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 03:19:23,952 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 03:19:23,952 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 03:19:23,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 03:19:23,953 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 03:19:24,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 03:19:24,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 03:19:24,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 03:19:24,169 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 03:19:24,169 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 03:19:24,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-circular-1.i [2023-12-21 03:19:25,253 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 03:19:25,399 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 03:19:25,399 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-circular-1.i [2023-12-21 03:19:25,407 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2f14fb73/991581be85ae41ee81f6521f8d9390fa/FLAG726a29c1d [2023-12-21 03:19:25,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2f14fb73/991581be85ae41ee81f6521f8d9390fa [2023-12-21 03:19:25,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 03:19:25,795 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 03:19:25,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 03:19:25,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 03:19:25,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 03:19:25,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:19:25" (1/1) ... [2023-12-21 03:19:25,811 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62372d3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:19:25, skipping insertion in model container [2023-12-21 03:19:25,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:19:25" (1/1) ... [2023-12-21 03:19:25,884 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 03:19:26,165 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-circular-1.i[22324,22337] [2023-12-21 03:19:26,169 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-circular-1.i[22430,22443] [2023-12-21 03:19:26,171 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-circular-1.i[22555,22568] [2023-12-21 03:19:26,175 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:19:26,184 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 03:19:26,215 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-circular-1.i[22324,22337] [2023-12-21 03:19:26,218 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-circular-1.i[22430,22443] [2023-12-21 03:19:26,220 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-circular-1.i[22555,22568] [2023-12-21 03:19:26,223 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:19:26,243 INFO L206 MainTranslator]: Completed translation [2023-12-21 03:19:26,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:19:26 WrapperNode [2023-12-21 03:19:26,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 03:19:26,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 03:19:26,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 03:19:26,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 03:19:26,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:19:26" (1/1) ... [2023-12-21 03:19:26,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:19:26" (1/1) ... [2023-12-21 03:19:26,301 INFO L138 Inliner]: procedures = 119, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 114 [2023-12-21 03:19:26,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 03:19:26,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 03:19:26,302 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 03:19:26,302 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 03:19:26,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:19:26" (1/1) ... [2023-12-21 03:19:26,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:19:26" (1/1) ... [2023-12-21 03:19:26,318 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:19:26" (1/1) ... [2023-12-21 03:19:26,341 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2023-12-21 03:19:26,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:19:26" (1/1) ... [2023-12-21 03:19:26,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:19:26" (1/1) ... [2023-12-21 03:19:26,350 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:19:26" (1/1) ... [2023-12-21 03:19:26,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:19:26" (1/1) ... [2023-12-21 03:19:26,358 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:19:26" (1/1) ... [2023-12-21 03:19:26,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:19:26" (1/1) ... [2023-12-21 03:19:26,365 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 03:19:26,365 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 03:19:26,365 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 03:19:26,365 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 03:19:26,366 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:19:26" (1/1) ... [2023-12-21 03:19:26,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:19:26,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:19:26,395 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 03:19:26,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 03:19:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 03:19:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 03:19:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 03:19:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 03:19:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 03:19:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 03:19:26,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-21 03:19:26,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-21 03:19:26,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-21 03:19:26,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-21 03:19:26,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 03:19:26,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 03:19:26,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 03:19:26,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 03:19:26,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 03:19:26,546 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 03:19:26,548 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 03:19:26,714 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 03:19:26,734 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 03:19:26,735 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-12-21 03:19:26,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:19:26 BoogieIcfgContainer [2023-12-21 03:19:26,735 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 03:19:26,736 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 03:19:26,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 03:19:26,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 03:19:26,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:19:25" (1/3) ... [2023-12-21 03:19:26,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6958d310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:19:26, skipping insertion in model container [2023-12-21 03:19:26,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:19:26" (2/3) ... [2023-12-21 03:19:26,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6958d310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:19:26, skipping insertion in model container [2023-12-21 03:19:26,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:19:26" (3/3) ... [2023-12-21 03:19:26,740 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2023-12-21 03:19:26,753 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 03:19:26,753 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-12-21 03:19:26,781 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 03:19:26,785 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;@606b70e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 03:19:26,785 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-21 03:19:26,788 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 29 states have internal predecessors, (48), 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-21 03:19:26,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-21 03:19:26,793 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:19:26,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-21 03:19:26,793 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:19:26,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:19:26,797 INFO L85 PathProgramCache]: Analyzing trace with hash 149304739, now seen corresponding path program 1 times [2023-12-21 03:19:26,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:19:26,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808083897] [2023-12-21 03:19:26,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:19:26,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:19:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:19:26,939 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-21 03:19:26,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:19:26,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808083897] [2023-12-21 03:19:26,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808083897] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:19:26,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:19:26,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 03:19:26,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735189237] [2023-12-21 03:19:26,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:19:26,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 03:19:26,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:19:26,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 03:19:26,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 03:19:26,973 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 29 states have internal predecessors, (48), 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-21 03:19:27,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:19:27,011 INFO L93 Difference]: Finished difference Result 59 states and 95 transitions. [2023-12-21 03:19:27,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 03:19:27,014 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2023-12-21 03:19:27,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:19:27,019 INFO L225 Difference]: With dead ends: 59 [2023-12-21 03:19:27,019 INFO L226 Difference]: Without dead ends: 25 [2023-12-21 03:19:27,021 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-21 03:19:27,023 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:19:27,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:19:27,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-21 03:19:27,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-21 03:19:27,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 24 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-21 03:19:27,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-12-21 03:19:27,054 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 5 [2023-12-21 03:19:27,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:19:27,055 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-12-21 03:19:27,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-21 03:19:27,055 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-12-21 03:19:27,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-21 03:19:27,055 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:19:27,056 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-21 03:19:27,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 03:19:27,057 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:19:27,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:19:27,057 INFO L85 PathProgramCache]: Analyzing trace with hash 292511250, now seen corresponding path program 1 times [2023-12-21 03:19:27,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:19:27,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863113763] [2023-12-21 03:19:27,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:19:27,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:19:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:19:27,258 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-21 03:19:27,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:19:27,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863113763] [2023-12-21 03:19:27,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863113763] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:19:27,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:19:27,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 03:19:27,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532833530] [2023-12-21 03:19:27,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:19:27,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 03:19:27,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:19:27,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 03:19:27,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:19:27,265 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-21 03:19:27,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:19:27,332 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2023-12-21 03:19:27,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 03:19:27,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2023-12-21 03:19:27,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:19:27,334 INFO L225 Difference]: With dead ends: 41 [2023-12-21 03:19:27,334 INFO L226 Difference]: Without dead ends: 37 [2023-12-21 03:19:27,334 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-21 03:19:27,335 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:19:27,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 43 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:19:27,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-21 03:19:27,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2023-12-21 03:19:27,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 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-21 03:19:27,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-12-21 03:19:27,347 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 6 [2023-12-21 03:19:27,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:19:27,347 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-12-21 03:19:27,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-21 03:19:27,348 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-12-21 03:19:27,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-21 03:19:27,348 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:19:27,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:19:27,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 03:19:27,349 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:19:27,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:19:27,351 INFO L85 PathProgramCache]: Analyzing trace with hash 393679078, now seen corresponding path program 1 times [2023-12-21 03:19:27,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:19:27,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151906452] [2023-12-21 03:19:27,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:19:27,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:19:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:19:27,423 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-21 03:19:27,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:19:27,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151906452] [2023-12-21 03:19:27,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151906452] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:19:27,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:19:27,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 03:19:27,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093620845] [2023-12-21 03:19:27,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:19:27,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 03:19:27,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:19:27,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 03:19:27,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 03:19:27,425 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-21 03:19:27,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:19:27,451 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2023-12-21 03:19:27,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 03:19:27,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2023-12-21 03:19:27,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:19:27,454 INFO L225 Difference]: With dead ends: 70 [2023-12-21 03:19:27,454 INFO L226 Difference]: Without dead ends: 48 [2023-12-21 03:19:27,454 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-21 03:19:27,455 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 45 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-21 03:19:27,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 45 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:19:27,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-21 03:19:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2023-12-21 03:19:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 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-21 03:19:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2023-12-21 03:19:27,460 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 9 [2023-12-21 03:19:27,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:19:27,460 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2023-12-21 03:19:27,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-21 03:19:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2023-12-21 03:19:27,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-21 03:19:27,461 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:19:27,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:19:27,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 03:19:27,461 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:19:27,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:19:27,462 INFO L85 PathProgramCache]: Analyzing trace with hash -659012930, now seen corresponding path program 1 times [2023-12-21 03:19:27,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:19:27,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468914198] [2023-12-21 03:19:27,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:19:27,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:19:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:19:27,517 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-21 03:19:27,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:19:27,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468914198] [2023-12-21 03:19:27,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468914198] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:19:27,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:19:27,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 03:19:27,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069738458] [2023-12-21 03:19:27,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:19:27,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 03:19:27,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:19:27,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 03:19:27,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 03:19:27,519 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-21 03:19:27,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:19:27,540 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2023-12-21 03:19:27,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 03:19:27,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-21 03:19:27,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:19:27,542 INFO L225 Difference]: With dead ends: 37 [2023-12-21 03:19:27,542 INFO L226 Difference]: Without dead ends: 35 [2023-12-21 03:19:27,542 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-21 03:19:27,547 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:19:27,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:19:27,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-21 03:19:27,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-12-21 03:19:27,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 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-21 03:19:27,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2023-12-21 03:19:27,551 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 12 [2023-12-21 03:19:27,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:19:27,552 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2023-12-21 03:19:27,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-21 03:19:27,552 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2023-12-21 03:19:27,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-21 03:19:27,552 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:19:27,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:19:27,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 03:19:27,553 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:19:27,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:19:27,553 INFO L85 PathProgramCache]: Analyzing trace with hash -659011008, now seen corresponding path program 1 times [2023-12-21 03:19:27,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:19:27,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870034942] [2023-12-21 03:19:27,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:19:27,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:19:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:19:27,933 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-21 03:19:27,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:19:27,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870034942] [2023-12-21 03:19:27,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870034942] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:19:27,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:19:27,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 03:19:27,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362693737] [2023-12-21 03:19:27,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:19:27,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 03:19:27,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:19:27,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 03:19:27,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 03:19:27,935 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-21 03:19:28,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:19:28,019 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2023-12-21 03:19:28,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 03:19:28,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-21 03:19:28,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:19:28,020 INFO L225 Difference]: With dead ends: 46 [2023-12-21 03:19:28,020 INFO L226 Difference]: Without dead ends: 33 [2023-12-21 03:19:28,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-21 03:19:28,021 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:19:28,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 68 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:19:28,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-21 03:19:28,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-12-21 03:19:28,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 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-21 03:19:28,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2023-12-21 03:19:28,027 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 12 [2023-12-21 03:19:28,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:19:28,027 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2023-12-21 03:19:28,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-21 03:19:28,027 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2023-12-21 03:19:28,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-21 03:19:28,028 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:19:28,028 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:19:28,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 03:19:28,028 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:19:28,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:19:28,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1208969863, now seen corresponding path program 1 times [2023-12-21 03:19:28,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:19:28,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279363948] [2023-12-21 03:19:28,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:19:28,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:19:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:19:28,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:19:28,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:19:28,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279363948] [2023-12-21 03:19:28,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279363948] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:19:28,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478990236] [2023-12-21 03:19:28,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:19:28,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:19:28,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:19:28,140 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:19:28,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 03:19:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:19:28,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-21 03:19:28,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:19:28,266 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-21 03:19:28,301 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 16 treesize of output 16 [2023-12-21 03:19:28,316 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-21 03:19:28,316 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-21 03:19:28,326 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 5 treesize of output 3 [2023-12-21 03:19:28,339 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-21 03:19:28,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-12-21 03:19:28,368 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 16 treesize of output 11 [2023-12-21 03:19:28,417 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-21 03:19:28,418 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 33 treesize of output 32 [2023-12-21 03:19:28,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-21 03:19:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:19:28,428 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:19:28,437 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_185 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-12-21 03:19:28,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:19:28,502 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 1 case distinctions, treesize of input 19 treesize of output 20 [2023-12-21 03:19:28,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:19:28,513 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 50 treesize of output 41 [2023-12-21 03:19:28,518 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 20 treesize of output 18 [2023-12-21 03:19:28,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-21 03:19:28,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478990236] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:19:28,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:19:28,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-12-21 03:19:28,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176756035] [2023-12-21 03:19:28,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:19:28,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 03:19:28,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:19:28,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 03:19:28,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=38, Unknown=1, NotChecked=12, Total=72 [2023-12-21 03:19:28,608 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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-21 03:19:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:19:28,676 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2023-12-21 03:19:28,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 03:19:28,677 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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-21 03:19:28,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:19:28,677 INFO L225 Difference]: With dead ends: 60 [2023-12-21 03:19:28,677 INFO L226 Difference]: Without dead ends: 58 [2023-12-21 03:19:28,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=48, Unknown=1, NotChecked=14, Total=90 [2023-12-21 03:19:28,678 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:19:28,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 86 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 37 Unchecked, 0.0s Time] [2023-12-21 03:19:28,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-21 03:19:28,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 47. [2023-12-21 03:19:28,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 46 states have internal predecessors, (57), 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-21 03:19:28,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2023-12-21 03:19:28,684 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 12 [2023-12-21 03:19:28,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:19:28,684 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2023-12-21 03:19:28,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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-21 03:19:28,684 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2023-12-21 03:19:28,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-21 03:19:28,685 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:19:28,685 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:19:28,704 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-21 03:19:28,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-21 03:19:28,890 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:19:28,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:19:28,891 INFO L85 PathProgramCache]: Analyzing trace with hash 292973760, now seen corresponding path program 1 times [2023-12-21 03:19:28,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:19:28,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444453558] [2023-12-21 03:19:28,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:19:28,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:19:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:19:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:19:28,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:19:28,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444453558] [2023-12-21 03:19:28,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444453558] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:19:28,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:19:28,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 03:19:28,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383865617] [2023-12-21 03:19:28,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:19:28,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 03:19:28,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:19:28,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 03:19:28,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 03:19:28,942 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-21 03:19:28,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:19:28,960 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2023-12-21 03:19:28,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 03:19:28,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2023-12-21 03:19:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:19:28,961 INFO L225 Difference]: With dead ends: 95 [2023-12-21 03:19:28,961 INFO L226 Difference]: Without dead ends: 72 [2023-12-21 03:19:28,961 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-21 03:19:28,962 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:19:28,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 67 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:19:28,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-21 03:19:28,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2023-12-21 03:19:28,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 54 states have internal predecessors, (67), 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-21 03:19:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2023-12-21 03:19:28,966 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 16 [2023-12-21 03:19:28,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:19:28,966 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2023-12-21 03:19:28,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-21 03:19:28,967 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2023-12-21 03:19:28,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-21 03:19:28,967 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:19:28,967 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:19:28,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 03:19:28,967 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:19:28,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:19:28,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1890030859, now seen corresponding path program 1 times [2023-12-21 03:19:28,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:19:28,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522194135] [2023-12-21 03:19:28,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:19:28,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:19:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:19:29,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:19:29,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:19:29,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522194135] [2023-12-21 03:19:29,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522194135] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:19:29,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477818841] [2023-12-21 03:19:29,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:19:29,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:19:29,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:19:29,489 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-21 03:19:29,494 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-21 03:19:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:19:29,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-21 03:19:29,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:19:29,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 03:19:29,596 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-21 03:19:29,629 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-21 03:19:29,629 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 11 treesize of output 11 [2023-12-21 03:19:29,641 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 35 treesize of output 18 [2023-12-21 03:19:29,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 11 [2023-12-21 03:19:29,649 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 27 treesize of output 15 [2023-12-21 03:19:29,656 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 27 treesize of output 15 [2023-12-21 03:19:29,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-21 03:19:29,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-21 03:19:29,728 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 16 treesize of output 11 [2023-12-21 03:19:29,817 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-21 03:19:29,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 66 [2023-12-21 03:19:29,824 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-21 03:19:29,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2023-12-21 03:19:29,943 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 03:19:29,944 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 03:19:29,944 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2023-12-21 03:19:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:19:29,971 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:19:30,003 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_328 (Array Int Int)) (v_ArrVal_329 (Array Int Int)) (v_ArrVal_327 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (or (not (= v_ArrVal_328 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0 (select v_ArrVal_328 .cse0)))) (= (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0 v_ArrVal_327))) (.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_328))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_329) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))) 0)))) is different from false [2023-12-21 03:19:30,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:19:30,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 152 [2023-12-21 03:19:30,159 INFO L349 Elim1Store]: treesize reduction 66, result has 50.7 percent of original size [2023-12-21 03:19:30,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 60826 treesize of output 59145 [2023-12-21 03:19:33,000 INFO L349 Elim1Store]: treesize reduction 78, result has 76.9 percent of original size [2023-12-21 03:19:33,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 73264 treesize of output 59552 Received shutdown request... [2023-12-21 03:33:34,440 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-12-21 03:33:34,451 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-21 03:33:34,451 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 03:33:34,468 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-21 03:33:34,647 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,SelfDestructingSolverStorable7 [2023-12-21 03:33:34,647 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-36-5-3-3-3-2-3-2-1 context. [2023-12-21 03:33:34,649 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-12-21 03:33:34,649 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-12-21 03:33:34,651 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:33:34,653 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 03:33:34,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 03:33:34 BoogieIcfgContainer [2023-12-21 03:33:34,654 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 03:33:34,655 INFO L158 Benchmark]: Toolchain (without parser) took 848859.54ms. Allocated memory was 297.8MB in the beginning and 1.2GB in the end (delta: 918.6MB). Free memory was 244.8MB in the beginning and 895.9MB in the end (delta: -651.1MB). Peak memory consumption was 726.8MB. Max. memory is 8.0GB. [2023-12-21 03:33:34,655 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 207.6MB. Free memory is still 158.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 03:33:34,655 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.01ms. Allocated memory is still 297.8MB. Free memory was 244.8MB in the beginning and 226.6MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-21 03:33:34,655 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.29ms. Allocated memory is still 297.8MB. Free memory was 226.6MB in the beginning and 224.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 03:33:34,656 INFO L158 Benchmark]: Boogie Preprocessor took 62.64ms. Allocated memory is still 297.8MB. Free memory was 224.4MB in the beginning and 222.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 03:33:34,657 INFO L158 Benchmark]: RCFGBuilder took 369.87ms. Allocated memory is still 297.8MB. Free memory was 222.0MB in the beginning and 259.9MB in the end (delta: -37.9MB). Peak memory consumption was 16.6MB. Max. memory is 8.0GB. [2023-12-21 03:33:34,659 INFO L158 Benchmark]: TraceAbstraction took 847918.04ms. Allocated memory was 297.8MB in the beginning and 1.2GB in the end (delta: 918.6MB). Free memory was 259.4MB in the beginning and 895.9MB in the end (delta: -636.5MB). Peak memory consumption was 741.6MB. Max. memory is 8.0GB. [2023-12-21 03:33:34,660 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.56ms. Allocated memory is still 207.6MB. Free memory is still 158.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 448.01ms. Allocated memory is still 297.8MB. Free memory was 244.8MB in the beginning and 226.6MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.29ms. Allocated memory is still 297.8MB. Free memory was 226.6MB in the beginning and 224.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 62.64ms. Allocated memory is still 297.8MB. Free memory was 224.4MB in the beginning and 222.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 369.87ms. Allocated memory is still 297.8MB. Free memory was 222.0MB in the beginning and 259.9MB in the end (delta: -37.9MB). Peak memory consumption was 16.6MB. Max. memory is 8.0GB. * TraceAbstraction took 847918.04ms. Allocated memory was 297.8MB in the beginning and 1.2GB in the end (delta: 918.6MB). Free memory was 259.4MB in the beginning and 895.9MB in the end (delta: -636.5MB). Peak memory consumption was 741.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1032). Cancelled while NwaCegarLoop was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-36-5-3-3-3-2-3-2-1 context. - TimeoutResultAtElement [Line: 1023]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1023). Cancelled while NwaCegarLoop was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-36-5-3-3-3-2-3-2-1 context. - TimeoutResultAtElement [Line: 1028]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1028). Cancelled while NwaCegarLoop was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-36-5-3-3-3-2-3-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 847.9s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 101 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 391 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 37 IncrementalHoareTripleChecker+Unchecked, 205 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 149 IncrementalHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 186 mSDtfsCounter, 149 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=7, InterpolantAutomatonStates: 25, 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, 7 MinimizatonAttempts, 52 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 87 ConstructedInterpolants, 9 QuantifiedInterpolants, 792 SizeOfPredicates, 4 NumberOfNonLiveVariables, 135 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 4/10 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