/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/array-tiling/nr4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 07:47:20,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 07:47:21,066 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-20 07:47:21,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 07:47:21,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 07:47:21,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 07:47:21,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 07:47:21,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 07:47:21,095 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 07:47:21,098 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 07:47:21,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 07:47:21,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 07:47:21,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 07:47:21,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 07:47:21,100 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 07:47:21,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 07:47:21,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 07:47:21,100 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 07:47:21,100 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 07:47:21,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 07:47:21,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 07:47:21,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 07:47:21,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 07:47:21,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 07:47:21,102 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 07:47:21,102 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 07:47:21,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 07:47:21,103 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 07:47:21,103 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 07:47:21,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 07:47:21,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 07:47:21,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 07:47:21,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 07:47:21,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 07:47:21,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 07:47:21,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 07:47:21,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 07:47:21,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 07:47:21,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 07:47:21,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 07:47:21,105 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 07:47:21,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 07:47:21,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 07:47:21,106 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-20 07:47:21,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 07:47:21,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 07:47:21,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 07:47:21,318 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 07:47:21,318 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 07:47:21,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/nr4.c [2023-12-20 07:47:22,450 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 07:47:22,627 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 07:47:22,628 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr4.c [2023-12-20 07:47:22,633 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb192af66/9afa04172747483aa11c3fbf0e4593ee/FLAGa245e13b1 [2023-12-20 07:47:22,650 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb192af66/9afa04172747483aa11c3fbf0e4593ee [2023-12-20 07:47:22,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 07:47:22,653 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 07:47:22,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 07:47:22,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 07:47:22,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 07:47:22,661 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 07:47:22" (1/1) ... [2023-12-20 07:47:22,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ae0052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:47:22, skipping insertion in model container [2023-12-20 07:47:22,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 07:47:22" (1/1) ... [2023-12-20 07:47:22,677 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 07:47:22,770 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr4.c[394,407] [2023-12-20 07:47:22,782 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 07:47:22,792 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 07:47:22,800 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr4.c[394,407] [2023-12-20 07:47:22,805 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 07:47:22,815 INFO L206 MainTranslator]: Completed translation [2023-12-20 07:47:22,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:47:22 WrapperNode [2023-12-20 07:47:22,815 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 07:47:22,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 07:47:22,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 07:47:22,816 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 07:47:22,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:47:22" (1/1) ... [2023-12-20 07:47:22,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:47:22" (1/1) ... [2023-12-20 07:47:22,845 INFO L138 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2023-12-20 07:47:22,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 07:47:22,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 07:47:22,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 07:47:22,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 07:47:22,853 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:47:22" (1/1) ... [2023-12-20 07:47:22,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:47:22" (1/1) ... [2023-12-20 07:47:22,855 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:47:22" (1/1) ... [2023-12-20 07:47:22,864 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 6, 4]. 50 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 2 writes are split as follows [0, 0, 2]. [2023-12-20 07:47:22,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:47:22" (1/1) ... [2023-12-20 07:47:22,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:47:22" (1/1) ... [2023-12-20 07:47:22,867 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:47:22" (1/1) ... [2023-12-20 07:47:22,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:47:22" (1/1) ... [2023-12-20 07:47:22,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:47:22" (1/1) ... [2023-12-20 07:47:22,871 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:47:22" (1/1) ... [2023-12-20 07:47:22,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 07:47:22,873 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 07:47:22,873 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 07:47:22,873 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 07:47:22,873 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:47:22" (1/1) ... [2023-12-20 07:47:22,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 07:47:22,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 07:47:22,909 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-20 07:47:22,964 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-20 07:47:22,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 07:47:22,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 07:47:22,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-20 07:47:22,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-20 07:47:22,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-20 07:47:22,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-20 07:47:22,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-20 07:47:22,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-20 07:47:22,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 07:47:22,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 07:47:22,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-20 07:47:22,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-20 07:47:22,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-20 07:47:22,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-20 07:47:23,034 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 07:47:23,036 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 07:47:23,179 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 07:47:23,194 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 07:47:23,195 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-20 07:47:23,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 07:47:23 BoogieIcfgContainer [2023-12-20 07:47:23,195 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 07:47:23,199 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 07:47:23,199 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 07:47:23,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 07:47:23,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 07:47:22" (1/3) ... [2023-12-20 07:47:23,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b26476f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 07:47:23, skipping insertion in model container [2023-12-20 07:47:23,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:47:22" (2/3) ... [2023-12-20 07:47:23,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b26476f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 07:47:23, skipping insertion in model container [2023-12-20 07:47:23,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 07:47:23" (3/3) ... [2023-12-20 07:47:23,202 INFO L112 eAbstractionObserver]: Analyzing ICFG nr4.c [2023-12-20 07:47:23,213 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 07:47:23,214 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 07:47:23,241 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 07:47:23,246 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;@4dea58f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 07:47:23,246 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 07:47:23,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.65) internal successors, (33), 21 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-20 07:47:23,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-20 07:47:23,252 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 07:47:23,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 07:47:23,253 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 07:47:23,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 07:47:23,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2106680282, now seen corresponding path program 1 times [2023-12-20 07:47:23,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 07:47:23,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479544105] [2023-12-20 07:47:23,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 07:47:23,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 07:47:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 07:47:23,366 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-20 07:47:23,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 07:47:23,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479544105] [2023-12-20 07:47:23,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479544105] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 07:47:23,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 07:47:23,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 07:47:23,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673447876] [2023-12-20 07:47:23,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 07:47:23,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 07:47:23,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 07:47:23,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 07:47:23,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 07:47:23,390 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.65) internal successors, (33), 21 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) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 07:47:23,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 07:47:23,405 INFO L93 Difference]: Finished difference Result 40 states and 59 transitions. [2023-12-20 07:47:23,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 07:47:23,406 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-20 07:47:23,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 07:47:23,411 INFO L225 Difference]: With dead ends: 40 [2023-12-20 07:47:23,411 INFO L226 Difference]: Without dead ends: 18 [2023-12-20 07:47:23,413 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-20 07:47:23,415 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 07:47:23,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 07:47:23,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-20 07:47:23,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-12-20 07:47:23,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-20 07:47:23,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-12-20 07:47:23,460 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 12 [2023-12-20 07:47:23,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 07:47:23,460 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-12-20 07:47:23,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 07:47:23,460 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-12-20 07:47:23,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-20 07:47:23,461 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 07:47:23,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 07:47:23,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 07:47:23,461 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 07:47:23,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 07:47:23,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1426621912, now seen corresponding path program 1 times [2023-12-20 07:47:23,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 07:47:23,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107760510] [2023-12-20 07:47:23,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 07:47:23,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 07:47:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 07:47:23,627 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-20 07:47:23,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 07:47:23,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107760510] [2023-12-20 07:47:23,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107760510] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 07:47:23,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 07:47:23,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 07:47:23,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666043314] [2023-12-20 07:47:23,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 07:47:23,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 07:47:23,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 07:47:23,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 07:47:23,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 07:47:23,630 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.0) 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-20 07:47:23,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 07:47:23,659 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2023-12-20 07:47:23,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 07:47:23,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) 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-20 07:47:23,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 07:47:23,660 INFO L225 Difference]: With dead ends: 23 [2023-12-20 07:47:23,660 INFO L226 Difference]: Without dead ends: 21 [2023-12-20 07:47:23,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-20 07:47:23,661 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 07:47:23,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 51 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 07:47:23,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-20 07:47:23,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2023-12-20 07:47:23,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 07:47:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-12-20 07:47:23,665 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 12 [2023-12-20 07:47:23,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 07:47:23,665 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-12-20 07:47:23,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) 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-20 07:47:23,665 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-12-20 07:47:23,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-20 07:47:23,666 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 07:47:23,666 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 07:47:23,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 07:47:23,667 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 07:47:23,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 07:47:23,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1426562330, now seen corresponding path program 1 times [2023-12-20 07:47:23,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 07:47:23,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059167925] [2023-12-20 07:47:23,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 07:47:23,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 07:47:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 07:47:23,866 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-20 07:47:23,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 07:47:23,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059167925] [2023-12-20 07:47:23,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059167925] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 07:47:23,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 07:47:23,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 07:47:23,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70783648] [2023-12-20 07:47:23,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 07:47:23,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 07:47:23,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 07:47:23,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 07:47:23,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-20 07:47:23,872 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-20 07:47:23,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 07:47:23,912 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2023-12-20 07:47:23,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 07:47:23,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-20 07:47:23,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 07:47:23,914 INFO L225 Difference]: With dead ends: 35 [2023-12-20 07:47:23,915 INFO L226 Difference]: Without dead ends: 25 [2023-12-20 07:47:23,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-20 07:47:23,916 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 54 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 07:47:23,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 22 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 07:47:23,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-20 07:47:23,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2023-12-20 07:47:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-20 07:47:23,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-12-20 07:47:23,920 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 12 [2023-12-20 07:47:23,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 07:47:23,920 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-12-20 07:47:23,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-20 07:47:23,921 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-12-20 07:47:23,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-20 07:47:23,921 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 07:47:23,921 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 07:47:23,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 07:47:23,921 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 07:47:23,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 07:47:23,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1008841274, now seen corresponding path program 1 times [2023-12-20 07:47:23,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 07:47:23,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587794523] [2023-12-20 07:47:23,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 07:47:23,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 07:47:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 07:47:23,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 07:47:23,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 07:47:23,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587794523] [2023-12-20 07:47:23,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587794523] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 07:47:23,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 07:47:23,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 07:47:23,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115575816] [2023-12-20 07:47:23,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 07:47:23,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 07:47:23,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 07:47:23,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 07:47:23,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 07:47:23,971 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-20 07:47:23,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 07:47:23,986 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2023-12-20 07:47:23,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 07:47:23,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2023-12-20 07:47:23,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 07:47:23,987 INFO L225 Difference]: With dead ends: 39 [2023-12-20 07:47:23,987 INFO L226 Difference]: Without dead ends: 24 [2023-12-20 07:47:23,987 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-20 07:47:23,988 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 07:47:23,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 29 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 07:47:23,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-20 07:47:23,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2023-12-20 07:47:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-20 07:47:23,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-12-20 07:47:23,992 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2023-12-20 07:47:23,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 07:47:23,992 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-12-20 07:47:23,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-20 07:47:23,993 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-12-20 07:47:23,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-20 07:47:23,993 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 07:47:23,993 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 07:47:23,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 07:47:23,993 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 07:47:23,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 07:47:23,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1963751443, now seen corresponding path program 1 times [2023-12-20 07:47:23,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 07:47:23,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393274302] [2023-12-20 07:47:23,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 07:47:23,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 07:47:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 07:47:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 07:47:24,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 07:47:24,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393274302] [2023-12-20 07:47:24,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393274302] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 07:47:24,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99842665] [2023-12-20 07:47:24,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 07:47:24,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 07:47:24,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 07:47:24,072 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-20 07:47:24,122 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-20 07:47:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 07:47:24,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 07:47:24,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 07:47:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 07:47:24,169 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 07:47:24,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 07:47:24,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99842665] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 07:47:24,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 07:47:24,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-12-20 07:47:24,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622002378] [2023-12-20 07:47:24,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 07:47:24,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 07:47:24,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 07:47:24,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 07:47:24,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-20 07:47:24,187 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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-20 07:47:24,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 07:47:24,228 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2023-12-20 07:47:24,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 07:47:24,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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 18 [2023-12-20 07:47:24,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 07:47:24,229 INFO L225 Difference]: With dead ends: 47 [2023-12-20 07:47:24,229 INFO L226 Difference]: Without dead ends: 31 [2023-12-20 07:47:24,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-20 07:47:24,230 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 07:47:24,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 42 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 07:47:24,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-20 07:47:24,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-20 07:47:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 07:47:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2023-12-20 07:47:24,235 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 18 [2023-12-20 07:47:24,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 07:47:24,235 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-12-20 07:47:24,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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-20 07:47:24,235 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2023-12-20 07:47:24,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-20 07:47:24,236 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 07:47:24,236 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 07:47:24,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-20 07:47:24,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 07:47:24,441 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 07:47:24,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 07:47:24,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1355307130, now seen corresponding path program 2 times [2023-12-20 07:47:24,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 07:47:24,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109115993] [2023-12-20 07:47:24,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 07:47:24,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 07:47:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 07:47:24,570 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 07:47:24,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 07:47:24,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109115993] [2023-12-20 07:47:24,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109115993] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 07:47:24,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654836581] [2023-12-20 07:47:24,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-20 07:47:24,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 07:47:24,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 07:47:24,575 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-20 07:47:24,609 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-20 07:47:24,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-20 07:47:24,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-20 07:47:24,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 07:47:24,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 07:47:24,711 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 07:47:24,712 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 07:47:24,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654836581] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 07:47:24,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 07:47:24,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2023-12-20 07:47:24,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388829069] [2023-12-20 07:47:24,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 07:47:24,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 07:47:24,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 07:47:24,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 07:47:24,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2023-12-20 07:47:24,714 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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-20 07:47:24,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 07:47:24,757 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2023-12-20 07:47:24,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 07:47:24,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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 27 [2023-12-20 07:47:24,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 07:47:24,760 INFO L225 Difference]: With dead ends: 56 [2023-12-20 07:47:24,760 INFO L226 Difference]: Without dead ends: 31 [2023-12-20 07:47:24,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2023-12-20 07:47:24,761 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 07:47:24,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 24 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 07:47:24,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-20 07:47:24,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-20 07:47:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 07:47:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-12-20 07:47:24,766 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 27 [2023-12-20 07:47:24,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 07:47:24,766 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-12-20 07:47:24,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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-20 07:47:24,766 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-12-20 07:47:24,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-20 07:47:24,767 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 07:47:24,767 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 07:47:24,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-20 07:47:24,972 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,SelfDestructingSolverStorable5 [2023-12-20 07:47:24,972 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 07:47:24,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 07:47:24,973 INFO L85 PathProgramCache]: Analyzing trace with hash 2056371708, now seen corresponding path program 1 times [2023-12-20 07:47:24,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 07:47:24,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426846049] [2023-12-20 07:47:24,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 07:47:24,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 07:47:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 07:47:25,508 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 07:47:25,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 07:47:25,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426846049] [2023-12-20 07:47:25,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426846049] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 07:47:25,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145654159] [2023-12-20 07:47:25,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 07:47:25,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 07:47:25,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 07:47:25,509 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 07:47:25,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-20 07:47:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 07:47:25,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-20 07:47:25,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 07:47:25,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-20 07:47:25,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 07:47:25,733 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 31 treesize of output 11 [2023-12-20 07:47:25,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 07:47:25,779 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 31 treesize of output 11 [2023-12-20 07:47:25,829 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-12-20 07:47:25,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2023-12-20 07:47:26,027 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 07:47:26,028 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 07:47:47,750 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 57 treesize of output 53 [2023-12-20 07:47:47,754 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 267 treesize of output 259 [2023-12-20 07:47:52,479 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-20 07:47:52,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145654159] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 07:47:52,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 07:47:52,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 40 [2023-12-20 07:47:52,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079722691] [2023-12-20 07:47:52,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 07:47:52,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-20 07:47:52,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 07:47:52,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-20 07:47:52,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1314, Unknown=5, NotChecked=0, Total=1560 [2023-12-20 07:47:52,481 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 40 states, 40 states have (on average 1.85) internal successors, (74), 40 states have internal predecessors, (74), 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-20 07:47:54,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 07:47:54,006 INFO L93 Difference]: Finished difference Result 158 states and 191 transitions. [2023-12-20 07:47:54,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-20 07:47:54,007 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.85) internal successors, (74), 40 states have internal predecessors, (74), 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 27 [2023-12-20 07:47:54,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 07:47:54,008 INFO L225 Difference]: With dead ends: 158 [2023-12-20 07:47:54,008 INFO L226 Difference]: Without dead ends: 133 [2023-12-20 07:47:54,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1812 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=1192, Invalid=5445, Unknown=5, NotChecked=0, Total=6642 [2023-12-20 07:47:54,011 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 522 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 07:47:54,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 88 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 07:47:54,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-12-20 07:47:54,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 51. [2023-12-20 07:47:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 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-20 07:47:54,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2023-12-20 07:47:54,019 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 27 [2023-12-20 07:47:54,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 07:47:54,020 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2023-12-20 07:47:54,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.85) internal successors, (74), 40 states have internal predecessors, (74), 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-20 07:47:54,020 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2023-12-20 07:47:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-20 07:47:54,020 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 07:47:54,021 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 07:47:54,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-20 07:47:54,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 07:47:54,229 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 07:47:54,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 07:47:54,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1325432210, now seen corresponding path program 1 times [2023-12-20 07:47:54,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 07:47:54,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988594273] [2023-12-20 07:47:54,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 07:47:54,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 07:47:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 07:47:54,782 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 07:47:54,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 07:47:54,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988594273] [2023-12-20 07:47:54,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988594273] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 07:47:54,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549461353] [2023-12-20 07:47:54,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 07:47:54,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 07:47:54,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 07:47:54,784 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 07:47:54,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-20 07:47:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 07:47:54,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-20 07:47:54,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 07:47:54,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-20 07:47:54,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 07:47:54,994 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 31 treesize of output 11 [2023-12-20 07:47:55,035 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-12-20 07:47:55,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2023-12-20 07:47:55,388 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 07:47:55,388 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 07:47:55,784 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 61 treesize of output 57 [2023-12-20 07:47:55,789 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 147 treesize of output 139 [2023-12-20 07:47:55,929 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-20 07:47:55,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549461353] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 07:47:55,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 07:47:55,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 43 [2023-12-20 07:47:55,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620051019] [2023-12-20 07:47:55,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 07:47:55,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-20 07:47:55,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 07:47:55,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-20 07:47:55,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1562, Unknown=0, NotChecked=0, Total=1806 [2023-12-20 07:47:55,932 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 43 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 43 states have internal predecessors, (89), 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-20 07:47:58,655 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (let ((.cse4 (select .cse1 4))) (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse5 (<= 3 .cse4))) (and (let ((.cse0 (select .cse1 (+ .cse2 |c_ULTIMATE.start_main_~#volArray~0#1.offset|)))) (or (< |c_ULTIMATE.start_main_~MINVAL~0#1| (+ .cse0 1)) (= .cse0 0))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~j~0#1_34| Int)) (or (< |c_ULTIMATE.start_main_~j~0#1| (+ |v_ULTIMATE.start_main_~j~0#1_34| 1)) (forall ((v_ArrVal_88 Int)) (let ((.cse3 (select (store .cse1 (+ (* 16 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_34| (- 4))) v_ArrVal_88) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (= .cse3 0) (< |c_ULTIMATE.start_main_~MINVAL~0#1| (+ .cse3 1))))))) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (not (= (+ |c_ULTIMATE.start_main_~j~0#1| 1) .cse2)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (or (= .cse4 0) (and (exists ((|ULTIMATE.start_main_~j~0#1| Int)) (= (select .cse1 (+ 16 (* |ULTIMATE.start_main_~j~0#1| (- 4)))) 0)) .cse5)) .cse5)))) is different from false [2023-12-20 07:48:00,785 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (let ((.cse2 (select .cse1 4))) (let ((.cse3 (<= 3 .cse2))) (and (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~j~0#1_34| Int)) (or (< |c_ULTIMATE.start_main_~j~0#1| (+ |v_ULTIMATE.start_main_~j~0#1_34| 1)) (forall ((v_ArrVal_88 Int)) (let ((.cse0 (select (store .cse1 (+ (* 16 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_34| (- 4))) v_ArrVal_88) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (= .cse0 0) (< |c_ULTIMATE.start_main_~MINVAL~0#1| (+ .cse0 1))))))) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (not (= (+ |c_ULTIMATE.start_main_~j~0#1| 1) (* |c_ULTIMATE.start_main_~i~0#1| 4))) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (or (= .cse2 0) (and (exists ((|ULTIMATE.start_main_~j~0#1| Int)) (= (select .cse1 (+ 16 (* |ULTIMATE.start_main_~j~0#1| (- 4)))) 0)) .cse3)) .cse3)))) is different from false [2023-12-20 07:48:01,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 07:48:01,260 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2023-12-20 07:48:01,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-20 07:48:01,261 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 43 states have internal predecessors, (89), 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 32 [2023-12-20 07:48:01,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 07:48:01,262 INFO L225 Difference]: With dead ends: 122 [2023-12-20 07:48:01,262 INFO L226 Difference]: Without dead ends: 82 [2023-12-20 07:48:01,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=590, Invalid=3198, Unknown=2, NotChecked=242, Total=4032 [2023-12-20 07:48:01,264 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 85 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 07:48:01,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 158 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 586 Invalid, 0 Unknown, 162 Unchecked, 0.3s Time] [2023-12-20 07:48:01,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-20 07:48:01,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 54. [2023-12-20 07:48:01,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 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-20 07:48:01,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2023-12-20 07:48:01,274 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 32 [2023-12-20 07:48:01,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 07:48:01,275 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2023-12-20 07:48:01,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 43 states have internal predecessors, (89), 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-20 07:48:01,275 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2023-12-20 07:48:01,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-20 07:48:01,278 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 07:48:01,278 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 07:48:01,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-20 07:48:01,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 07:48:01,479 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 07:48:01,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 07:48:01,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1357597380, now seen corresponding path program 2 times [2023-12-20 07:48:01,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 07:48:01,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065804270] [2023-12-20 07:48:01,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 07:48:01,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 07:48:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 07:48:01,786 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 07:48:01,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 07:48:01,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065804270] [2023-12-20 07:48:01,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065804270] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 07:48:01,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975957849] [2023-12-20 07:48:01,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-20 07:48:01,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 07:48:01,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 07:48:01,788 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 07:48:01,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-20 07:48:01,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-20 07:48:01,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-20 07:48:01,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-20 07:48:01,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 07:48:01,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-20 07:48:02,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 07:48:02,053 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 31 treesize of output 11 [2023-12-20 07:48:02,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-20 07:48:02,214 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 07:48:02,214 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 07:48:02,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2023-12-20 07:48:02,365 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 174 treesize of output 166 [2023-12-20 07:48:02,480 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 07:48:02,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975957849] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 07:48:02,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 07:48:02,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 36 [2023-12-20 07:48:02,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482730621] [2023-12-20 07:48:02,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 07:48:02,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-20 07:48:02,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 07:48:02,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-20 07:48:02,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1068, Unknown=0, NotChecked=0, Total=1260 [2023-12-20 07:48:02,482 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 36 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 36 states have internal predecessors, (100), 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-20 07:48:09,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-20 07:48:12,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-20 07:48:12,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 07:48:12,238 INFO L93 Difference]: Finished difference Result 161 states and 193 transitions. [2023-12-20 07:48:12,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-20 07:48:12,239 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 36 states have internal predecessors, (100), 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 37 [2023-12-20 07:48:12,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 07:48:12,240 INFO L225 Difference]: With dead ends: 161 [2023-12-20 07:48:12,240 INFO L226 Difference]: Without dead ends: 121 [2023-12-20 07:48:12,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=485, Invalid=2595, Unknown=0, NotChecked=0, Total=3080 [2023-12-20 07:48:12,241 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 187 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 44 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2023-12-20 07:48:12,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 191 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 551 Invalid, 11 Unknown, 0 Unchecked, 9.4s Time] [2023-12-20 07:48:12,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-20 07:48:12,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 86. [2023-12-20 07:48:12,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.223529411764706) internal successors, (104), 85 states have internal predecessors, (104), 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-20 07:48:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2023-12-20 07:48:12,252 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 37 [2023-12-20 07:48:12,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 07:48:12,252 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2023-12-20 07:48:12,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 36 states have internal predecessors, (100), 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-20 07:48:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2023-12-20 07:48:12,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-20 07:48:12,253 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 07:48:12,253 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 07:48:12,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-20 07:48:12,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 07:48:12,454 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 07:48:12,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 07:48:12,454 INFO L85 PathProgramCache]: Analyzing trace with hash -403369170, now seen corresponding path program 3 times [2023-12-20 07:48:12,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 07:48:12,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316013111] [2023-12-20 07:48:12,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 07:48:12,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 07:48:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 07:48:12,780 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-20 07:48:12,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 07:48:12,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316013111] [2023-12-20 07:48:12,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316013111] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 07:48:12,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682174382] [2023-12-20 07:48:12,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-20 07:48:12,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 07:48:12,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 07:48:12,781 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 07:48:12,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-20 07:48:12,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-20 07:48:12,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-20 07:48:12,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-20 07:48:12,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 07:48:12,893 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 16 treesize of output 12 [2023-12-20 07:48:13,051 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-20 07:48:13,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 07:48:13,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2023-12-20 07:48:13,205 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 24 treesize of output 20 [2023-12-20 07:48:13,237 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-20 07:48:13,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682174382] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 07:48:13,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 07:48:13,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 31 [2023-12-20 07:48:13,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734644825] [2023-12-20 07:48:13,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 07:48:13,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-20 07:48:13,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 07:48:13,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-20 07:48:13,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=780, Unknown=0, NotChecked=0, Total=930 [2023-12-20 07:48:13,241 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand has 31 states, 31 states have (on average 2.967741935483871) internal successors, (92), 31 states have internal predecessors, (92), 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-20 07:48:14,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 07:48:14,543 INFO L93 Difference]: Finished difference Result 289 states and 343 transitions. [2023-12-20 07:48:14,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-12-20 07:48:14,543 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.967741935483871) internal successors, (92), 31 states have internal predecessors, (92), 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 42 [2023-12-20 07:48:14,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 07:48:14,544 INFO L225 Difference]: With dead ends: 289 [2023-12-20 07:48:14,544 INFO L226 Difference]: Without dead ends: 234 [2023-12-20 07:48:14,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1533 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=889, Invalid=4661, Unknown=0, NotChecked=0, Total=5550 [2023-12-20 07:48:14,546 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 189 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 07:48:14,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 252 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 07:48:14,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-12-20 07:48:14,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 141. [2023-12-20 07:48:14,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.2285714285714286) internal successors, (172), 140 states have internal predecessors, (172), 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-20 07:48:14,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 172 transitions. [2023-12-20 07:48:14,588 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 172 transitions. Word has length 42 [2023-12-20 07:48:14,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 07:48:14,589 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 172 transitions. [2023-12-20 07:48:14,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.967741935483871) internal successors, (92), 31 states have internal predecessors, (92), 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-20 07:48:14,590 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 172 transitions. [2023-12-20 07:48:14,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-20 07:48:14,593 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 07:48:14,593 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 07:48:14,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-20 07:48:14,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 07:48:14,799 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 07:48:14,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 07:48:14,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1967416196, now seen corresponding path program 4 times [2023-12-20 07:48:14,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 07:48:14,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164086320] [2023-12-20 07:48:14,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 07:48:14,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 07:48:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 07:48:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-20 07:48:15,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 07:48:15,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164086320] [2023-12-20 07:48:15,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164086320] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 07:48:15,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047873244] [2023-12-20 07:48:15,031 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-20 07:48:15,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 07:48:15,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 07:48:15,032 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 07:48:15,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-20 07:48:15,079 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-20 07:48:15,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-20 07:48:15,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-20 07:48:15,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 07:48:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-20 07:48:15,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 07:48:15,607 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-20 07:48:15,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047873244] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 07:48:15,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 07:48:15,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2023-12-20 07:48:15,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686139077] [2023-12-20 07:48:15,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 07:48:15,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-20 07:48:15,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 07:48:15,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-20 07:48:15,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2023-12-20 07:48:15,609 INFO L87 Difference]: Start difference. First operand 141 states and 172 transitions. Second operand has 30 states, 30 states have (on average 3.533333333333333) internal successors, (106), 30 states have internal predecessors, (106), 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-20 07:48:15,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 07:48:15,863 INFO L93 Difference]: Finished difference Result 173 states and 208 transitions. [2023-12-20 07:48:15,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-20 07:48:15,863 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.533333333333333) internal successors, (106), 30 states have internal predecessors, (106), 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 47 [2023-12-20 07:48:15,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 07:48:15,867 INFO L225 Difference]: With dead ends: 173 [2023-12-20 07:48:15,867 INFO L226 Difference]: Without dead ends: 142 [2023-12-20 07:48:15,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=384, Invalid=1176, Unknown=0, NotChecked=0, Total=1560 [2023-12-20 07:48:15,877 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 205 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 07:48:15,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 178 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 07:48:15,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-12-20 07:48:15,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 128. [2023-12-20 07:48:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.236220472440945) internal successors, (157), 127 states have internal predecessors, (157), 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-20 07:48:15,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 157 transitions. [2023-12-20 07:48:15,891 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 157 transitions. Word has length 47 [2023-12-20 07:48:15,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 07:48:15,892 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 157 transitions. [2023-12-20 07:48:15,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.533333333333333) internal successors, (106), 30 states have internal predecessors, (106), 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-20 07:48:15,906 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 157 transitions. [2023-12-20 07:48:15,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-20 07:48:15,907 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 07:48:15,907 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 07:48:15,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-20 07:48:16,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 07:48:16,112 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 07:48:16,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 07:48:16,113 INFO L85 PathProgramCache]: Analyzing trace with hash 780301956, now seen corresponding path program 5 times [2023-12-20 07:48:16,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 07:48:16,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175430584] [2023-12-20 07:48:16,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 07:48:16,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 07:48:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 07:48:17,029 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 3 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 07:48:17,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 07:48:17,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175430584] [2023-12-20 07:48:17,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175430584] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 07:48:17,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670259204] [2023-12-20 07:48:17,030 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-20 07:48:17,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 07:48:17,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 07:48:17,041 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 07:48:17,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-20 07:48:17,137 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2023-12-20 07:48:17,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-20 07:48:17,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-20 07:48:17,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 07:48:17,175 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 25 treesize of output 1 [2023-12-20 07:48:17,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 18 [2023-12-20 07:48:17,302 INFO L349 Elim1Store]: treesize reduction 35, result has 25.5 percent of original size [2023-12-20 07:48:17,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 18 [2023-12-20 07:48:17,392 INFO L349 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2023-12-20 07:48:17,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 13 [2023-12-20 07:48:17,426 INFO L349 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2023-12-20 07:48:17,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 13 [2023-12-20 07:48:17,463 INFO L349 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2023-12-20 07:48:17,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 13 [2023-12-20 07:48:17,498 INFO L349 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2023-12-20 07:48:17,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 13 [2023-12-20 07:48:17,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-12-20 07:48:17,596 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 30 proven. 77 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-20 07:48:17,596 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 07:49:36,517 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_203 Int) (v_ArrVal_201 Int) (v_ArrVal_199 Int) (|v_ULTIMATE.start_main_~j~0#1_64| Int) (|v_ULTIMATE.start_main_~j~0#1_65| Int) (|v_ULTIMATE.start_main_~j~0#1_66| Int) (v_ArrVal_206 Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_65| (+ |v_ULTIMATE.start_main_~j~0#1_64| 1)) (< |c_ULTIMATE.start_main_~j~0#1| (+ |v_ULTIMATE.start_main_~j~0#1_66| 1)) (< |v_ULTIMATE.start_main_~j~0#1_66| (+ |v_ULTIMATE.start_main_~j~0#1_65| 1)) (< |c_ULTIMATE.start_main_~MINVAL~0#1| (+ (select (let ((.cse0 (* 16 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4))) v_ArrVal_199) (+ .cse0 (* |v_ULTIMATE.start_main_~j~0#1_66| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_201) (+ .cse0 (* |v_ULTIMATE.start_main_~j~0#1_65| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_203) (+ (* |v_ULTIMATE.start_main_~j~0#1_64| (- 4)) .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_206)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) 1)))) is different from false [2023-12-20 07:51:16,618 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 82 treesize of output 80 [2023-12-20 07:51:16,728 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 12362448878 treesize of output 12345671662 [2023-12-20 07:51:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 7 proven. 79 refuted. 5 times theorem prover too weak. 2 trivial. 16 not checked. [2023-12-20 07:51:18,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670259204] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 07:51:18,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 07:51:18,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17, 21] total 55 [2023-12-20 07:51:18,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429867806] [2023-12-20 07:51:18,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 07:51:18,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-12-20 07:51:18,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 07:51:18,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-12-20 07:51:18,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=2450, Unknown=43, NotChecked=104, Total=2970 [2023-12-20 07:51:18,820 INFO L87 Difference]: Start difference. First operand 128 states and 157 transitions. Second operand has 55 states, 55 states have (on average 2.3454545454545452) internal successors, (129), 55 states have internal predecessors, (129), 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-20 07:51:21,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 07:51:21,606 INFO L93 Difference]: Finished difference Result 198 states and 241 transitions. [2023-12-20 07:51:21,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-20 07:51:21,607 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.3454545454545452) internal successors, (129), 55 states have internal predecessors, (129), 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 47 [2023-12-20 07:51:21,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 07:51:21,607 INFO L225 Difference]: With dead ends: 198 [2023-12-20 07:51:21,607 INFO L226 Difference]: Without dead ends: 99 [2023-12-20 07:51:21,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2045 ImplicationChecksByTransitivity, 180.6s TimeCoverageRelationStatistics Valid=1194, Invalid=5246, Unknown=44, NotChecked=158, Total=6642 [2023-12-20 07:51:21,622 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 268 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 140 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-20 07:51:21,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 123 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 841 Invalid, 1 Unknown, 78 Unchecked, 1.3s Time] [2023-12-20 07:51:21,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-20 07:51:21,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 82. [2023-12-20 07:51:21,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.1604938271604939) internal successors, (94), 81 states have internal predecessors, (94), 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-20 07:51:21,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2023-12-20 07:51:21,637 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 47 [2023-12-20 07:51:21,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 07:51:21,637 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2023-12-20 07:51:21,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.3454545454545452) internal successors, (129), 55 states have internal predecessors, (129), 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-20 07:51:21,637 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2023-12-20 07:51:21,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-20 07:51:21,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 07:51:21,638 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 07:51:21,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-20 07:51:21,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-20 07:51:21,843 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 07:51:21,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 07:51:21,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1325505596, now seen corresponding path program 6 times [2023-12-20 07:51:21,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 07:51:21,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616459032] [2023-12-20 07:51:21,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 07:51:21,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 07:51:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 07:51:22,349 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 1 proven. 121 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-20 07:51:22,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 07:51:22,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616459032] [2023-12-20 07:51:22,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616459032] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 07:51:22,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44319611] [2023-12-20 07:51:22,349 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-20 07:51:22,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 07:51:22,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 07:51:22,351 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 07:51:22,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-20 07:51:22,473 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2023-12-20 07:51:22,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-20 07:51:22,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-20 07:51:22,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 07:51:22,561 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 13 treesize of output 9 [2023-12-20 07:51:22,630 INFO L349 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2023-12-20 07:51:22,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 13 [2023-12-20 07:51:22,668 INFO L349 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2023-12-20 07:51:22,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 13 [2023-12-20 07:51:22,688 INFO L349 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2023-12-20 07:51:22,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 21 [2023-12-20 07:51:22,736 INFO L349 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2023-12-20 07:51:22,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 29 [2023-12-20 07:51:22,917 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 10 proven. 115 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-20 07:51:22,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 07:52:31,946 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_82| Int)) (or (< |c_ULTIMATE.start_main_~j~0#1| (+ |v_ULTIMATE.start_main_~j~0#1_82| 1)) (forall ((|v_ULTIMATE.start_main_~j~0#1_81| Int) (|v_ULTIMATE.start_main_~j~0#1_79| Int) (v_ArrVal_251 Int) (v_ArrVal_250 Int) (v_ArrVal_248 Int)) (or (< 1 |v_ULTIMATE.start_main_~j~0#1_79|) (= (select (let ((.cse0 (* 16 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse0 (* |v_ULTIMATE.start_main_~j~0#1_82| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_248) (+ .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_81| (- 4))) v_ArrVal_250) (+ .cse0 (* |v_ULTIMATE.start_main_~j~0#1_79| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_251)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)) 0) (< (+ |v_ULTIMATE.start_main_~j~0#1_79| 1) |v_ULTIMATE.start_main_~j~0#1_81|))))) is different from false [2023-12-20 07:52:34,153 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_245 Int) (|v_ULTIMATE.start_main_~j~0#1_81| Int) (|v_ULTIMATE.start_main_~j~0#1_79| Int) (v_ArrVal_251 Int) (v_ArrVal_250 Int) (|v_ULTIMATE.start_main_~j~0#1_82| Int) (v_ArrVal_248 Int)) (or (< 1 |v_ULTIMATE.start_main_~j~0#1_79|) (= (select (let ((.cse0 (* 16 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4))) v_ArrVal_245) (+ .cse0 (* |v_ULTIMATE.start_main_~j~0#1_82| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_248) (+ .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_81| (- 4))) v_ArrVal_250) (+ .cse0 (* |v_ULTIMATE.start_main_~j~0#1_79| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_251)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)) 0) (< |c_ULTIMATE.start_main_~j~0#1| (+ |v_ULTIMATE.start_main_~j~0#1_82| 1)) (< (+ |v_ULTIMATE.start_main_~j~0#1_79| 1) |v_ULTIMATE.start_main_~j~0#1_81|))) is different from false [2023-12-20 07:52:38,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2023-12-20 07:52:38,323 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 24 treesize of output 20 [2023-12-20 07:52:38,438 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 1 proven. 99 refuted. 2 times theorem prover too weak. 7 trivial. 23 not checked. [2023-12-20 07:52:38,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44319611] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 07:52:38,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 07:52:38,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 23] total 52 [2023-12-20 07:52:38,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985482924] [2023-12-20 07:52:38,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 07:52:38,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-20 07:52:38,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 07:52:38,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-20 07:52:38,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=2066, Unknown=15, NotChecked=194, Total=2652 [2023-12-20 07:52:38,442 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand has 52 states, 52 states have (on average 2.826923076923077) internal successors, (147), 52 states have internal predecessors, (147), 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-20 07:52:39,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 07:52:39,865 INFO L93 Difference]: Finished difference Result 189 states and 219 transitions. [2023-12-20 07:52:39,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-20 07:52:39,865 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.826923076923077) internal successors, (147), 52 states have internal predecessors, (147), 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 57 [2023-12-20 07:52:39,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 07:52:39,866 INFO L225 Difference]: With dead ends: 189 [2023-12-20 07:52:39,866 INFO L226 Difference]: Without dead ends: 122 [2023-12-20 07:52:39,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2204 ImplicationChecksByTransitivity, 76.6s TimeCoverageRelationStatistics Valid=1315, Invalid=6334, Unknown=15, NotChecked=346, Total=8010 [2023-12-20 07:52:39,868 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 270 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 215 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-20 07:52:39,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 190 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 843 Invalid, 0 Unknown, 215 Unchecked, 0.5s Time] [2023-12-20 07:52:39,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-20 07:52:39,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 93. [2023-12-20 07:52:39,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.1195652173913044) internal successors, (103), 92 states have internal predecessors, (103), 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-20 07:52:39,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2023-12-20 07:52:39,880 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 57 [2023-12-20 07:52:39,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 07:52:39,881 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2023-12-20 07:52:39,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.826923076923077) internal successors, (147), 52 states have internal predecessors, (147), 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-20 07:52:39,881 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2023-12-20 07:52:39,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-20 07:52:39,881 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 07:52:39,882 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 07:52:39,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-20 07:52:40,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-20 07:52:40,087 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 07:52:40,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 07:52:40,087 INFO L85 PathProgramCache]: Analyzing trace with hash -2097464922, now seen corresponding path program 7 times [2023-12-20 07:52:40,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 07:52:40,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627186005] [2023-12-20 07:52:40,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 07:52:40,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 07:52:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 07:52:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 9 proven. 120 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-20 07:52:40,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 07:52:40,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627186005] [2023-12-20 07:52:40,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627186005] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 07:52:40,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599725076] [2023-12-20 07:52:40,604 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-20 07:52:40,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 07:52:40,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 07:52:40,605 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 07:52:40,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-20 07:52:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 07:52:40,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-20 07:52:40,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 07:52:40,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-20 07:52:40,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 07:52:40,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2023-12-20 07:52:40,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 07:52:40,902 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 31 treesize of output 11 [2023-12-20 07:52:40,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 07:52:40,950 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 31 treesize of output 11 [2023-12-20 07:52:41,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-20 07:52:41,234 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 15 proven. 114 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-20 07:52:41,234 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 07:53:29,650 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_96| Int)) (or (< |c_ULTIMATE.start_main_~j~0#1| (+ |v_ULTIMATE.start_main_~j~0#1_96| 1)) (forall ((v_ArrVal_295 Int) (v_ArrVal_293 Int) (v_ArrVal_291 Int) (|v_ULTIMATE.start_main_~j~0#1_94| Int) (|v_ULTIMATE.start_main_~j~0#1_95| Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_96| (+ |v_ULTIMATE.start_main_~j~0#1_95| 1)) (< |v_ULTIMATE.start_main_~j~0#1_95| (+ |v_ULTIMATE.start_main_~j~0#1_94| 1)) (< |c_ULTIMATE.start_main_~MINVAL~0#1| (+ (select (let ((.cse0 (* 16 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_96| (- 4))) v_ArrVal_291) (+ (* |v_ULTIMATE.start_main_~j~0#1_95| (- 4)) .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_293) (+ .cse0 (* |v_ULTIMATE.start_main_~j~0#1_94| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_295)) (+ 16 |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) 1)))))) is different from false [2023-12-20 07:53:29,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2023-12-20 07:53:29,664 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 23790 treesize of output 23534 [2023-12-20 07:53:32,254 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 11 proven. 111 refuted. 0 times theorem prover too weak. 22 trivial. 7 not checked. [2023-12-20 07:53:32,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599725076] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 07:53:32,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 07:53:32,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 48 [2023-12-20 07:53:32,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754074943] [2023-12-20 07:53:32,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 07:53:32,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-20 07:53:32,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 07:53:32,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-20 07:53:32,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1880, Unknown=14, NotChecked=90, Total=2256 [2023-12-20 07:53:32,256 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 48 states, 48 states have (on average 3.1666666666666665) internal successors, (152), 48 states have internal predecessors, (152), 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-20 07:53:35,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-20 07:53:39,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-20 07:53:43,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-20 07:53:47,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-20 07:53:51,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-20 07:53:55,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-20 07:53:59,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-20 07:53:59,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 07:53:59,872 INFO L93 Difference]: Finished difference Result 267 states and 294 transitions. [2023-12-20 07:53:59,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-20 07:53:59,873 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.1666666666666665) internal successors, (152), 48 states have internal predecessors, (152), 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 62 [2023-12-20 07:53:59,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 07:53:59,873 INFO L225 Difference]: With dead ends: 267 [2023-12-20 07:53:59,873 INFO L226 Difference]: Without dead ends: 258 [2023-12-20 07:53:59,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2503 ImplicationChecksByTransitivity, 52.5s TimeCoverageRelationStatistics Valid=1097, Invalid=7635, Unknown=14, NotChecked=184, Total=8930 [2023-12-20 07:53:59,875 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 516 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 124 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 196 IncrementalHoareTripleChecker+Unchecked, 26.2s IncrementalHoareTripleChecker+Time [2023-12-20 07:53:59,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 379 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1350 Invalid, 7 Unknown, 196 Unchecked, 26.2s Time] [2023-12-20 07:53:59,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-12-20 07:53:59,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 163. [2023-12-20 07:53:59,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.1296296296296295) internal successors, (183), 162 states have internal predecessors, (183), 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-20 07:53:59,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 183 transitions. [2023-12-20 07:53:59,903 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 183 transitions. Word has length 62 [2023-12-20 07:53:59,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 07:53:59,903 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 183 transitions. [2023-12-20 07:53:59,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.1666666666666665) internal successors, (152), 48 states have internal predecessors, (152), 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-20 07:53:59,904 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 183 transitions. [2023-12-20 07:53:59,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-20 07:53:59,904 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 07:53:59,904 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 07:53:59,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-20 07:54:00,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-20 07:54:00,110 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 07:54:00,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 07:54:00,112 INFO L85 PathProgramCache]: Analyzing trace with hash -2006793980, now seen corresponding path program 8 times [2023-12-20 07:54:00,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 07:54:00,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710021309] [2023-12-20 07:54:00,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 07:54:00,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 07:54:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 07:54:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-20 07:54:00,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 07:54:00,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710021309] [2023-12-20 07:54:00,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710021309] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 07:54:00,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444134804] [2023-12-20 07:54:00,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-20 07:54:00,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 07:54:00,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 07:54:00,750 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 07:54:00,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-20 07:54:00,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-20 07:54:00,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-20 07:54:00,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-20 07:54:00,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 07:54:01,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-20 07:54:01,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 07:54:01,097 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 31 treesize of output 11 [2023-12-20 07:54:01,138 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-12-20 07:54:01,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2023-12-20 07:54:01,741 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-20 07:54:01,741 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 07:54:02,373 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 61 treesize of output 57 [2023-12-20 07:54:02,376 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 331 treesize of output 315 [2023-12-20 07:54:02,581 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-20 07:54:02,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444134804] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 07:54:02,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 07:54:02,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 21] total 57 [2023-12-20 07:54:02,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866480871] [2023-12-20 07:54:02,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 07:54:02,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-12-20 07:54:02,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 07:54:02,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-12-20 07:54:02,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=2914, Unknown=0, NotChecked=0, Total=3192 [2023-12-20 07:54:02,583 INFO L87 Difference]: Start difference. First operand 163 states and 183 transitions. Second operand has 57 states, 57 states have (on average 2.9649122807017543) internal successors, (169), 57 states have internal predecessors, (169), 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-20 07:54:08,348 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|)) (.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse3 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20))) (and (not (= .cse0 (+ |c_ULTIMATE.start_main_~j~0#1| 5))) (let ((.cse1 (select .cse3 (+ .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8)))) (or (and (<= 3 .cse1) .cse2) (= .cse1 0))) (let ((.cse4 (select .cse3 (+ .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (= .cse4 0) (and (<= 3 .cse4) .cse2))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) .cse2 (let ((.cse5 (select .cse3 (+ .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)))) (or (< |c_ULTIMATE.start_main_~MINVAL~0#1| (+ .cse5 1)) (= .cse5 0))) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (<= 3 (select .cse3 .cse6)) (forall ((|v_ULTIMATE.start_main_~j~0#1_108| Int)) (or (forall ((v_ArrVal_335 Int)) (let ((.cse7 (select (store .cse3 (+ (* |v_ULTIMATE.start_main_~j~0#1_108| (- 4)) (* 16 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_335) .cse6))) (or (< |c_ULTIMATE.start_main_~MINVAL~0#1| (+ .cse7 1)) (= .cse7 0)))) (< |c_ULTIMATE.start_main_~j~0#1| (+ |v_ULTIMATE.start_main_~j~0#1_108| 1)))))) is different from false [2023-12-20 07:54:28,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-20 07:54:32,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-20 07:54:36,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-20 07:55:13,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-20 07:55:17,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-20 07:55:21,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-20 07:55:25,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-20 07:55:29,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-20 07:55:33,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-20 07:55:35,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 07:55:35,716 INFO L93 Difference]: Finished difference Result 245 states and 271 transitions. [2023-12-20 07:55:35,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-12-20 07:55:35,716 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.9649122807017543) internal successors, (169), 57 states have internal predecessors, (169), 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 67 [2023-12-20 07:55:35,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 07:55:35,717 INFO L225 Difference]: With dead ends: 245 [2023-12-20 07:55:35,717 INFO L226 Difference]: Without dead ends: 236 [2023-12-20 07:55:35,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 128 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5245 ImplicationChecksByTransitivity, 57.2s TimeCoverageRelationStatistics Valid=1666, Invalid=14844, Unknown=6, NotChecked=254, Total=16770 [2023-12-20 07:55:35,719 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 488 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 1694 mSolverCounterSat, 75 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1694 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 37.2s IncrementalHoareTripleChecker+Time [2023-12-20 07:55:35,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 440 Invalid, 1830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1694 Invalid, 9 Unknown, 52 Unchecked, 37.2s Time] [2023-12-20 07:55:35,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-12-20 07:55:35,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 190. [2023-12-20 07:55:35,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.1322751322751323) internal successors, (214), 189 states have internal predecessors, (214), 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-20 07:55:35,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 214 transitions. [2023-12-20 07:55:35,764 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 214 transitions. Word has length 67 [2023-12-20 07:55:35,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 07:55:35,764 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 214 transitions. [2023-12-20 07:55:35,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.9649122807017543) internal successors, (169), 57 states have internal predecessors, (169), 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-20 07:55:35,765 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 214 transitions. [2023-12-20 07:55:35,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-20 07:55:35,765 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 07:55:35,765 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 07:55:35,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-20 07:55:35,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-20 07:55:35,970 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 07:55:35,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 07:55:35,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1585114108, now seen corresponding path program 9 times [2023-12-20 07:55:35,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 07:55:35,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182227362] [2023-12-20 07:55:35,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 07:55:35,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 07:55:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 07:55:37,371 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 6 proven. 252 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-20 07:55:37,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 07:55:37,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182227362] [2023-12-20 07:55:37,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182227362] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 07:55:37,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899194599] [2023-12-20 07:55:37,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-20 07:55:37,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 07:55:37,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 07:55:37,372 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 07:55:37,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-20 07:55:37,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2023-12-20 07:55:37,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-20 07:55:37,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 84 conjunts are in the unsatisfiable core [2023-12-20 07:55:37,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 07:55:37,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-20 07:55:37,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 07:55:37,838 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 31 treesize of output 11 [2023-12-20 07:55:37,914 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2023-12-20 07:55:37,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 19 [2023-12-20 07:55:38,071 INFO L349 Elim1Store]: treesize reduction 66, result has 33.3 percent of original size [2023-12-20 07:55:38,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 61 [2023-12-20 07:55:38,537 INFO L349 Elim1Store]: treesize reduction 162, result has 49.1 percent of original size [2023-12-20 07:55:38,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 149 treesize of output 225 [2023-12-20 07:56:23,534 WARN L293 SmtUtils]: Spent 7.99s on a formula simplification. DAG size of input: 2048 DAG size of output: 2131 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 07:58:23,728 WARN L293 SmtUtils]: Spent 48.36s on a formula simplification. DAG size of input: 2970 DAG size of output: 2882 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 08:00:53,744 WARN L293 SmtUtils]: Spent 5.28s on a formula simplification that was a NOOP. DAG size: 3056 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-12-20 08:01:51,669 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-20 08:01:51,669 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-20 08:01:52,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-20 08:01:52,724 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 08:01:52,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-20 08:01:52,724 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 68 with TraceHistMax 12,while TraceCheckSpWp was constructing forward predicates,while executing Executor. [2023-12-20 08:01:52,727 INFO L445 BasicCegarLoop]: Path program histogram: [9, 2, 1, 1, 1, 1, 1] [2023-12-20 08:01:52,729 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 08:01:52,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 08:01:52 BoogieIcfgContainer [2023-12-20 08:01:52,748 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 08:01:52,749 INFO L158 Benchmark]: Toolchain (without parser) took 870095.44ms. Allocated memory was 201.3MB in the beginning and 987.8MB in the end (delta: 786.4MB). Free memory was 158.9MB in the beginning and 828.3MB in the end (delta: -669.5MB). Peak memory consumption was 612.4MB. Max. memory is 8.0GB. [2023-12-20 08:01:52,749 INFO L158 Benchmark]: CDTParser took 3.53ms. Allocated memory is still 201.3MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 08:01:52,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.58ms. Allocated memory is still 201.3MB. Free memory was 158.5MB in the beginning and 147.3MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-20 08:01:52,749 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.87ms. Allocated memory is still 201.3MB. Free memory was 147.3MB in the beginning and 145.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 08:01:52,749 INFO L158 Benchmark]: Boogie Preprocessor took 26.06ms. Allocated memory is still 201.3MB. Free memory was 145.6MB in the beginning and 143.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 08:01:52,750 INFO L158 Benchmark]: RCFGBuilder took 322.36ms. Allocated memory is still 201.3MB. Free memory was 143.5MB in the beginning and 130.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-20 08:01:52,753 INFO L158 Benchmark]: TraceAbstraction took 869549.86ms. Allocated memory was 201.3MB in the beginning and 987.8MB in the end (delta: 786.4MB). Free memory was 130.2MB in the beginning and 828.3MB in the end (delta: -698.1MB). Peak memory consumption was 583.1MB. Max. memory is 8.0GB. [2023-12-20 08:01:52,753 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.53ms. Allocated memory is still 201.3MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 159.58ms. Allocated memory is still 201.3MB. Free memory was 158.5MB in the beginning and 147.3MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.87ms. Allocated memory is still 201.3MB. Free memory was 147.3MB in the beginning and 145.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.06ms. Allocated memory is still 201.3MB. Free memory was 145.6MB in the beginning and 143.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 322.36ms. Allocated memory is still 201.3MB. Free memory was 143.5MB in the beginning and 130.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 869549.86ms. Allocated memory was 201.3MB in the beginning and 987.8MB in the end (delta: 786.4MB). Free memory was 130.2MB in the beginning and 828.3MB in the end (delta: -698.1MB). Peak memory consumption was 583.1MB. 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: 8]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 8). Cancelled while NwaCegarLoop was analyzing trace of length 68 with TraceHistMax 12,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 869.5s, OverallIterations: 16, TraceHistogramMax: 12, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 143.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 28 mSolverCounterUnknown, 2817 SdHoareTripleChecker+Valid, 75.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2817 mSDsluCounter, 2192 SdHoareTripleChecker+Invalid, 74.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 703 IncrementalHoareTripleChecker+Unchecked, 1959 mSDsCounter, 638 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7389 IncrementalHoareTripleChecker+Invalid, 8758 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 638 mSolverCounterUnsat, 233 mSDtfsCounter, 7389 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1411 GetRequests, 682 SyntacticMatches, 11 SemanticMatches, 718 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 17960 ImplicationChecksByTransitivity, 402.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=15, InterpolantAutomatonStates: 389, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 446 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 345.5s InterpolantComputationTime, 977 NumberOfCodeBlocks, 965 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1377 ConstructedInterpolants, 110 QuantifiedInterpolants, 19444 SizeOfPredicates, 133 NumberOfNonLiveVariables, 1585 ConjunctsInSsa, 323 ConjunctsInUnsatCore, 36 InterpolantComputations, 5 PerfectInterpolantSequences, 550/2369 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