/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/dot-product-alt.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 21:47:30,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 21:47:30,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 21:47:30,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 21:47:30,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 21:47:30,587 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 21:47:30,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 21:47:30,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 21:47:30,590 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 21:47:30,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 21:47:30,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 21:47:30,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 21:47:30,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 21:47:30,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 21:47:30,597 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 21:47:30,598 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 21:47:30,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 21:47:30,599 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 21:47:30,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 21:47:30,601 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 21:47:30,602 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 21:47:30,604 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 21:47:30,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 21:47:30,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 21:47:30,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 21:47:30,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 21:47:30,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 21:47:30,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 21:47:30,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 21:47:30,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 21:47:30,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 21:47:30,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 21:47:30,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 21:47:30,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 21:47:30,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 21:47:30,616 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 21:47:30,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 21:47:30,616 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 21:47:30,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 21:47:30,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 21:47:30,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 21:47:30,622 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 21:47:30,643 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 21:47:30,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 21:47:30,646 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 21:47:30,647 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 21:47:30,647 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 21:47:30,647 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 21:47:30,647 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 21:47:30,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 21:47:30,647 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 21:47:30,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 21:47:30,648 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 21:47:30,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 21:47:30,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 21:47:30,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 21:47:30,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 21:47:30,648 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 21:47:30,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 21:47:30,649 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 21:47:30,649 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 21:47:30,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 21:47:30,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 21:47:30,649 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 21:47:30,649 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 21:47:30,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:47:30,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 21:47:30,649 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 21:47:30,650 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 21:47:30,650 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 21:47:30,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 21:47:30,650 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 21:47:30,650 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 21:47:30,650 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 21:47:30,650 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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 [2022-03-15 21:47:30,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 21:47:30,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 21:47:30,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 21:47:30,848 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 21:47:30,849 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 21:47:30,850 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/dot-product-alt.wvr.bpl [2022-03-15 21:47:30,850 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/dot-product-alt.wvr.bpl' [2022-03-15 21:47:30,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 21:47:30,867 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 21:47:30,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 21:47:30,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 21:47:30,867 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 21:47:30,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:47:30" (1/1) ... [2022-03-15 21:47:30,879 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:47:30" (1/1) ... [2022-03-15 21:47:30,884 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 21:47:30,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 21:47:30,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 21:47:30,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 21:47:30,885 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 21:47:30,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:47:30" (1/1) ... [2022-03-15 21:47:30,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:47:30" (1/1) ... [2022-03-15 21:47:30,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:47:30" (1/1) ... [2022-03-15 21:47:30,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:47:30" (1/1) ... [2022-03-15 21:47:30,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:47:30" (1/1) ... [2022-03-15 21:47:30,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:47:30" (1/1) ... [2022-03-15 21:47:30,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:47:30" (1/1) ... [2022-03-15 21:47:30,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 21:47:30,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 21:47:30,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 21:47:30,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 21:47:30,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:47:30" (1/1) ... [2022-03-15 21:47:30,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:47:30,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:30,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 21:47:30,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 21:47:30,968 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 21:47:30,969 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 21:47:30,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 21:47:30,969 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 21:47:30,969 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 21:47:30,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 21:47:30,969 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 21:47:30,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 21:47:30,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 21:47:30,969 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 21:47:30,969 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 21:47:30,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 21:47:30,970 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 21:47:31,003 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 21:47:31,004 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 21:47:31,084 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 21:47:31,089 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 21:47:31,089 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 21:47:31,090 INFO L202 PluginConnector]: Adding new model dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:47:31 BoogieIcfgContainer [2022-03-15 21:47:31,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 21:47:31,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 21:47:31,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 21:47:31,093 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 21:47:31,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:47:30" (1/2) ... [2022-03-15 21:47:31,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b86ae8 and model type dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 09:47:31, skipping insertion in model container [2022-03-15 21:47:31,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:47:31" (2/2) ... [2022-03-15 21:47:31,095 INFO L111 eAbstractionObserver]: Analyzing ICFG dot-product-alt.wvr.bpl [2022-03-15 21:47:31,098 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 21:47:31,098 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 21:47:31,098 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 21:47:31,098 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 21:47:31,120 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 21:47:31,147 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 21:47:31,152 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 21:47:31,152 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 21:47:31,158 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 21:47:31,164 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 32 transitions, 88 flow [2022-03-15 21:47:31,166 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 32 transitions, 88 flow [2022-03-15 21:47:31,167 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 88 flow [2022-03-15 21:47:31,182 INFO L129 PetriNetUnfolder]: 3/29 cut-off events. [2022-03-15 21:47:31,183 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 21:47:31,185 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2022-03-15 21:47:31,185 INFO L116 LiptonReduction]: Number of co-enabled transitions 210 [2022-03-15 21:47:31,440 INFO L131 LiptonReduction]: Checked pairs total: 190 [2022-03-15 21:47:31,440 INFO L133 LiptonReduction]: Total number of compositions: 15 [2022-03-15 21:47:31,448 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 18 transitions, 60 flow [2022-03-15 21:47:31,467 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 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) [2022-03-15 21:47:31,468 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 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) [2022-03-15 21:47:31,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 21:47:31,472 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:31,472 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:31,472 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:47:31,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:31,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1198588504, now seen corresponding path program 1 times [2022-03-15 21:47:31,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:31,505 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719022328] [2022-03-15 21:47:31,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:31,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:31,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:31,632 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:31,632 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719022328] [2022-03-15 21:47:31,632 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719022328] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:47:31,633 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:47:31,633 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 21:47:31,634 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [611637702] [2022-03-15 21:47:31,635 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:31,639 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:31,650 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 21:47:31,650 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:31,900 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:47:31,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 21:47:31,902 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:31,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 21:47:31,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:47:31,918 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 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 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) [2022-03-15 21:47:31,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:31,942 INFO L93 Difference]: Finished difference Result 45 states and 117 transitions. [2022-03-15 21:47:31,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:47:31,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2022-03-15 21:47:31,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:31,951 INFO L225 Difference]: With dead ends: 45 [2022-03-15 21:47:31,951 INFO L226 Difference]: Without dead ends: 41 [2022-03-15 21:47:31,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:47:31,956 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:31,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:47:31,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-15 21:47:31,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-03-15 21:47:31,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 2.7) internal successors, (108), 40 states have internal predecessors, (108), 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) [2022-03-15 21:47:32,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 108 transitions. [2022-03-15 21:47:32,001 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 108 transitions. Word has length 11 [2022-03-15 21:47:32,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:32,002 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 108 transitions. [2022-03-15 21:47:32,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) [2022-03-15 21:47:32,002 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 108 transitions. [2022-03-15 21:47:32,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 21:47:32,004 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:32,004 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:32,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 21:47:32,004 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:47:32,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:32,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1676514102, now seen corresponding path program 1 times [2022-03-15 21:47:32,006 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:32,006 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278611036] [2022-03-15 21:47:32,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:32,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:32,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:32,083 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:32,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278611036] [2022-03-15 21:47:32,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278611036] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:47:32,083 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:47:32,084 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:47:32,084 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1056286123] [2022-03-15 21:47:32,084 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:32,085 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:32,088 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 21:47:32,088 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:32,264 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:47:32,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 21:47:32,267 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:32,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 21:47:32,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:47:32,268 INFO L87 Difference]: Start difference. First operand 41 states and 108 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-03-15 21:47:32,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:32,300 INFO L93 Difference]: Finished difference Result 44 states and 116 transitions. [2022-03-15 21:47:32,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:47:32,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 [2022-03-15 21:47:32,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:32,302 INFO L225 Difference]: With dead ends: 44 [2022-03-15 21:47:32,302 INFO L226 Difference]: Without dead ends: 44 [2022-03-15 21:47:32,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:47:32,303 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:32,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:47:32,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-03-15 21:47:32,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2022-03-15 21:47:32,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 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) [2022-03-15 21:47:32,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 80 transitions. [2022-03-15 21:47:32,307 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 80 transitions. Word has length 12 [2022-03-15 21:47:32,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:32,307 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 80 transitions. [2022-03-15 21:47:32,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-03-15 21:47:32,308 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 80 transitions. [2022-03-15 21:47:32,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 21:47:32,308 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:32,308 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:32,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 21:47:32,309 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:47:32,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:32,309 INFO L85 PathProgramCache]: Analyzing trace with hash -788143754, now seen corresponding path program 1 times [2022-03-15 21:47:32,311 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:32,311 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522176408] [2022-03-15 21:47:32,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:32,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:32,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:47:32,358 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:32,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522176408] [2022-03-15 21:47:32,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522176408] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:47:32,362 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:47:32,362 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:47:32,362 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1881573984] [2022-03-15 21:47:32,362 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:32,363 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:32,365 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 21:47:32,365 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:32,496 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:47:32,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 21:47:32,497 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:32,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 21:47:32,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:47:32,498 INFO L87 Difference]: Start difference. First operand 31 states and 80 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:32,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:32,535 INFO L93 Difference]: Finished difference Result 48 states and 130 transitions. [2022-03-15 21:47:32,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 21:47:32,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 21:47:32,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:32,539 INFO L225 Difference]: With dead ends: 48 [2022-03-15 21:47:32,539 INFO L226 Difference]: Without dead ends: 48 [2022-03-15 21:47:32,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:47:32,540 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:32,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 0 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:47:32,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-15 21:47:32,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2022-03-15 21:47:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 39 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) [2022-03-15 21:47:32,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 106 transitions. [2022-03-15 21:47:32,544 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 106 transitions. Word has length 12 [2022-03-15 21:47:32,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:32,545 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 106 transitions. [2022-03-15 21:47:32,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:32,545 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 106 transitions. [2022-03-15 21:47:32,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 21:47:32,545 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:32,545 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:32,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 21:47:32,546 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:47:32,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:32,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1854276184, now seen corresponding path program 1 times [2022-03-15 21:47:32,549 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:32,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317022981] [2022-03-15 21:47:32,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:32,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:32,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:32,656 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:32,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317022981] [2022-03-15 21:47:32,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317022981] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:32,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316677185] [2022-03-15 21:47:32,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:32,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:32,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:32,661 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) [2022-03-15 21:47:32,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 21:47:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:32,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 21:47:32,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:32,840 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-03-15 21:47:32,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:32,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:32,926 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:32,927 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-03-15 21:47:32,933 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:32,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-03-15 21:47:32,940 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:32,941 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 20 [2022-03-15 21:47:32,997 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-03-15 21:47:33,003 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 21:47:33,003 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 12 [2022-03-15 21:47:33,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:33,053 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316677185] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:33,053 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:33,053 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-03-15 21:47:33,053 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1055878344] [2022-03-15 21:47:33,053 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:33,055 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:33,058 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 73 transitions. [2022-03-15 21:47:33,058 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:33,733 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [548#(and (<= (+ res1 (select (select mult (select A i)) (select B i))) (select (select mult (select A k)) (select B k))) (= res2 0) (<= (select (select mult (select A k)) (select B k)) (+ res1 (select (select mult (select A i)) (select B i))))), 550#(and (or (< j M) (<= res1 (select (select mult (select A k)) (select B k)))) (or (< j M) (<= (select (select mult (select A k)) (select B k)) res1)) (or (< j M) (= res2 0))), 551#(and (or (< j M) (<= (select (select mult (select A k)) (select B k)) (+ res1 (select (select mult (select A i)) (select B i))))) (or (< j M) (= res2 0)) (or (< j M) (<= (+ res1 (select (select mult (select A i)) (select B i))) (select (select mult (select A k)) (select B k))))), 545#(and (or (<= res1 res2) (< j M)) (or (< j M) (< res2 (+ res1 1)))), 546#(and (or (< j M) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 1))) (or (< j M) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2)))), 527#(and (< (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 1)) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2))), 547#(and (<= (+ res1 (select (select mult (select A i)) (select B i))) res2) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))), 549#(and (or (< j M) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (< j M) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2)))] [2022-03-15 21:47:33,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 21:47:33,733 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:33,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 21:47:33,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-03-15 21:47:33,734 INFO L87 Difference]: Start difference. First operand 40 states and 106 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:33,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:33,891 INFO L93 Difference]: Finished difference Result 76 states and 207 transitions. [2022-03-15 21:47:33,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 21:47:33,892 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 21:47:33,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:33,892 INFO L225 Difference]: With dead ends: 76 [2022-03-15 21:47:33,892 INFO L226 Difference]: Without dead ends: 72 [2022-03-15 21:47:33,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-03-15 21:47:33,893 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:33,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:47:33,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-03-15 21:47:33,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2022-03-15 21:47:33,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 2.8656716417910446) internal successors, (192), 67 states have internal predecessors, (192), 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) [2022-03-15 21:47:33,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 192 transitions. [2022-03-15 21:47:33,899 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 192 transitions. Word has length 13 [2022-03-15 21:47:33,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:33,899 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 192 transitions. [2022-03-15 21:47:33,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:33,899 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 192 transitions. [2022-03-15 21:47:33,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:47:33,900 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:33,900 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:33,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 21:47:34,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:34,116 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:47:34,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:34,116 INFO L85 PathProgramCache]: Analyzing trace with hash -544643146, now seen corresponding path program 2 times [2022-03-15 21:47:34,117 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:34,117 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952179303] [2022-03-15 21:47:34,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:34,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:34,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:34,156 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:34,156 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952179303] [2022-03-15 21:47:34,156 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952179303] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:34,156 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423901851] [2022-03-15 21:47:34,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:47:34,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:34,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:34,157 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) [2022-03-15 21:47:34,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 21:47:34,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:47:34,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:34,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:47:34,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:34,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:34,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:34,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:34,275 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423901851] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:34,275 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:34,275 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-03-15 21:47:34,275 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1233529164] [2022-03-15 21:47:34,276 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:34,277 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:34,282 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 21:47:34,282 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:34,890 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [851#(<= N i), 865#(or (<= N i) (<= (+ 2 k) N) (< j M)), 862#(or (<= N (+ i 1)) (< k N)), 852#(<= N (+ i 1)), 864#(or (<= N i) (< j M) (< k N)), 866#(or (<= N (+ i 1)) (< j M) (< k N)), 860#(or (<= (+ k 1) N) (<= N i)), 853#(< j M), 861#(or (<= N i) (<= (+ 2 k) N)), 855#(or (<= N (+ i 1)) (< j M)), 859#(or (<= (+ 2 k) N) (< j M)), 863#(or (<= N (+ i 1)) (<= (+ 2 k) N)), 867#(or (<= N (+ i 1)) (<= (+ 2 k) N) (< j M)), 856#(or (<= (+ k 1) N) (< j M)), 868#(or (< j M) (<= (+ k 1) i)), 854#(or (<= N i) (< j M)), 857#(or (<= (+ 2 k) N) (<= N k)), 858#(or (<= (+ 2 k) N) (< j M) (<= N k))] [2022-03-15 21:47:34,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 21:47:34,891 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:34,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 21:47:34,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2022-03-15 21:47:34,892 INFO L87 Difference]: Start difference. First operand 68 states and 192 transitions. Second operand has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 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) [2022-03-15 21:47:35,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:35,612 INFO L93 Difference]: Finished difference Result 144 states and 413 transitions. [2022-03-15 21:47:35,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 21:47:35,613 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 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 14 [2022-03-15 21:47:35,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:35,614 INFO L225 Difference]: With dead ends: 144 [2022-03-15 21:47:35,614 INFO L226 Difference]: Without dead ends: 141 [2022-03-15 21:47:35,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=756, Invalid=2214, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 21:47:35,615 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:35,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:47:35,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-03-15 21:47:35,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 82. [2022-03-15 21:47:35,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 3.1481481481481484) internal successors, (255), 81 states have internal predecessors, (255), 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) [2022-03-15 21:47:35,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 255 transitions. [2022-03-15 21:47:35,622 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 255 transitions. Word has length 14 [2022-03-15 21:47:35,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:35,622 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 255 transitions. [2022-03-15 21:47:35,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 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) [2022-03-15 21:47:35,622 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 255 transitions. [2022-03-15 21:47:35,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:47:35,626 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:35,626 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:35,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 21:47:35,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:35,845 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:47:35,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:35,846 INFO L85 PathProgramCache]: Analyzing trace with hash 360374646, now seen corresponding path program 3 times [2022-03-15 21:47:35,847 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:35,847 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627637231] [2022-03-15 21:47:35,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:35,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:35,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:35,891 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:35,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627637231] [2022-03-15 21:47:35,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627637231] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:35,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736887797] [2022-03-15 21:47:35,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:47:35,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:35,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:35,893 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) [2022-03-15 21:47:35,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 21:47:35,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:47:35,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:35,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:47:35,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:35,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:35,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:36,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:36,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736887797] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:36,017 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:36,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 9 [2022-03-15 21:47:36,017 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1617573280] [2022-03-15 21:47:36,017 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:36,018 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:36,022 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 21:47:36,022 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:36,580 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [1332#(or (<= (+ i 1) k) (<= N i)), 1327#(or (<= N k) (< (+ k 1) N)), 1330#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 1336#(or (<= N i) (< j M) (<= i k)), 1331#(or (< j M) (<= i k)), 1323#(or (< j M) (< k N)), 1329#(or (< j M) (<= N k) (< (+ k 1) N)), 1326#(or (<= N i) (< (+ i 1) N) (< j M)), 1322#(< k N), 1334#(or (< j M) (<= i (+ k 1))), 1328#(or (<= N (+ k 1)) (< (+ 2 k) N)), 1321#(< j M), 1324#(or (<= N i) (<= (+ 2 i) N)), 1325#(or (< j M) (< i N)), 1335#(or (<= N i) (<= i k)), 1333#(or (<= (+ i 1) k) (<= N i) (< j M))] [2022-03-15 21:47:36,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 21:47:36,580 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:36,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 21:47:36,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2022-03-15 21:47:36,581 INFO L87 Difference]: Start difference. First operand 82 states and 255 transitions. Second operand has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 21 states have internal predecessors, (70), 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) [2022-03-15 21:47:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:37,186 INFO L93 Difference]: Finished difference Result 245 states and 711 transitions. [2022-03-15 21:47:37,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 21:47:37,187 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 21 states have internal predecessors, (70), 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 14 [2022-03-15 21:47:37,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:37,188 INFO L225 Difference]: With dead ends: 245 [2022-03-15 21:47:37,188 INFO L226 Difference]: Without dead ends: 245 [2022-03-15 21:47:37,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=510, Invalid=2040, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 21:47:37,189 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 271 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:37,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 0 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:47:37,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-03-15 21:47:37,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 160. [2022-03-15 21:47:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.3144654088050314) internal successors, (527), 159 states have internal predecessors, (527), 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) [2022-03-15 21:47:37,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 527 transitions. [2022-03-15 21:47:37,198 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 527 transitions. Word has length 14 [2022-03-15 21:47:37,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:37,199 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 527 transitions. [2022-03-15 21:47:37,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 21 states have internal predecessors, (70), 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) [2022-03-15 21:47:37,199 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 527 transitions. [2022-03-15 21:47:37,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:47:37,200 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:37,200 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:37,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 21:47:37,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:37,416 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:47:37,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:37,417 INFO L85 PathProgramCache]: Analyzing trace with hash -720150443, now seen corresponding path program 1 times [2022-03-15 21:47:37,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:37,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271919471] [2022-03-15 21:47:37,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:37,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:37,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:47:37,459 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:37,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271919471] [2022-03-15 21:47:37,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271919471] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:37,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808721654] [2022-03-15 21:47:37,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:37,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:37,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:37,463 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) [2022-03-15 21:47:37,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 21:47:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:37,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:47:37,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:37,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:47:37,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:37,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:47:37,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808721654] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:37,601 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:37,601 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-03-15 21:47:37,601 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [689360303] [2022-03-15 21:47:37,601 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:37,602 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:37,605 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 88 transitions. [2022-03-15 21:47:37,605 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:37,873 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [2043#(or (<= N i) (<= (+ 2 i) N)), 2044#(or (<= N i) (< (+ i 1) N) (< j M)), 2040#(or (< (+ j 1) M) (<= M j)), 2042#(or (< (+ j 1) M) (< i N) (<= M j)), 2039#(< j M), 2041#(or (< j M) (< i N)), 2045#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= M j))] [2022-03-15 21:47:37,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 21:47:37,874 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:37,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 21:47:37,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:47:37,874 INFO L87 Difference]: Start difference. First operand 160 states and 527 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:38,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:38,176 INFO L93 Difference]: Finished difference Result 371 states and 1177 transitions. [2022-03-15 21:47:38,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 21:47:38,177 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 21:47:38,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:38,179 INFO L225 Difference]: With dead ends: 371 [2022-03-15 21:47:38,179 INFO L226 Difference]: Without dead ends: 371 [2022-03-15 21:47:38,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756 [2022-03-15 21:47:38,180 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 90 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:38,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 0 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:47:38,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-03-15 21:47:38,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 232. [2022-03-15 21:47:38,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 3.445887445887446) internal successors, (796), 231 states have internal predecessors, (796), 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) [2022-03-15 21:47:38,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 796 transitions. [2022-03-15 21:47:38,189 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 796 transitions. Word has length 14 [2022-03-15 21:47:38,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:38,189 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 796 transitions. [2022-03-15 21:47:38,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:38,189 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 796 transitions. [2022-03-15 21:47:38,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:47:38,191 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:38,191 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:38,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 21:47:38,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:38,407 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:47:38,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:38,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1990674136, now seen corresponding path program 4 times [2022-03-15 21:47:38,409 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:38,409 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421610459] [2022-03-15 21:47:38,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:38,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:38,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:38,554 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:38,554 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421610459] [2022-03-15 21:47:38,554 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421610459] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:38,554 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520199226] [2022-03-15 21:47:38,554 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:47:38,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:38,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:38,555 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) [2022-03-15 21:47:38,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 21:47:38,608 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:47:38,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:38,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:47:38,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:38,732 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:38,733 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 36 [2022-03-15 21:47:38,735 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-03-15 21:47:38,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-03-15 21:47:38,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:38,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:38,868 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 21:47:38,869 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 74 [2022-03-15 21:47:38,900 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:38,901 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 112 [2022-03-15 21:47:38,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:38,908 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:38,923 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:38,923 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 103 treesize of output 107 [2022-03-15 21:47:39,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:39,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:39,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:47:39,336 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2022-03-15 21:47:39,351 INFO L353 Elim1Store]: treesize reduction 71, result has 26.8 percent of original size [2022-03-15 21:47:39,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2022-03-15 21:47:39,353 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:39,354 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2022-03-15 21:47:39,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:39,389 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520199226] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:39,389 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:39,389 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2022-03-15 21:47:39,389 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1261960340] [2022-03-15 21:47:39,389 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:39,390 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:39,394 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 118 transitions. [2022-03-15 21:47:39,394 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:41,979 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [3030#(and (or (<= N (+ i 1)) (<= (+ 3 k) N) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))))) (or (<= N (+ i 1)) (<= (+ 3 k) N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))))) (or (<= N (+ i 1)) (<= 2 N)) (or (<= N (+ i 1)) (< 2 N) (= res2 0)) (or (<= N (+ i 1)) (= k 0))), 3009#(and (or (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (<= N i) (<= (+ 2 k) N)) (or (<= N i) (<= (+ 2 k) N) (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 (select (select mult (select A i)) (select B i)))))), 3028#(and (or (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (<= N (+ i 1)) (<= (+ 2 k) N)) (or (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (<= N (+ i 1)) (<= (+ 2 k) N))), 3024#(and (or (<= N (+ i 1)) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N (+ i 1)) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))), 3021#(and (or (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (<= N i) (<= (+ 2 k) N) (< j M)) (or (<= N i) (<= (+ 2 k) N) (< j M) (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 (select (select mult (select A i)) (select B i)))))), 3023#(and (or (< j M) (<= res1 (select (select mult (select A k)) (select B k)))) (or (< j M) (<= 1 i)) (or (< j M) (= k 0)) (or (< j M) (<= (select (select mult (select A k)) (select B k)) res1)) (or (< j M) (= res2 0))), 3019#(and (or (<= N i) (< j M) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N i) (< j M) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 3008#(and (or (<= N i) (< k N) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N i) (< k N) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1)))), 3010#(and (or (< 2 N) (<= N i) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k))) (+ res1 (select (select mult (select A i)) (select B i))))) (or (<= N i) (<= 2 N)) (or (< 2 N) (<= N i) (= res2 0)) (or (<= N i) (= k 0)) (or (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)))) (< 2 N) (<= N i))), 3018#(and (or (< j M) (<= 2 N)) (or (<= (+ 3 k) N) (< j M) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))))) (or (< j M) (= k 0)) (or (< 2 N) (< j M) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k))) res1)) (or (<= (+ 3 k) N) (< j M) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) res1)) (or (< 2 N) (< j M) (<= res1 (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)))))), 3012#(and (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ res1 1))) (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))))))), 3029#(and (or (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (<= N (+ i 1)) (<= (+ 2 k) N) (< j M)) (or (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (<= N (+ i 1)) (<= (+ 2 k) N) (< j M))), 3011#(and (or (not (< k N)) (<= (+ 2 k) N) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 1))) (or (not (< k N)) (<= (+ 2 k) N) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2)))), 3022#(and (or (< 2 N) (<= N i) (< j M) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k))) (+ res1 (select (select mult (select A i)) (select B i))))) (or (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)))) (< 2 N) (<= N i) (< j M)) (or (<= N i) (< j M) (= k 0)) (or (<= (+ 3 k) N) (<= N i) (< j M) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ res1 (select (select mult (select A i)) (select B i))))) (or (<= N i) (< j M) (<= 2 N)) (or (<= (+ 3 k) N) (<= N i) (< j M) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))))))), 3017#(and (or (<= (+ 2 k) N) (< j M) (<= (+ (select (select mult (select A k)) (select B k)) res2) res1)) (or (<= (+ 2 k) N) (< j M) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2)))), 3015#(and (or (not (< k N)) (<= (+ 2 k) N) (< j M) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 1))) (or (not (< k N)) (<= (+ 2 k) N) (< j M) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2)))), 3020#(and (or (<= N i) (< j M) (< k N) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N i) (< j M) (< k N) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 3027#(and (or (<= N (+ i 1)) (< j M) (< k N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N (+ i 1)) (< j M) (< k N) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))), 3016#(and (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< j M) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ res1 1))) (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< j M) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))))))), 3025#(and (or (<= N (+ i 1)) (< j M) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N (+ i 1)) (< j M) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))), 3026#(and (or (<= N (+ i 1)) (< k N) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N (+ i 1)) (< k N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 3007#(and (or (<= N i) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N i) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 3013#(and (or (<= res1 res2) (< j M)) (or (< j M) (< res2 (+ res1 1)))), 3031#(and (or (<= N (+ i 1)) (<= (+ 3 k) N) (< j M) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))))) (or (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (<= N (+ i 1)) (< 2 N) (< j M)) (or (<= N (+ i 1)) (< j M) (= k 0)) (or (<= N (+ i 1)) (< j M) (<= 2 N)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< j M) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))))) (or (<= N (+ i 1)) (< 2 N) (< j M) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)))))), 3014#(and (or (<= (+ k 1) N) (< j M) (< res2 (+ res1 1))) (or (<= res1 res2) (<= (+ k 1) N) (< j M)))] [2022-03-15 21:47:41,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 21:47:41,980 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:41,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 21:47:41,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1542, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 21:47:41,981 INFO L87 Difference]: Start difference. First operand 232 states and 796 transitions. Second operand has 34 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 33 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) [2022-03-15 21:47:50,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:50,693 INFO L93 Difference]: Finished difference Result 706 states and 2126 transitions. [2022-03-15 21:47:50,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-03-15 21:47:50,693 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 33 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) Word has length 15 [2022-03-15 21:47:50,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:50,696 INFO L225 Difference]: With dead ends: 706 [2022-03-15 21:47:50,696 INFO L226 Difference]: Without dead ends: 684 [2022-03-15 21:47:50,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5533 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=2743, Invalid=14813, Unknown=0, NotChecked=0, Total=17556 [2022-03-15 21:47:50,699 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 576 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 1935 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:50,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [576 Valid, 0 Invalid, 2062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1935 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 21:47:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2022-03-15 21:47:50,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 283. [2022-03-15 21:47:50,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 3.5106382978723403) internal successors, (990), 282 states have internal predecessors, (990), 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) [2022-03-15 21:47:50,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 990 transitions. [2022-03-15 21:47:50,709 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 990 transitions. Word has length 15 [2022-03-15 21:47:50,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:50,709 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 990 transitions. [2022-03-15 21:47:50,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 33 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) [2022-03-15 21:47:50,709 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 990 transitions. [2022-03-15 21:47:50,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:47:50,710 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:50,710 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:50,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-15 21:47:50,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:50,926 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:47:50,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:50,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1527790446, now seen corresponding path program 5 times [2022-03-15 21:47:50,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:50,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498684042] [2022-03-15 21:47:50,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:50,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:50,985 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:50,985 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498684042] [2022-03-15 21:47:50,985 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498684042] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:50,985 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951354939] [2022-03-15 21:47:50,985 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:47:50,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:50,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:50,986 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) [2022-03-15 21:47:50,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 21:47:51,010 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:47:51,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:51,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:47:51,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:51,077 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:51,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:51,111 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:51,111 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951354939] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:51,111 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:51,111 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-03-15 21:47:51,111 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1160980615] [2022-03-15 21:47:51,111 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:51,112 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:51,117 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 21:47:51,117 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:51,687 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [4590#(or (< j M) (<= N k)), 4586#(or (<= N i) (< (+ i 1) N) (<= (+ N 1) k)), 4595#(or (< j M) (<= N k) (< i N)), 4591#(or (< j M) (<= (+ N 1) k)), 4597#(or (<= N i) (< (+ i 1) N) (< j M) (<= (+ N 1) k)), 4598#(or (<= N i) (< (+ i 1) N) (< j M) (<= N k)), 4583#(< i N), 4594#(or (< j M) (<= (+ N 1) k) (< i N)), 4593#(or (< j M) (< i N)), 4596#(or (<= N i) (< (+ i 1) N) (< j M)), 4602#(or (<= N i) (< j M) (<= i k)), 4600#(or (< j M) (<= i (+ k 1))), 4592#(or (<= N (+ k 1)) (< j M)), 4563#(<= N (+ 2 k)), 4601#(or (<= N i) (<= i k)), 4585#(or (<= N i) (< (+ i 1) N)), 4587#(or (<= N k) (< i N)), 4599#(or (< j M) (<= N (+ 2 k))), 4589#(< j M), 4588#(or (<= N i) (< (+ i 1) N) (<= N k)), 4584#(or (<= (+ N 1) k) (< i N))] [2022-03-15 21:47:51,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 21:47:51,687 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:51,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 21:47:51,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=967, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 21:47:51,688 INFO L87 Difference]: Start difference. First operand 283 states and 990 transitions. Second operand has 29 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 28 states have internal predecessors, (85), 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) [2022-03-15 21:47:52,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:52,039 INFO L93 Difference]: Finished difference Result 474 states and 1570 transitions. [2022-03-15 21:47:52,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 21:47:52,039 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 28 states have internal predecessors, (85), 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 [2022-03-15 21:47:52,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:52,042 INFO L225 Difference]: With dead ends: 474 [2022-03-15 21:47:52,042 INFO L226 Difference]: Without dead ends: 455 [2022-03-15 21:47:52,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=532, Invalid=1918, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 21:47:52,043 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 201 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:52,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 0 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:47:52,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-03-15 21:47:52,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 334. [2022-03-15 21:47:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 3.5315315315315314) internal successors, (1176), 333 states have internal predecessors, (1176), 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) [2022-03-15 21:47:52,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1176 transitions. [2022-03-15 21:47:52,053 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1176 transitions. Word has length 15 [2022-03-15 21:47:52,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:52,053 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 1176 transitions. [2022-03-15 21:47:52,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 28 states have internal predecessors, (85), 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) [2022-03-15 21:47:52,054 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1176 transitions. [2022-03-15 21:47:52,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:47:52,054 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:52,055 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:52,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-15 21:47:52,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:52,272 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:47:52,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:52,272 INFO L85 PathProgramCache]: Analyzing trace with hash 780868931, now seen corresponding path program 2 times [2022-03-15 21:47:52,272 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:52,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168070895] [2022-03-15 21:47:52,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:52,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:52,404 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:52,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:52,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168070895] [2022-03-15 21:47:52,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168070895] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:52,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836785802] [2022-03-15 21:47:52,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:47:52,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:52,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:52,406 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) [2022-03-15 21:47:52,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 21:47:52,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:47:52,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:52,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:47:52,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:52,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:47:52,607 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:52,607 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2022-03-15 21:47:52,621 INFO L353 Elim1Store]: treesize reduction 25, result has 44.4 percent of original size [2022-03-15 21:47:52,621 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 32 [2022-03-15 21:47:52,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:47:52,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-03-15 21:47:52,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:52,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:52,791 INFO L353 Elim1Store]: treesize reduction 10, result has 81.8 percent of original size [2022-03-15 21:47:52,791 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 80 [2022-03-15 21:47:52,825 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:52,826 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 106 [2022-03-15 21:47:52,834 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:52,850 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:52,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 111 [2022-03-15 21:47:54,341 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:54,344 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:54,356 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:54,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 72 [2022-03-15 21:47:54,396 INFO L353 Elim1Store]: treesize reduction 32, result has 67.0 percent of original size [2022-03-15 21:47:54,396 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2022-03-15 21:47:54,403 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:54,406 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:47:54,416 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:54,417 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 81 [2022-03-15 21:47:54,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:54,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836785802] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:54,669 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:54,669 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-03-15 21:47:54,671 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [385706130] [2022-03-15 21:47:54,672 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:54,673 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:54,680 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 21:47:54,680 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:55,743 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [5880#(and (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))))), 5875#(and (<= (+ res1 (select (select mult (select A i)) (select B i))) res2) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))), 5874#(and (or (<= res1 res2) (< j M)) (or (< j M) (< res2 (+ res1 1)))), 5876#(and (or (< j M) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (< j M) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 5883#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))))) (or (< (+ j 1) M) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j)))) (not (< j M)))), 5863#(or (<= (+ 2 j) M) (and (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j))) (+ res1 (select (select mult (select A i)) (select B i)))) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j))))) (not (< j M))), 5859#(or (<= (+ 2 j) M) (not (< j M)) (and (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j)))) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j))) res1))), 5882#(and (or (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (< j M)) (or (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (< j M))), 5877#(and (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 (select (select mult (select A i)) (select B i))))), 5881#(and (or (< j M) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (< j M) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 5878#(and (or (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (< j M)) (or (< j M) (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 (select (select mult (select A i)) (select B i)))))), 5879#(and (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))] [2022-03-15 21:47:55,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 21:47:55,743 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:55,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 21:47:55,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2022-03-15 21:47:55,744 INFO L87 Difference]: Start difference. First operand 334 states and 1176 transitions. Second operand has 20 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:57,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:57,166 INFO L93 Difference]: Finished difference Result 747 states and 2213 transitions. [2022-03-15 21:47:57,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 21:47:57,167 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 21:47:57,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:57,169 INFO L225 Difference]: With dead ends: 747 [2022-03-15 21:47:57,169 INFO L226 Difference]: Without dead ends: 722 [2022-03-15 21:47:57,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 35 SyntacticMatches, 18 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=295, Invalid=2057, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 21:47:57,170 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 117 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:57,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 0 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:47:57,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2022-03-15 21:47:57,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 374. [2022-03-15 21:47:57,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 373 states have (on average 3.5737265415549597) internal successors, (1333), 373 states have internal predecessors, (1333), 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) [2022-03-15 21:47:57,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1333 transitions. [2022-03-15 21:47:57,181 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1333 transitions. Word has length 15 [2022-03-15 21:47:57,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:57,181 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 1333 transitions. [2022-03-15 21:47:57,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1333 transitions. [2022-03-15 21:47:57,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:47:57,182 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:57,182 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:57,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 21:47:57,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:57,398 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:47:57,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:57,398 INFO L85 PathProgramCache]: Analyzing trace with hash -444618685, now seen corresponding path program 3 times [2022-03-15 21:47:57,399 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:57,400 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173557445] [2022-03-15 21:47:57,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:57,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:57,577 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:57,577 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173557445] [2022-03-15 21:47:57,577 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173557445] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:57,577 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667513953] [2022-03-15 21:47:57,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:47:57,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:57,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:57,578 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) [2022-03-15 21:47:57,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 21:47:57,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:47:57,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:57,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:47:57,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:57,798 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:57,798 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 66 [2022-03-15 21:47:57,815 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:57,816 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 66 [2022-03-15 21:47:57,835 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:47:57,835 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 79 [2022-03-15 21:47:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:59,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:05,185 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:48:05,186 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 117 [2022-03-15 21:48:05,218 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:48:05,219 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 111 [2022-03-15 21:48:05,246 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:48:05,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 115 [2022-03-15 21:48:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:11,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667513953] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:11,413 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:11,413 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-03-15 21:48:11,413 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1588207865] [2022-03-15 21:48:11,413 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:11,414 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:11,417 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 89 transitions. [2022-03-15 21:48:11,417 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:20,456 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [7536#(and (or (<= N i) (< j M) (< k N) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N i) (< j M) (< k N) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 7544#(and (or (<= N (+ i 1)) (< j M) (< k N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N (+ i 1)) (< j M) (< k N) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))), 7539#(and (or (<= (+ k 1) N) (<= N i) (= j 0)) (or (<= (+ k 1) N) (<= N i) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A j)) (select B j)))) (<= 2 M)) (or (<= (+ k 1) N) (<= N i) (<= 2 M) (<= (+ res2 (select (select mult (select A j)) (select B j))) (+ res1 (select (select mult (select A i)) (select B i)))))), 7532#(and (or (<= res1 res2) (< j M)) (or (< j M) (< res2 (+ res1 1)))), 7538#(and (or (< (+ j 1) M) (<= N i) (not (< j M)) (< (+ res2 (select (select mult (select A j)) (select B j))) (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (< (+ j 1) M) (<= N i) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A j)) (select B j)))) (not (< j M)))), 7534#(and (or (<= N i) (< k N) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N i) (< k N) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1)))), 7542#(and (or (<= N (+ i 1)) (< (+ j 1) M) (not (< j M)) (< (+ res2 (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N (+ i 1)) (< (+ j 1) M) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A j)) (select B j)))) (not (< j M)))), 7547#(and (or (not (< k N)) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j)))) (<= (+ 2 j) M) (<= (+ 2 k) N) (not (< j M))) (or (not (< k N)) (<= (+ 2 j) M) (<= (+ 2 k) N) (not (< j M)) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j))) (+ res1 1)))), 7548#(and (or (= (+ (* (- 1) k) M) 0) (<= N i) (= j 0)) (or (= (+ (* (- 1) k) M) 0) (<= N i) (<= 2 M) (= res2 0)) (or (<= N i) (<= (+ 2 M) N) (<= 2 M) (= res2 0)) (or (<= N i) (= j 0) (<= (+ 2 M) N)) (or (= (+ (* (- 1) k) M) 0) (<= N i) (<= 2 M) (<= (+ (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j))) (+ res1 (select (select mult (select A i)) (select B i))))) (or (<= N i) (<= (+ 2 M) N) (<= 2 M) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j))))) (or (= (+ (* (- 1) k) M) 0) (<= N i) (<= 2 M) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j))))) (or (<= N i) (<= (+ 2 M) N) (<= 2 M) (<= (+ (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j))) (+ res1 (select (select mult (select A i)) (select B i)))))), 7545#(and (or (<= N (+ i 1)) (<= (+ res2 (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (<= (+ k 1) N) (<= 2 M)) (or (<= N (+ i 1)) (<= (+ k 1) N) (= j 0)) (or (<= N (+ i 1)) (<= (+ k 1) N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ res2 (select (select mult (select A j)) (select B j)))) (<= 2 M))), 7543#(and (or (<= N (+ i 1)) (< k N) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N (+ i 1)) (< k N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 7549#(and (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0) (<= (+ (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (<= 2 M)) (or (<= N (+ i 1)) (<= (+ 2 M) N) (<= 2 M) (= res2 0)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0) (<= 2 M) (= res2 0)) (or (<= N (+ i 1)) (<= (+ (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (<= (+ 2 M) N) (<= 2 M)) (or (<= N (+ i 1)) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j)))) (<= (+ 2 M) N) (<= 2 M)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) (select (select mult (select A j)) (select B j)))) (<= 2 M)) (or (<= N (+ i 1)) (= j 0) (<= (+ 2 M) N)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0) (= j 0))), 7533#(and (or (<= N i) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N i) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 7537#(and (or (< (+ j 1) M) (not (< j M)) (< (+ res2 (select (select mult (select A j)) (select B j))) (+ res1 1))) (or (< (+ j 1) M) (<= res1 (+ res2 (select (select mult (select A j)) (select B j)))) (not (< j M)))), 7535#(and (or (<= N i) (< j M) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N i) (< j M) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 7541#(and (or (<= N (+ i 1)) (< j M) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N (+ i 1)) (< j M) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))), 7540#(and (or (<= N (+ i 1)) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N (+ i 1)) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))), 7546#(and (or (<= (+ 2 j) M) (<= (+ k 1) N) (not (< j M)) (< (+ res2 (select (select mult (select A j)) (select B j))) (+ res1 1))) (or (<= (+ 2 j) M) (<= (+ k 1) N) (<= res1 (+ res2 (select (select mult (select A j)) (select B j)))) (not (< j M))))] [2022-03-15 21:48:20,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 21:48:20,457 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:20,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 21:48:20,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1301, Unknown=13, NotChecked=0, Total=1482 [2022-03-15 21:48:20,458 INFO L87 Difference]: Start difference. First operand 374 states and 1333 transitions. Second operand has 27 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 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) [2022-03-15 21:48:35,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:35,438 INFO L93 Difference]: Finished difference Result 1132 states and 3301 transitions. [2022-03-15 21:48:35,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2022-03-15 21:48:35,439 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 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 [2022-03-15 21:48:35,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:35,443 INFO L225 Difference]: With dead ends: 1132 [2022-03-15 21:48:35,443 INFO L226 Difference]: Without dead ends: 1124 [2022-03-15 21:48:35,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 22 SyntacticMatches, 9 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6432 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=2786, Invalid=18081, Unknown=13, NotChecked=0, Total=20880 [2022-03-15 21:48:35,447 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 689 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 1976 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:35,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [689 Valid, 0 Invalid, 2151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1976 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 21:48:35,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2022-03-15 21:48:35,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 397. [2022-03-15 21:48:35,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 3.601010101010101) internal successors, (1426), 396 states have internal predecessors, (1426), 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) [2022-03-15 21:48:35,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1426 transitions. [2022-03-15 21:48:35,460 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1426 transitions. Word has length 15 [2022-03-15 21:48:35,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:35,460 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 1426 transitions. [2022-03-15 21:48:35,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 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) [2022-03-15 21:48:35,460 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1426 transitions. [2022-03-15 21:48:35,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:48:35,461 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:35,461 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:35,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-15 21:48:35,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-15 21:48:35,679 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:48:35,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:35,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2091284414, now seen corresponding path program 4 times [2022-03-15 21:48:35,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:35,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390014463] [2022-03-15 21:48:35,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:35,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:35,712 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:48:35,712 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:35,713 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390014463] [2022-03-15 21:48:35,713 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390014463] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:35,713 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562498495] [2022-03-15 21:48:35,713 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:48:35,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:35,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:35,714 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) [2022-03-15 21:48:35,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 21:48:35,738 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:48:35,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:48:35,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:48:35,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:35,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:48:35,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:35,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:48:35,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562498495] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:35,827 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:35,827 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-03-15 21:48:35,828 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [55729163] [2022-03-15 21:48:35,828 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:35,829 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:35,833 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 88 transitions. [2022-03-15 21:48:35,834 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:36,103 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [9786#(or (<= N i) (< (+ i 1) N)), 9784#(or (< (+ j 1) M) (<= M j)), 9785#(or (< (+ 2 j) M) (<= M (+ j 1))), 9783#(< j M), 9788#(or (<= N i) (< (+ i 1) N) (<= (+ M 1) j)), 9789#(or (<= N i) (<= (+ M i 1) (+ N j))), 9787#(or (<= (+ M 1) j) (< i N)), 9782#(< i N)] [2022-03-15 21:48:36,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 21:48:36,104 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:36,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 21:48:36,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-03-15 21:48:36,104 INFO L87 Difference]: Start difference. First operand 397 states and 1426 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:36,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:36,305 INFO L93 Difference]: Finished difference Result 641 states and 2180 transitions. [2022-03-15 21:48:36,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 21:48:36,305 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 21:48:36,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:36,308 INFO L225 Difference]: With dead ends: 641 [2022-03-15 21:48:36,308 INFO L226 Difference]: Without dead ends: 633 [2022-03-15 21:48:36,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=201, Invalid=611, Unknown=0, NotChecked=0, Total=812 [2022-03-15 21:48:36,308 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:36,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:48:36,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2022-03-15 21:48:36,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 400. [2022-03-15 21:48:36,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 3.568922305764411) internal successors, (1424), 399 states have internal predecessors, (1424), 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) [2022-03-15 21:48:36,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1424 transitions. [2022-03-15 21:48:36,318 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1424 transitions. Word has length 15 [2022-03-15 21:48:36,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:36,319 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 1424 transitions. [2022-03-15 21:48:36,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:36,319 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1424 transitions. [2022-03-15 21:48:36,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:48:36,319 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:36,320 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:36,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 21:48:36,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:36,536 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:48:36,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:36,536 INFO L85 PathProgramCache]: Analyzing trace with hash 427005430, now seen corresponding path program 6 times [2022-03-15 21:48:36,537 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:36,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590535960] [2022-03-15 21:48:36,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:36,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:36,583 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:36,584 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:36,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590535960] [2022-03-15 21:48:36,584 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590535960] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:36,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856720786] [2022-03-15 21:48:36,584 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:48:36,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:36,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:36,585 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) [2022-03-15 21:48:36,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 21:48:36,607 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:48:36,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:48:36,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 21:48:36,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:36,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:36,702 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:36,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856720786] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:36,702 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:36,702 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 5] total 12 [2022-03-15 21:48:36,702 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [488247133] [2022-03-15 21:48:36,702 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:36,703 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:36,709 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 21:48:36,710 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:37,733 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [11373#(or (<= N (+ i 1)) (< j M) (<= (+ 2 i) k)), 11370#(or (<= (+ i 1) k) (<= N i)), 11363#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M)), 11384#(or (<= N (+ i 1)) (< j M) (<= i k)), 11372#(or (<= (+ i 1) k) (<= N i) (< j M)), 11376#(or (<= N i) (<= i (+ k 1))), 11359#(or (<= N i) (< (+ i 1) N) (< j M)), 11375#(or (<= N i) (<= i k)), 11364#(or (<= N k) (< (+ k 1) N)), 11380#(or (< j M) (<= i (+ 2 k))), 11374#(or (<= N (+ 2 k)) (< (+ 3 k) N)), 11369#(or (< j M) (<= i (+ k 1))), 11381#(or (<= N i) (< j M) (<= i k)), 11358#(or (< j M) (< i N)), 11368#(or (< j M) (<= i k)), 11361#(or (< j M) (< k N)), 11383#(or (<= N (+ i 1)) (<= (+ i 1) k) (< j M)), 11365#(or (< j M) (<= N k) (< (+ k 1) N)), 11371#(or (<= N (+ i 1)) (<= (+ 2 i) k)), 11367#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 11357#(< j M), 11382#(or (<= N i) (< j M) (<= i (+ k 1))), 11366#(or (<= N (+ k 1)) (< (+ 2 k) N)), 11362#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 11356#(or (<= N i) (<= (+ 2 i) N)), 11378#(or (<= N (+ i 1)) (<= i k)), 11360#(< k N), 11379#(or (< j M) (<= N (+ 2 k)) (< (+ 3 k) N)), 11377#(or (<= N (+ i 1)) (<= (+ i 1) k))] [2022-03-15 21:48:37,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 21:48:37,733 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:37,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 21:48:37,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1500, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 21:48:37,734 INFO L87 Difference]: Start difference. First operand 400 states and 1424 transitions. Second operand has 36 states, 36 states have (on average 3.0833333333333335) internal successors, (111), 35 states have internal predecessors, (111), 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) [2022-03-15 21:48:38,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:38,979 INFO L93 Difference]: Finished difference Result 981 states and 3168 transitions. [2022-03-15 21:48:38,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 21:48:38,979 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.0833333333333335) internal successors, (111), 35 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:48:38,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:38,983 INFO L225 Difference]: With dead ends: 981 [2022-03-15 21:48:38,983 INFO L226 Difference]: Without dead ends: 981 [2022-03-15 21:48:38,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1556 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1394, Invalid=5412, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 21:48:38,988 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 553 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:38,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [553 Valid, 0 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:48:38,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2022-03-15 21:48:39,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 513. [2022-03-15 21:48:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 3.533203125) internal successors, (1809), 512 states have internal predecessors, (1809), 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) [2022-03-15 21:48:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 1809 transitions. [2022-03-15 21:48:39,003 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 1809 transitions. Word has length 16 [2022-03-15 21:48:39,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:39,004 INFO L470 AbstractCegarLoop]: Abstraction has 513 states and 1809 transitions. [2022-03-15 21:48:39,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.0833333333333335) internal successors, (111), 35 states have internal predecessors, (111), 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) [2022-03-15 21:48:39,004 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 1809 transitions. [2022-03-15 21:48:39,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:48:39,005 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:39,005 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:39,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 21:48:39,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 21:48:39,221 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:48:39,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:39,221 INFO L85 PathProgramCache]: Analyzing trace with hash 668382200, now seen corresponding path program 7 times [2022-03-15 21:48:39,222 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:39,222 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92944269] [2022-03-15 21:48:39,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:39,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:39,273 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:39,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92944269] [2022-03-15 21:48:39,273 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92944269] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:39,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824911302] [2022-03-15 21:48:39,273 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:48:39,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:39,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:39,274 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) [2022-03-15 21:48:39,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 21:48:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:39,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 21:48:39,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:39,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:39,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824911302] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:39,348 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:39,348 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-03-15 21:48:39,348 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [488488046] [2022-03-15 21:48:39,348 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:39,349 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:39,355 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 21:48:39,355 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:40,221 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [13567#(or (<= k i) (< j M)), 13594#(or (<= N (+ i 1)) (< j M) (< k N)), 13580#(or (<= N (+ k 1)) (<= (+ 3 k) N)), 13581#(or (<= N (+ k 1)) (<= (+ 3 k) N) (< j M)), 13597#(or (<= N (+ 2 i)) (< j M)), 13576#(or (<= (+ 2 k) N) (<= N k)), 13588#(or (<= (+ k 1) N) (<= N i)), 13575#(<= N (+ i 1)), 13574#(<= N i), 13599#(or (<= N (+ 2 i)) (< j M) (< k N)), 13578#(or (<= (+ k 1) N) (< j M)), 13590#(or (< j M) (<= (+ k 1) i)), 13589#(or (<= N i) (< j M) (< k N)), 13577#(< j M), 13579#(or (<= (+ 2 k) N) (< j M) (<= N k)), 13582#(or (<= (+ 3 k) N) (<= N k)), 13593#(or (<= N (+ i 1)) (< j M)), 13586#(or (<= (+ 3 k) N) (< j M) (<= N k)), 13592#(or (<= N (+ i 1)) (< k N)), 13591#(or (<= (+ 2 k) i) (< j M) (<= N k)), 13584#(or (<= (+ k 1) i) (<= N k)), 13587#(or (<= N i) (< j M)), 13585#(or (<= (+ 2 k) N) (< j M)), 13596#(<= N (+ 2 i)), 13598#(or (<= N (+ 2 i)) (< k N)), 13600#(or (< j M) (<= k (+ i 1))), 13595#(or (< j M) (<= (+ k 1) i) (<= N k)), 13583#(or (<= (+ 2 k) i) (<= N k))] [2022-03-15 21:48:40,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 21:48:40,221 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:40,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 21:48:40,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1110, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 21:48:40,222 INFO L87 Difference]: Start difference. First operand 513 states and 1809 transitions. Second operand has 36 states, 36 states have (on average 3.0555555555555554) internal successors, (110), 35 states have internal predecessors, (110), 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) [2022-03-15 21:48:41,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:41,157 INFO L93 Difference]: Finished difference Result 822 states and 2735 transitions. [2022-03-15 21:48:41,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-03-15 21:48:41,157 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.0555555555555554) internal successors, (110), 35 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:48:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:41,160 INFO L225 Difference]: With dead ends: 822 [2022-03-15 21:48:41,160 INFO L226 Difference]: Without dead ends: 817 [2022-03-15 21:48:41,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1724 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1610, Invalid=5700, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 21:48:41,162 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 299 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:41,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 0 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:48:41,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2022-03-15 21:48:41,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 519. [2022-03-15 21:48:41,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 3.5945945945945947) internal successors, (1862), 518 states have internal predecessors, (1862), 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) [2022-03-15 21:48:41,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 1862 transitions. [2022-03-15 21:48:41,173 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 1862 transitions. Word has length 16 [2022-03-15 21:48:41,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:41,173 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 1862 transitions. [2022-03-15 21:48:41,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.0555555555555554) internal successors, (110), 35 states have internal predecessors, (110), 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) [2022-03-15 21:48:41,173 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 1862 transitions. [2022-03-15 21:48:41,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:48:41,174 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:41,174 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:41,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-03-15 21:48:41,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 21:48:41,389 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:48:41,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:41,390 INFO L85 PathProgramCache]: Analyzing trace with hash 67829269, now seen corresponding path program 5 times [2022-03-15 21:48:41,390 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:41,390 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625900242] [2022-03-15 21:48:41,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:41,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:41,462 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:41,462 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:41,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625900242] [2022-03-15 21:48:41,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625900242] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:41,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407119444] [2022-03-15 21:48:41,462 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:48:41,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:41,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:41,464 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) [2022-03-15 21:48:41,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 21:48:41,522 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:48:41,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:48:41,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 21:48:41,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:41,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:41,666 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:41,666 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407119444] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:41,666 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:41,666 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-03-15 21:48:41,666 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1954093385] [2022-03-15 21:48:41,666 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:41,667 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:41,673 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 138 transitions. [2022-03-15 21:48:41,673 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:42,588 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [15680#(or (<= N i) (< j M) (< k N)), 15681#(or (<= N i) (<= (+ 2 k) N) (< j M)), 15696#(and (or (<= N (+ i 1)) (<= (+ 2 j) N)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0))), 15682#(or (<= N (+ i 1)) (< j M)), 15687#(or (<= N (+ i 1)) (< (+ j 1) M) (<= (+ 2 k) N) (<= M j)), 15693#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M)), 15684#(or (<= N (+ i 1)) (<= (+ 2 k) N) (< j M)), 15686#(or (< (+ j 1) M) (<= N i) (<= (+ 2 k) N) (<= M j)), 15674#(or (<= (+ k 1) N) (<= N i)), 15683#(or (<= N (+ i 1)) (< j M) (< k N)), 15672#(or (< (+ j 1) M) (<= (+ 2 k) N) (<= N k) (<= M j)), 15670#(or (<= (+ k 1) N) (< j M)), 15685#(or (< (+ j 1) M) (<= (+ 2 k) N) (<= M j)), 15678#(or (<= N (+ i 1)) (<= (+ 2 k) N)), 15675#(or (<= N i) (<= (+ 2 k) N)), 15671#(or (<= (+ 2 k) N) (< j M) (<= N k)), 15679#(or (<= N i) (< j M)), 15668#(or (<= (+ 2 k) N) (<= N k)), 15673#(<= N i), 15677#(or (<= N (+ i 1)) (< k N)), 15688#(<= N (+ 2 i)), 15689#(or (<= N (+ 2 i)) (< k N)), 15690#(or (<= N (+ 2 i)) (<= (+ 2 k) N)), 15691#(or (<= N (+ 2 i)) (< j M)), 15692#(or (<= N (+ 2 i)) (< j M) (< k N)), 15645#(or (<= (+ 2 k) N) (< j M)), 15676#(<= N (+ i 1)), 15669#(< j M), 15697#(and (or (<= N (+ 2 i)) (<= (+ 2 j) N)) (or (<= N (+ 2 i)) (= (+ (* (- 1) k) M) 0))), 15695#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= (+ 2 j) N))), 15694#(or (<= N (+ 2 i)) (< (+ j 1) M) (<= (+ 2 k) N) (<= M j))] [2022-03-15 21:48:42,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 21:48:42,589 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:42,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 21:48:42,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=1900, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 21:48:42,590 INFO L87 Difference]: Start difference. First operand 519 states and 1862 transitions. Second operand has 40 states, 40 states have (on average 2.85) internal successors, (114), 39 states have internal predecessors, (114), 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) [2022-03-15 21:48:45,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:45,464 INFO L93 Difference]: Finished difference Result 1196 states and 3860 transitions. [2022-03-15 21:48:45,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-03-15 21:48:45,464 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.85) internal successors, (114), 39 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:48:45,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:45,469 INFO L225 Difference]: With dead ends: 1196 [2022-03-15 21:48:45,469 INFO L226 Difference]: Without dead ends: 1191 [2022-03-15 21:48:45,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 35 SyntacticMatches, 9 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5796 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4220, Invalid=15802, Unknown=0, NotChecked=0, Total=20022 [2022-03-15 21:48:45,473 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 428 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:45,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [428 Valid, 0 Invalid, 1594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:48:45,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2022-03-15 21:48:45,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 654. [2022-03-15 21:48:45,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 653 states have (on average 3.7595712098009186) internal successors, (2455), 653 states have internal predecessors, (2455), 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) [2022-03-15 21:48:45,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 2455 transitions. [2022-03-15 21:48:45,489 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 2455 transitions. Word has length 16 [2022-03-15 21:48:45,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:45,490 INFO L470 AbstractCegarLoop]: Abstraction has 654 states and 2455 transitions. [2022-03-15 21:48:45,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.85) internal successors, (114), 39 states have internal predecessors, (114), 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) [2022-03-15 21:48:45,490 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 2455 transitions. [2022-03-15 21:48:45,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:48:45,491 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:45,491 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:45,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 21:48:45,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 21:48:45,710 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:48:45,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:45,710 INFO L85 PathProgramCache]: Analyzing trace with hash 445494587, now seen corresponding path program 6 times [2022-03-15 21:48:45,711 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:45,711 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820176669] [2022-03-15 21:48:45,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:45,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:45,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:45,757 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:45,757 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820176669] [2022-03-15 21:48:45,757 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820176669] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:45,757 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556924076] [2022-03-15 21:48:45,757 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:48:45,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:45,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:45,758 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:48:45,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 21:48:45,781 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 21:48:45,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:48:45,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:48:45,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:45,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:45,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:45,863 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:45,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556924076] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:45,863 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:45,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-03-15 21:48:45,863 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1406751476] [2022-03-15 21:48:45,863 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:45,864 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:45,870 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 138 transitions. [2022-03-15 21:48:45,870 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:46,551 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [18514#(or (<= N (+ i 1)) (<= (+ i 1) k)), 18500#(or (< j M) (< k N)), 18515#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M)), 18513#(or (<= N (+ i 1)) (<= (+ 2 i) k)), 18502#(or (<= N (+ k 1)) (< (+ 2 k) N)), 18516#(or (<= N (+ i 1)) (< j M) (<= (+ 2 i) k)), 18506#(or (< j M) (<= i (+ k 1))), 18520#(or (<= N (+ i 1)) (< (+ j 1) M) (<= (+ i 1) k) (<= M j)), 18511#(or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (<= M j)), 18508#(or (<= (+ i 1) k) (<= N i) (< j M)), 18510#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= i M))), 18503#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 18519#(or (< (+ j 1) M) (<= N i) (<= i k) (<= M j)), 18521#(and (or (<= N (+ i 1)) (<= (+ i 1) M)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0))), 18505#(or (< j M) (<= i k)), 18501#(or (< j M) (<= N k) (< (+ k 1) N)), 18504#(or (< j M) (< i N)), 18518#(or (< (+ j 1) M) (<= i (+ k 1)) (<= M j)), 18509#(or (<= N i) (< j M) (<= i k)), 18497#(or (<= (+ i 1) k) (<= N i)), 18496#(or (<= N i) (<= (+ 2 i) N)), 18499#(< j M), 18507#(or (<= N i) (< (+ i 1) N) (< j M)), 18495#(or (<= N k) (< (+ k 1) N)), 18498#(or (<= N i) (<= i k)), 18517#(or (<= N (+ i 1)) (<= (+ i 1) k) (< j M)), 18494#(< k N), 18512#(or (<= N (+ i 1)) (<= (+ 3 i) N))] [2022-03-15 21:48:46,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 21:48:46,552 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:46,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 21:48:46,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1617, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 21:48:46,552 INFO L87 Difference]: Start difference. First operand 654 states and 2455 transitions. Second operand has 37 states, 37 states have (on average 2.945945945945946) internal successors, (109), 36 states have internal predecessors, (109), 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) [2022-03-15 21:48:53,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:53,602 INFO L93 Difference]: Finished difference Result 3341 states and 11312 transitions. [2022-03-15 21:48:53,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2022-03-15 21:48:53,602 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.945945945945946) internal successors, (109), 36 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:48:53,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:53,614 INFO L225 Difference]: With dead ends: 3341 [2022-03-15 21:48:53,614 INFO L226 Difference]: Without dead ends: 3284 [2022-03-15 21:48:53,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18459 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8426, Invalid=44244, Unknown=0, NotChecked=0, Total=52670 [2022-03-15 21:48:53,617 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 824 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 2011 mSolverCounterSat, 334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 2011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:53,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [824 Valid, 0 Invalid, 2345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 2011 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:48:53,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3284 states. [2022-03-15 21:48:53,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3284 to 1151. [2022-03-15 21:48:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 1150 states have (on average 4.118260869565217) internal successors, (4736), 1150 states have internal predecessors, (4736), 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) [2022-03-15 21:48:53,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 4736 transitions. [2022-03-15 21:48:53,654 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 4736 transitions. Word has length 16 [2022-03-15 21:48:53,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:53,655 INFO L470 AbstractCegarLoop]: Abstraction has 1151 states and 4736 transitions. [2022-03-15 21:48:53,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.945945945945946) internal successors, (109), 36 states have internal predecessors, (109), 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) [2022-03-15 21:48:53,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 4736 transitions. [2022-03-15 21:48:53,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:48:53,657 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:53,657 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:53,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 21:48:53,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 21:48:53,873 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:48:53,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:53,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1340357590, now seen corresponding path program 7 times [2022-03-15 21:48:53,874 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:53,874 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905192881] [2022-03-15 21:48:53,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:53,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:53,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:53,913 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:53,913 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905192881] [2022-03-15 21:48:53,913 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905192881] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:53,913 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019946744] [2022-03-15 21:48:53,913 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:48:53,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:53,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:53,914 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:48:53,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 21:48:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:53,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:48:53,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:54,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:54,070 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:54,070 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019946744] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:54,070 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:54,070 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2022-03-15 21:48:54,070 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2078300533] [2022-03-15 21:48:54,070 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:54,071 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:54,076 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 109 transitions. [2022-03-15 21:48:54,076 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:54,618 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [24654#(or (<= N i) (<= (+ M i) (+ N j))), 24652#(or (<= N i) (<= (+ M i 1) (+ N j))), 24653#(or (<= (+ M i) (+ N j 1)) (<= M j)), 24643#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 24650#(or (< (+ j 1) M) (< i N) (<= M j)), 24648#(or (< (+ j 1) M) (<= M j)), 24646#(or (<= N i) (< (+ i 1) N) (< j M)), 24657#(or (<= N (+ i 1)) (<= (+ M i 1) (+ N j))), 24642#(or (<= N i) (<= (+ 2 i) N)), 24644#(< j M), 24645#(or (< j M) (< i N)), 24651#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= M j)), 24655#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= M j)), 24649#(or (< (+ 2 j) M) (<= M (+ j 1))), 24656#(or (<= N (+ i 1)) (<= (+ 2 M i) (+ N j))), 24647#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M))] [2022-03-15 21:48:54,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 21:48:54,618 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:54,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 21:48:54,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2022-03-15 21:48:54,618 INFO L87 Difference]: Start difference. First operand 1151 states and 4736 transitions. Second operand has 22 states, 22 states have (on average 3.5) internal successors, (77), 21 states have internal predecessors, (77), 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) [2022-03-15 21:48:55,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:55,622 INFO L93 Difference]: Finished difference Result 3519 states and 13236 transitions. [2022-03-15 21:48:55,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 21:48:55,623 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.5) internal successors, (77), 21 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:48:55,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:55,650 INFO L225 Difference]: With dead ends: 3519 [2022-03-15 21:48:55,650 INFO L226 Difference]: Without dead ends: 3519 [2022-03-15 21:48:55,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=818, Invalid=2488, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 21:48:55,651 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 348 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:55,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 0 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:48:55,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3519 states. [2022-03-15 21:48:55,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3519 to 1865. [2022-03-15 21:48:55,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1865 states, 1864 states have (on average 4.226931330472103) internal successors, (7879), 1864 states have internal predecessors, (7879), 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) [2022-03-15 21:48:55,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 7879 transitions. [2022-03-15 21:48:55,694 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 7879 transitions. Word has length 16 [2022-03-15 21:48:55,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:55,694 INFO L470 AbstractCegarLoop]: Abstraction has 1865 states and 7879 transitions. [2022-03-15 21:48:55,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.5) internal successors, (77), 21 states have internal predecessors, (77), 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) [2022-03-15 21:48:55,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 7879 transitions. [2022-03-15 21:48:55,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:48:55,698 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:55,698 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:55,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 21:48:55,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:55,918 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:48:55,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:55,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1110084155, now seen corresponding path program 8 times [2022-03-15 21:48:55,919 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:55,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419663398] [2022-03-15 21:48:55,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:55,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:55,976 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:55,976 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:55,976 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419663398] [2022-03-15 21:48:55,976 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419663398] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:55,976 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741555290] [2022-03-15 21:48:55,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:48:55,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:55,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:55,977 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:48:55,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 21:48:56,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:48:56,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:48:56,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:48:56,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:56,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:56,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:56,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741555290] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:56,145 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:56,146 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2022-03-15 21:48:56,146 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [819595802] [2022-03-15 21:48:56,146 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:56,147 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:56,151 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 100 transitions. [2022-03-15 21:48:56,151 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:56,823 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [32070#(< k N), 32074#(or (< j M) (<= N k) (< (+ k 1) N)), 32079#(or (<= (+ i 1) k) (<= N i)), 32073#(or (<= N k) (< (+ k 1) N)), 32083#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M)), 32087#(and (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0)) (or (<= N (+ i 1)) (<= i j))), 32085#(or (<= N (+ i 1)) (<= (+ M i 1) (+ k j))), 32075#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 32071#(< j M), 32072#(or (< j M) (< k N)), 32077#(or (< j M) (< i N)), 32076#(or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (<= M j)), 32081#(or (<= N i) (<= (+ M i) (+ k j))), 32082#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 32078#(or (<= N i) (<= (+ 2 i) N)), 32080#(or (<= N i) (< (+ i 1) N) (< j M)), 32084#(or (<= N (+ i 1)) (<= (+ 2 i) k)), 32086#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= i (+ j 1))))] [2022-03-15 21:48:56,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 21:48:56,824 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:56,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 21:48:56,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 21:48:56,824 INFO L87 Difference]: Start difference. First operand 1865 states and 7879 transitions. Second operand has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 25 states have internal predecessors, (76), 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) [2022-03-15 21:49:02,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:02,004 INFO L93 Difference]: Finished difference Result 7342 states and 27893 transitions. [2022-03-15 21:49:02,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2022-03-15 21:49:02,005 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:49:02,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:02,025 INFO L225 Difference]: With dead ends: 7342 [2022-03-15 21:49:02,025 INFO L226 Difference]: Without dead ends: 7302 [2022-03-15 21:49:02,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12641 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5496, Invalid=29660, Unknown=0, NotChecked=0, Total=35156 [2022-03-15 21:49:02,027 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 533 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:02,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [533 Valid, 0 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:49:02,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7302 states. [2022-03-15 21:49:02,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7302 to 2809. [2022-03-15 21:49:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2809 states, 2808 states have (on average 4.496082621082621) internal successors, (12625), 2808 states have internal predecessors, (12625), 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) [2022-03-15 21:49:02,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2809 states and 12625 transitions. [2022-03-15 21:49:02,125 INFO L78 Accepts]: Start accepts. Automaton has 2809 states and 12625 transitions. Word has length 16 [2022-03-15 21:49:02,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:02,125 INFO L470 AbstractCegarLoop]: Abstraction has 2809 states and 12625 transitions. [2022-03-15 21:49:02,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 25 states have internal predecessors, (76), 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) [2022-03-15 21:49:02,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2809 states and 12625 transitions. [2022-03-15 21:49:02,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:49:02,131 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:02,131 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:02,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 21:49:02,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 21:49:02,349 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:49:02,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:02,349 INFO L85 PathProgramCache]: Analyzing trace with hash 981045973, now seen corresponding path program 9 times [2022-03-15 21:49:02,350 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:02,350 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499141970] [2022-03-15 21:49:02,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:02,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:02,409 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:02,409 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:02,409 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499141970] [2022-03-15 21:49:02,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499141970] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:02,409 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033878525] [2022-03-15 21:49:02,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:49:02,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:02,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:02,410 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:49:02,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 21:49:02,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:49:02,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:02,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:49:02,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:02,502 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:02,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:02,564 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033878525] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:02,564 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:02,564 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2022-03-15 21:49:02,564 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1634321659] [2022-03-15 21:49:02,564 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:02,565 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:02,569 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 98 transitions. [2022-03-15 21:49:02,569 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:03,170 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [45476#(or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (<= M j)), 45480#(or (<= N i) (<= (+ M i) (+ k j))), 45467#(or (< (+ j 1) M) (<= M j)), 45475#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 45473#(or (<= N i) (< (+ i 1) N) (< j M)), 45477#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 45481#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= M j)), 45484#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= i (+ j 1)))), 45465#(< j M), 45478#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M)), 45472#(or (<= N i) (<= (+ 2 i) N)), 45474#(or (< (+ j 1) M) (<= N i) (< (+ i 1) N) (<= M j)), 45470#(or (< j M) (< k N)), 45469#(< k N), 45468#(or (< (+ j 1) M) (< i N) (<= M j)), 45466#(or (< j M) (< i N)), 45483#(or (<= N (+ i 1)) (<= (+ M i 1) (+ k j))), 45485#(and (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0)) (or (<= N (+ i 1)) (<= i j))), 45479#(or (<= N i) (<= (+ M i 1) (+ N j))), 45471#(or (< (+ j 1) M) (< k N) (<= M j)), 45482#(or (<= N (+ i 1)) (<= (+ 2 M i) (+ N j)))] [2022-03-15 21:49:03,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 21:49:03,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:03,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 21:49:03,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1264, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 21:49:03,171 INFO L87 Difference]: Start difference. First operand 2809 states and 12625 transitions. Second operand has 29 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 28 states have internal predecessors, (80), 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) [2022-03-15 21:49:08,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:08,841 INFO L93 Difference]: Finished difference Result 7497 states and 29878 transitions. [2022-03-15 21:49:08,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2022-03-15 21:49:08,855 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 28 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:49:08,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:08,877 INFO L225 Difference]: With dead ends: 7497 [2022-03-15 21:49:08,877 INFO L226 Difference]: Without dead ends: 7494 [2022-03-15 21:49:08,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9764 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5169, Invalid=23223, Unknown=0, NotChecked=0, Total=28392 [2022-03-15 21:49:08,879 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 582 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:08,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [582 Valid, 0 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:49:08,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7494 states. [2022-03-15 21:49:08,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7494 to 2840. [2022-03-15 21:49:08,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2840 states, 2839 states have (on average 4.480098626276858) internal successors, (12719), 2839 states have internal predecessors, (12719), 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) [2022-03-15 21:49:08,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 12719 transitions. [2022-03-15 21:49:08,975 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 12719 transitions. Word has length 16 [2022-03-15 21:49:08,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:08,976 INFO L470 AbstractCegarLoop]: Abstraction has 2840 states and 12719 transitions. [2022-03-15 21:49:08,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 28 states have internal predecessors, (80), 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) [2022-03-15 21:49:08,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 12719 transitions. [2022-03-15 21:49:08,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:49:08,982 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:08,982 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:08,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-03-15 21:49:09,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:09,195 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:49:09,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:09,196 INFO L85 PathProgramCache]: Analyzing trace with hash -126208749, now seen corresponding path program 10 times [2022-03-15 21:49:09,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:09,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700333767] [2022-03-15 21:49:09,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:09,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:09,255 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:09,255 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700333767] [2022-03-15 21:49:09,255 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700333767] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:09,255 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141434769] [2022-03-15 21:49:09,256 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:49:09,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:09,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:09,257 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:49:09,279 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:49:09,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:09,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 21:49:09,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:09,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 21:49:09,407 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:09,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:09,513 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:09,514 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141434769] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:09,514 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:09,514 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 19 [2022-03-15 21:49:09,514 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1476255678] [2022-03-15 21:49:09,514 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:09,515 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:09,519 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 108 transitions. [2022-03-15 21:49:09,519 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:10,150 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [59037#(or (< (+ j 1) M) (< k N) (<= M j)), 59038#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 59045#(or (<= (+ 3 k j) (+ N M)) (<= N k)), 59054#(or (<= N (+ 2 i)) (< (+ j 1) M) (<= M j)), 59043#(<= N (+ 2 i)), 59006#(or (<= (+ k 1) N) (< j M)), 59036#(or (< (+ j 1) M) (<= M j)), 59050#(or (<= N (+ i 1)) (<= (+ k j 1) (+ N M))), 59055#(or (<= N k) (<= (+ k j 1) (+ M i))), 59052#(or (<= N (+ 2 i)) (< j M)), 59042#(or (<= N (+ i 1)) (< k N)), 59046#(or (<= (+ 2 k j) (+ M i)) (<= N k)), 59056#(or (<= (+ k j 1) (+ N M)) (<= N (+ 2 i))), 59047#(or (<= N i) (< j M)), 59040#(<= N (+ i 1)), 59041#(or (<= (+ k 1) N) (<= N i)), 59048#(or (<= (+ k j 1) (+ N M)) (<= N i)), 59051#(or (< (+ j 1) M) (<= N i) (<= M j)), 59049#(or (<= N (+ i 1)) (< j M)), 59044#(or (<= N (+ 2 i)) (< k N)), 59053#(or (<= N (+ i 1)) (< (+ j 1) M) (<= M j)), 59035#(< j M), 59039#(<= N i)] [2022-03-15 21:49:10,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 21:49:10,151 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:10,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 21:49:10,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1501, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 21:49:10,151 INFO L87 Difference]: Start difference. First operand 2840 states and 12719 transitions. Second operand has 32 states, 32 states have (on average 2.75) internal successors, (88), 31 states have internal predecessors, (88), 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) [2022-03-15 21:49:12,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:12,908 INFO L93 Difference]: Finished difference Result 4512 states and 18540 transitions. [2022-03-15 21:49:12,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-03-15 21:49:12,909 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.75) internal successors, (88), 31 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:49:12,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:12,921 INFO L225 Difference]: With dead ends: 4512 [2022-03-15 21:49:12,921 INFO L226 Difference]: Without dead ends: 4500 [2022-03-15 21:49:12,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7674 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4441, Invalid=19739, Unknown=0, NotChecked=0, Total=24180 [2022-03-15 21:49:12,924 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 508 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:12,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [508 Valid, 0 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:49:12,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4500 states. [2022-03-15 21:49:12,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4500 to 3076. [2022-03-15 21:49:12,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3076 states, 3075 states have (on average 4.550569105691057) internal successors, (13993), 3075 states have internal predecessors, (13993), 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) [2022-03-15 21:49:13,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 13993 transitions. [2022-03-15 21:49:13,003 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 13993 transitions. Word has length 16 [2022-03-15 21:49:13,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:13,004 INFO L470 AbstractCegarLoop]: Abstraction has 3076 states and 13993 transitions. [2022-03-15 21:49:13,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.75) internal successors, (88), 31 states have internal predecessors, (88), 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) [2022-03-15 21:49:13,004 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 13993 transitions. [2022-03-15 21:49:13,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:49:13,010 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:13,011 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:13,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 21:49:13,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:13,229 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:49:13,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:13,229 INFO L85 PathProgramCache]: Analyzing trace with hash 221923624, now seen corresponding path program 8 times [2022-03-15 21:49:13,230 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:13,230 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984729926] [2022-03-15 21:49:13,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:13,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:13,466 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:13,466 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:13,466 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984729926] [2022-03-15 21:49:13,466 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984729926] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:13,466 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671868584] [2022-03-15 21:49:13,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:49:13,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:13,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:13,467 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:49:13,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 21:49:13,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:49:13,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:13,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 21:49:13,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:13,696 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:13,696 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 80 [2022-03-15 21:49:13,699 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 63 [2022-03-15 21:49:13,701 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2022-03-15 21:49:13,743 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:13,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:13,951 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 21:49:13,952 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 141 [2022-03-15 21:49:14,036 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:14,036 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 56 treesize of output 278 [2022-03-15 21:49:14,046 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:49:14,046 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:49:14,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:49:14,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:49:14,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:49:14,051 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:49:14,085 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:49:14,085 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 266 treesize of output 262 [2022-03-15 21:50:49,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:50:49,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:50:49,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:50:49,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:50:49,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:50:49,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:50:49,752 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:50:49,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:50:49,753 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 55 [2022-03-15 21:50:49,796 INFO L353 Elim1Store]: treesize reduction 191, result has 25.7 percent of original size [2022-03-15 21:50:49,796 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 55 treesize of output 77 [2022-03-15 21:50:49,798 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:50:49,799 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:50:49,799 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:50:49,800 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2022-03-15 21:50:49,855 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:49,855 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671868584] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:50:49,855 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:50:49,855 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2022-03-15 21:50:49,855 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1486790822] [2022-03-15 21:50:49,855 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:50:49,856 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:50:49,887 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 173 transitions. [2022-03-15 21:50:49,887 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:50:54,377 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 43 new interpolants: [70101#(and (or (<= 3 N) (<= N i) (< j M)) (or (<= N i) (< j M) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))))) (< (+ 3 k) N)) (or (<= N i) (< j M) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ res1 (select (select mult (select A i)) (select B i)))) (< (+ 3 k) N)) (or (<= N i) (< j M) (= k 0)) (or (<= N i) (< j M) (= res2 0) (< 3 N))), 70069#(and (or (<= N i) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N i) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 70086#(and (or (<= N i) (< j M) (< k N) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N i) (< j M) (< k N) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 70085#(and (or (<= N (+ i 1)) (< j M) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N (+ i 1)) (< j M) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))), 70096#(and (or (not (< (+ 2 k) N)) (< j M) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ 2 k))) (select B (+ 2 k))) (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ res1 1)) (<= (+ k 4) N)) (or (not (< (+ 2 k) N)) (< j M) (<= (+ k 4) N) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ 2 k))) (select B (+ 2 k))) (select (select mult (select A (+ k 1))) (select B (+ k 1))))))), 70077#(and (or (not (< k N)) (<= (+ 2 k) N) (< j M) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 1))) (or (not (< k N)) (<= (+ 2 k) N) (< j M) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2)))), 70109#(and (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))))))), 70104#(and (or (<= N (+ i 1)) (< j M) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (< (+ 2 k) N)) (or (<= N (+ i 1)) (<= (+ 2 k) N) (< j M)) (or (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2)) (<= N (+ i 1)) (< j M) (< (+ 2 k) N))), 70070#(and (or (<= N i) (< k N) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N i) (< k N) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1)))), 70080#(and (or (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (<= N (+ i 1)) (<= (+ 2 k) N)) (or (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (<= N (+ i 1)) (<= (+ 2 k) N))), 70073#(and (or (not (< k N)) (<= (+ 2 k) N) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 1))) (or (not (< k N)) (<= (+ 2 k) N) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2)))), 70091#(and (or (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (<= N i) (<= (+ 2 k) N) (< j M)) (or (<= N i) (<= (+ 2 k) N) (< j M) (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 (select (select mult (select A i)) (select B i)))))), 70092#(and (or (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (<= N (+ i 1)) (<= (+ 2 k) N) (< j M)) (or (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (<= N (+ i 1)) (<= (+ 2 k) N) (< j M))), 70071#(and (or (<= N (+ i 1)) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N (+ i 1)) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))), 70082#(and (or (<= N (+ 2 i)) (< k N) (< res2 (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N (+ 2 i)) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2) (< k N))), 70103#(and (or (<= N (+ i 1)) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ (- 2) N))) (select B (+ (- 2) N)))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (< 3 N)) (or (<= N (+ i 1)) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ (- 2) N))) (select B (+ (- 2) N))))) (< 3 N)) (or (<= N (+ i 1)) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))))) (< (+ 3 k) N)) (or (<= N (+ i 1)) (<= 3 N)) (or (<= N (+ i 1)) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (< (+ 3 k) N)) (or (<= N (+ i 1)) (= k 0))), 70111#(and (or (<= N (+ 2 i)) (< j M) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ 2 k))) (select B (+ 2 k))) (select (select mult (select A (+ k 1))) (select B (+ k 1))))) (<= (+ k 4) N)) (or (<= N (+ 2 i)) (< j M) (= k 0)) (or (<= N (+ 2 i)) (< j M) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ (- 2) N))) (select B (+ (- 2) N))))) (< 3 N)) (or (<= N (+ 2 i)) (< j M) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ (- 2) N))) (select B (+ (- 2) N)))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (< 3 N)) (or (<= N (+ 2 i)) (< j M) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ 2 k))) (select B (+ 2 k))) (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (<= (+ k 4) N)) (or (<= N (+ 2 i)) (<= 3 N) (< j M))), 70088#(and (or (<= N (+ 2 i)) (< j M) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N (+ 2 i)) (< j M) (< res2 (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))), 70081#(and (or (<= N (+ 2 i)) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N (+ 2 i)) (< res2 (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))), 70089#(and (or (<= N (+ 2 i)) (< j M) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2) (< k N)) (or (<= N (+ 2 i)) (< j M) (< k N) (< res2 (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))), 70108#(and (or (<= N (+ 2 i)) (<= (+ 2 k) N)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))))))), 70102#(and (or (<= N (+ i 1)) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (< (+ 2 k) N)) (or (<= N (+ i 1)) (<= (+ 2 k) N)) (or (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2)) (<= N (+ i 1)) (< (+ 2 k) N))), 70097#(and (or (< j M) (<= res1 (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ (- 2) N))) (select B (+ (- 2) N))))) (< 3 N)) (or (< j M) (= res2 0) (< 3 N)) (or (<= 3 N) (< j M)) (or (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ (- 2) N))) (select B (+ (- 2) N)))) res1) (< j M) (< 3 N)) (or (< j M) (= k 0))), 70072#(and (or (<= N (+ i 1)) (< k N) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N (+ i 1)) (< k N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 70087#(and (or (<= N (+ i 1)) (< j M) (< k N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N (+ i 1)) (< j M) (< k N) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))), 70090#(and (or (<= (+ 2 k) N) (< j M) (<= (+ (select (select mult (select A k)) (select B k)) res2) res1)) (or (<= (+ 2 k) N) (< j M) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2)))), 70098#(and (or (<= N i) (< (+ 2 k) N) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2) (+ res1 (select (select mult (select A i)) (select B i))))) (or (<= N i) (<= (+ 2 k) N)) (or (<= N i) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2)) (< (+ 2 k) N))), 70084#(and (or (<= N i) (< j M) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N i) (< j M) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 70079#(and (or (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (<= N i) (<= (+ 2 k) N)) (or (<= N i) (<= (+ 2 k) N) (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 (select (select mult (select A i)) (select B i)))))), 70110#(and (or (<= N (+ 2 i)) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ 2 k))) (select B (+ 2 k))) (select (select mult (select A (+ k 1))) (select B (+ k 1))))) (<= (+ k 4) N)) (or (<= N (+ 2 i)) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ (- 2) N))) (select B (+ (- 2) N)))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (< 3 N)) (or (<= N (+ 2 i)) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ (- 2) N))) (select B (+ (- 2) N))))) (< 3 N)) (or (<= N (+ 2 i)) (<= 3 N)) (or (<= N (+ 2 i)) (= k 0)) (or (<= N (+ 2 i)) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ 2 k))) (select B (+ 2 k))) (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (<= (+ k 4) N))), 70100#(and (or (<= N i) (< j M) (< (+ 2 k) N) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2) (+ res1 (select (select mult (select A i)) (select B i))))) (or (<= N i) (<= (+ 2 k) N) (< j M)) (or (<= N i) (< j M) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2)) (< (+ 2 k) N))), 70083#(and (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)))), 70105#(and (or (<= N (+ i 1)) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ (- 2) N))) (select B (+ (- 2) N)))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (< j M) (< 3 N)) (or (<= N (+ i 1)) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (< j M) (< (+ 3 k) N)) (or (<= N (+ i 1)) (< j M) (= k 0)) (or (<= N (+ i 1)) (< j M) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))))) (< (+ 3 k) N)) (or (<= N (+ i 1)) (<= 3 N) (< j M)) (or (<= N (+ i 1)) (< j M) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ (- 2) N))) (select B (+ (- 2) N))))) (< 3 N))), 70074#(and (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ res1 1))) (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))))))), 70093#(and (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)))), 70095#(and (or (<= (+ 3 k) N) (< j M) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))))) (or (<= (+ 2 k) N) (< j M)) (or (<= (+ 3 k) N) (< j M) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) res1))), 70094#(and (or (not (< (+ 2 k) N)) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ 2 k))) (select B (+ 2 k))) (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ res1 1)) (<= (+ k 4) N)) (or (not (< (+ 2 k) N)) (<= (+ k 4) N) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ 2 k))) (select B (+ 2 k))) (select (select mult (select A (+ k 1))) (select B (+ k 1))))))), 70106#(and (or (< 2 i) (< j M) (= res2 0)) (or (< 2 i) (< j M) (<= res1 (+ (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ (- 1) i))) (select B (+ (- 1) i)))))) (or (< j M) (= k 0)) (or (< 2 i) (<= (+ (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ (- 1) i))) (select B (+ (- 1) i)))) res1) (< j M)) (or (<= 2 i) (< j M))), 70107#(and (or (< j M) (<= res1 (select (select mult (select A k)) (select B k)))) (or (< j M) (<= 1 i)) (or (< j M) (= k 0)) (or (< j M) (<= (select (select mult (select A k)) (select B k)) res1)) (or (< j M) (= res2 0))), 70099#(and (or (<= N i) (= res2 0) (< 3 N)) (or (<= N i) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ (- 2) N))) (select B (+ (- 2) N)))) (+ res1 (select (select mult (select A i)) (select B i)))) (< 3 N)) (or (<= 3 N) (<= N i)) (or (<= N i) (< 3 N) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) (select (select mult (select A (+ (- 2) N))) (select B (+ (- 2) N)))))) (or (<= N i) (= k 0))), 70075#(and (or (<= res1 res2) (< j M)) (or (< j M) (< res2 (+ res1 1)))), 70078#(and (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< j M) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ res1 1))) (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< j M) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))))))), 70076#(and (or (<= (+ k 1) N) (< j M) (< res2 (+ res1 1))) (or (<= res1 res2) (<= (+ k 1) N) (< j M)))] [2022-03-15 21:50:54,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-15 21:50:54,377 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:50:54,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-15 21:50:54,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=3849, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 21:50:54,387 INFO L87 Difference]: Start difference. First operand 3076 states and 13993 transitions. Second operand has 54 states, 53 states have (on average 2.7169811320754715) internal successors, (144), 53 states have internal predecessors, (144), 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) [2022-03-15 21:51:20,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:20,344 INFO L93 Difference]: Finished difference Result 4458 states and 18286 transitions. [2022-03-15 21:51:20,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2022-03-15 21:51:20,346 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.7169811320754715) internal successors, (144), 53 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:51:20,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:20,362 INFO L225 Difference]: With dead ends: 4458 [2022-03-15 21:51:20,362 INFO L226 Difference]: Without dead ends: 4419 [2022-03-15 21:51:20,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21679 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=9289, Invalid=51473, Unknown=0, NotChecked=0, Total=60762 [2022-03-15 21:51:20,366 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 949 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 2756 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 2756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:20,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [949 Valid, 0 Invalid, 3037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 2756 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 21:51:20,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4419 states. [2022-03-15 21:51:20,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4419 to 3155. [2022-03-15 21:51:20,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3155 states, 3154 states have (on average 4.542485732403297) internal successors, (14327), 3154 states have internal predecessors, (14327), 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) [2022-03-15 21:51:20,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3155 states to 3155 states and 14327 transitions. [2022-03-15 21:51:20,462 INFO L78 Accepts]: Start accepts. Automaton has 3155 states and 14327 transitions. Word has length 17 [2022-03-15 21:51:20,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:20,462 INFO L470 AbstractCegarLoop]: Abstraction has 3155 states and 14327 transitions. [2022-03-15 21:51:20,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.7169811320754715) internal successors, (144), 53 states have internal predecessors, (144), 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) [2022-03-15 21:51:20,463 INFO L276 IsEmpty]: Start isEmpty. Operand 3155 states and 14327 transitions. [2022-03-15 21:51:20,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:51:20,468 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:20,468 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:20,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 21:51:20,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:20,672 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:20,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:20,673 INFO L85 PathProgramCache]: Analyzing trace with hash 368837058, now seen corresponding path program 9 times [2022-03-15 21:51:20,673 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:20,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253658204] [2022-03-15 21:51:20,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:20,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:20,719 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:20,720 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:20,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253658204] [2022-03-15 21:51:20,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253658204] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:20,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362248073] [2022-03-15 21:51:20,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:51:20,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:20,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:20,721 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:51:20,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 21:51:20,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:51:20,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:20,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 21:51:20,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:20,824 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:20,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:20,850 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:20,850 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362248073] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:20,850 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:20,850 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-03-15 21:51:20,850 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [387738203] [2022-03-15 21:51:20,850 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:20,852 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:20,859 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 21:51:20,859 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:21,662 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 37 new interpolants: [81369#(or (< j M) (<= N (+ 3 k))), 81360#(or (<= N i) (< (+ i 1) N) (<= N k)), 81379#(or (<= N i) (< (+ i 1) N) (< j M) (<= (+ N 1) k)), 81389#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 81366#(or (< j M) (<= (+ N 1) k)), 81373#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N)), 81386#(or (< j M) (<= i (+ k 1))), 81378#(or (< j M) (<= N k) (< i N)), 81381#(or (<= N (+ k 1)) (< j M) (< i N)), 81357#(or (<= N k) (< i N)), 81384#(or (< j M) (<= i (+ 2 k))), 81382#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N) (< j M)), 81380#(or (<= N i) (< (+ i 1) N) (< j M) (<= N k)), 81377#(or (< j M) (<= (+ N 1) k) (< i N)), 81356#(or (<= (+ N 1) k) (< i N)), 81365#(or (< j M) (<= N k)), 81355#(< i N), 81367#(or (<= N (+ k 1)) (< j M)), 81388#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= N k)), 81359#(or (<= N i) (< (+ i 1) N) (<= (+ N 1) k)), 81387#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (+ N 1) k)), 81390#(or (<= N (+ i 1)) (< j M) (<= i k)), 81363#(or (<= N i) (<= i (+ k 1))), 81332#(<= N (+ 3 k)), 81383#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 81361#(or (<= N (+ k 1)) (< i N)), 81374#(or (<= N (+ i 1)) (<= i k)), 81371#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N 1) k)), 81362#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 81358#(or (<= N i) (< (+ i 1) N)), 81376#(or (<= N i) (< (+ i 1) N) (< j M)), 81368#(or (< j M) (<= N (+ 2 k))), 81370#(or (<= N (+ i 1)) (< (+ 2 i) N)), 81364#(< j M), 81372#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 81385#(or (<= N i) (< j M) (<= i (+ k 1))), 81375#(or (< j M) (< i N))] [2022-03-15 21:51:21,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 21:51:21,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:21,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 21:51:21,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=2497, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 21:51:21,668 INFO L87 Difference]: Start difference. First operand 3155 states and 14327 transitions. Second operand has 47 states, 47 states have (on average 2.8085106382978724) internal successors, (132), 46 states have internal predecessors, (132), 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) [2022-03-15 21:51:22,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:22,542 INFO L93 Difference]: Finished difference Result 5413 states and 23643 transitions. [2022-03-15 21:51:22,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 21:51:22,542 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.8085106382978724) internal successors, (132), 46 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:51:22,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:22,555 INFO L225 Difference]: With dead ends: 5413 [2022-03-15 21:51:22,555 INFO L226 Difference]: Without dead ends: 5322 [2022-03-15 21:51:22,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1977 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1569, Invalid=5741, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 21:51:22,560 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 489 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:22,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 0 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:51:22,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2022-03-15 21:51:22,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 3979. [2022-03-15 21:51:22,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3979 states, 3978 states have (on average 4.584715937657114) internal successors, (18238), 3978 states have internal predecessors, (18238), 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) [2022-03-15 21:51:22,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3979 states to 3979 states and 18238 transitions. [2022-03-15 21:51:22,661 INFO L78 Accepts]: Start accepts. Automaton has 3979 states and 18238 transitions. Word has length 17 [2022-03-15 21:51:22,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:22,661 INFO L470 AbstractCegarLoop]: Abstraction has 3979 states and 18238 transitions. [2022-03-15 21:51:22,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.8085106382978724) internal successors, (132), 46 states have internal predecessors, (132), 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) [2022-03-15 21:51:22,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3979 states and 18238 transitions. [2022-03-15 21:51:22,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:51:22,669 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:22,669 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:22,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 21:51:22,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:22,883 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:22,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:22,884 INFO L85 PathProgramCache]: Analyzing trace with hash -183898455, now seen corresponding path program 11 times [2022-03-15 21:51:22,885 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:22,885 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814147332] [2022-03-15 21:51:22,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:22,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:23,136 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:23,136 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:23,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814147332] [2022-03-15 21:51:23,136 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814147332] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:23,137 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140451632] [2022-03-15 21:51:23,137 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:51:23,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:23,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:23,138 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:51:23,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 21:51:23,165 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:51:23,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:23,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 21:51:23,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:23,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:23,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:23,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:23,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:23,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:51:23,327 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:23,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2022-03-15 21:51:23,358 INFO L353 Elim1Store]: treesize reduction 106, result has 34.2 percent of original size [2022-03-15 21:51:23,358 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 67 [2022-03-15 21:51:23,361 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2022-03-15 21:51:23,389 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:23,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:23,609 INFO L353 Elim1Store]: treesize reduction 48, result has 68.2 percent of original size [2022-03-15 21:51:23,609 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 72 treesize of output 157 [2022-03-15 21:51:23,676 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:51:23,677 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 268 [2022-03-15 21:51:23,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:23,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:23,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:23,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:51:23,723 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:51:23,723 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 256 treesize of output 274 [2022-03-15 21:55:29,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:29,146 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:29,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:29,149 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:29,149 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:29,149 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:29,149 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:29,150 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:29,151 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:29,168 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:55:29,168 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 114 [2022-03-15 21:55:29,239 INFO L353 Elim1Store]: treesize reduction 153, result has 40.2 percent of original size [2022-03-15 21:55:29,240 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 114 [2022-03-15 21:55:29,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:29,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:29,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:29,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:29,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:29,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:29,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:29,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:29,251 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:55:29,268 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:55:29,269 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 127 [2022-03-15 21:55:29,781 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:29,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140451632] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:55:29,781 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:55:29,781 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2022-03-15 21:55:29,782 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [277688302] [2022-03-15 21:55:29,782 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:55:29,783 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:55:29,790 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 21:55:29,790 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:55:34,075 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 40 new interpolants: [94953#(and (or (<= (+ 3 k) N) (< j M) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))))) (or (<= (+ 2 k) N) (< j M)) (or (<= (+ 3 k) N) (< j M) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) res1))), 94956#(and (or (<= N i) (< (+ 2 k) N) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2) (+ res1 (select (select mult (select A i)) (select B i))))) (or (<= N i) (<= (+ 2 k) N)) (or (<= N i) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2)) (< (+ 2 k) N))), 94944#(and (or (<= N i) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N i) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 94979#(and (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))))))), 94951#(and (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< j M) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ res1 1))) (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< j M) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))))))), 94961#(and (or (<= N (+ i 1)) (< k N) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N (+ i 1)) (< k N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 94954#(and (or (<= N i) (< k N) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N i) (< k N) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1)))), 94946#(and (or (<= N i) (< j M) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N i) (< j M) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 94949#(and (or (not (< k N)) (<= (+ 2 k) N) (< j M) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 1))) (or (not (< k N)) (<= (+ 2 k) N) (< j M) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2)))), 94972#(and (or (<= N (+ 2 i)) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N (+ 2 i)) (< res2 (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))), 94950#(and (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ res1 1))) (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))))))), 94970#(and (or (< (+ j 1) M) (<= N i) (< (+ 2 k) N) (not (< j M)) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j))) (+ res1 (select (select mult (select A i)) (select B i))))) (or (< (+ j 1) M) (<= N i) (< (+ 2 k) N) (not (< j M)) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j))))) (or (< (+ j 1) M) (<= N i) (<= (+ 2 k) N) (not (< j M)))), 94948#(and (or (<= (+ k 1) N) (< j M) (< res2 (+ res1 1))) (or (<= res1 res2) (<= (+ k 1) N) (< j M))), 94973#(and (or (<= N (+ 2 i)) (< k N) (< res2 (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N (+ 2 i)) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2) (< k N))), 94983#(and (or (<= N (+ 2 i)) (<= (+ 2 j) N) (<= (+ 3 M) N)) (or (<= N (+ 2 i)) (< j M) (< (+ 2 k) N) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2))) (or (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (<= N (+ 2 i)) (< j M) (< (+ 2 k) N)) (or (<= N (+ 2 i)) (= (+ (* (- 1) k) M) 0))), 94977#(and (or (<= N (+ 2 i)) (< j M) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2) (< k N)) (or (<= N (+ 2 i)) (< j M) (< k N) (< res2 (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))), 94971#(and (or (<= N (+ i 1)) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (< (+ j 1) M) (< (+ 2 k) N) (not (< j M))) (or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 k) N) (not (< j M)) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j))))) (or (<= N (+ i 1)) (< (+ j 1) M) (<= (+ 2 k) N) (not (< j M)))), 94959#(and (or (<= N i) (< j M) (< (+ 2 k) N) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2) (+ res1 (select (select mult (select A i)) (select B i))))) (or (<= N i) (<= (+ 2 k) N) (< j M)) (or (<= N i) (< j M) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2)) (< (+ 2 k) N))), 94967#(and (or (<= N (+ i 1)) (< j M) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (< (+ 2 k) N)) (or (<= N (+ i 1)) (<= (+ 2 k) N) (< j M)) (or (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2)) (<= N (+ i 1)) (< j M) (< (+ 2 k) N))), 94965#(and (or (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (<= N (+ i 1)) (<= (+ 2 k) N) (< j M)) (or (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (<= N (+ i 1)) (<= (+ 2 k) N) (< j M))), 94976#(and (or (<= N (+ 2 i)) (< j M) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N (+ 2 i)) (< j M) (< res2 (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))), 94978#(and (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)))), 94963#(and (or (<= N (+ i 1)) (< j M) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N (+ i 1)) (< j M) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))), 94968#(and (or (<= (+ 3 k) N) (< (+ j 1) M) (not (< (+ k 1) N)) (not (< j M)) (< (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))) (select (select mult (select A j)) (select B j))) (+ res1 1))) (or (<= (+ 3 k) N) (< (+ j 1) M) (not (< (+ k 1) N)) (not (< j M)) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))) (select (select mult (select A j)) (select B j)))))), 94947#(and (or (not (< k N)) (<= (+ 2 k) N) (< (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 1))) (or (not (< k N)) (<= (+ 2 k) N) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2)))), 94964#(and (or (<= N (+ i 1)) (< j M) (< k N) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N (+ i 1)) (< j M) (< k N) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))), 94957#(and (or (<= N i) (< j M) (< k N) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (<= N i) (< j M) (< k N) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 94945#(and (or (<= res1 res2) (< j M)) (or (< j M) (< res2 (+ res1 1)))), 94960#(and (or (<= N (+ i 1)) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2)) (or (<= N (+ i 1)) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1)))), 94962#(and (or (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (<= N (+ i 1)) (<= (+ 2 k) N)) (or (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (<= N (+ i 1)) (<= (+ 2 k) N))), 94980#(and (or (<= N (+ 2 i)) (< (+ j 1) M) (< (+ 2 k) N) (not (< j M)) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j))))) (or (<= N (+ 2 i)) (< (+ j 1) M) (<= (+ 2 k) N) (not (< j M))) (or (<= N (+ 2 i)) (< (+ j 1) M) (< (+ 2 k) N) (not (< j M)) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))))), 94981#(and (or (= (+ (* (- 1) k) M) 0) (<= N i)) (or (<= N i) (<= (+ 2 j) N) (<= (+ 3 M) N)) (or (<= N i) (< j M) (< (+ 2 k) N) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2) (+ res1 (select (select mult (select A i)) (select B i))))) (or (<= N i) (< j M) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2)) (< (+ 2 k) N))), 94982#(and (or (<= N (+ i 1)) (< j M) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (< (+ 2 k) N)) (or (<= N (+ i 1)) (<= (+ 2 j) N) (<= (+ 3 M) N)) (or (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2)) (<= N (+ i 1)) (< j M) (< (+ 2 k) N)) (or (<= N (+ i 1)) (= (+ (* (- 1) k) M) 0))), 94969#(and (or (<= (+ 3 k) N) (< (+ j 1) M) (not (< j M)) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))) (select (select mult (select A j)) (select B j))))) (or (<= (+ 3 k) N) (< (+ j 1) M) (not (< j M)) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))) (select (select mult (select A j)) (select B j))) res1)) (or (< (+ j 1) M) (<= (+ 2 k) N) (not (< j M)))), 94955#(and (or (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (<= N i) (<= (+ 2 k) N)) (or (<= N i) (<= (+ 2 k) N) (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 (select (select mult (select A i)) (select B i)))))), 94952#(and (or (<= (+ 2 k) N) (< j M) (<= (+ (select (select mult (select A k)) (select B k)) res2) res1)) (or (<= (+ 2 k) N) (< j M) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2)))), 94974#(and (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)))), 94975#(and (or (<= N (+ 2 i)) (<= (+ 2 k) N)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1)))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ k 1))) (select B (+ k 1))))))), 94966#(and (or (<= N (+ i 1)) (<= (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (< (+ 2 k) N)) (or (<= N (+ i 1)) (<= (+ 2 k) N)) (or (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A (+ (- 1) N))) (select B (+ (- 1) N))) (select (select mult (select A k)) (select B k)) res2)) (<= N (+ i 1)) (< (+ 2 k) N))), 94958#(and (or (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (<= N i) (<= (+ 2 k) N) (< j M)) (or (<= N i) (<= (+ 2 k) N) (< j M) (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 (select (select mult (select A i)) (select B i))))))] [2022-03-15 21:55:34,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 21:55:34,075 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:55:34,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 21:55:34,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=3662, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 21:55:34,076 INFO L87 Difference]: Start difference. First operand 3979 states and 18238 transitions. Second operand has 51 states, 50 states have (on average 2.8) internal successors, (140), 50 states have internal predecessors, (140), 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) [2022-03-15 21:57:29,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:57:29,266 INFO L93 Difference]: Finished difference Result 8642 states and 32388 transitions. [2022-03-15 21:57:29,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 575 states. [2022-03-15 21:57:29,266 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.8) internal successors, (140), 50 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:57:29,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:57:29,285 INFO L225 Difference]: With dead ends: 8642 [2022-03-15 21:57:29,285 INFO L226 Difference]: Without dead ends: 8563 [2022-03-15 21:57:29,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 34 SyntacticMatches, 9 SemanticMatches, 614 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165946 ImplicationChecksByTransitivity, 111.9s TimeCoverageRelationStatistics Valid=46763, Invalid=332077, Unknown=0, NotChecked=0, Total=378840 [2022-03-15 21:57:29,300 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2013 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 5216 mSolverCounterSat, 762 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2013 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 762 IncrementalHoareTripleChecker+Valid, 5216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:57:29,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2013 Valid, 0 Invalid, 5978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [762 Valid, 5216 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-03-15 21:57:29,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8563 states. [2022-03-15 21:57:29,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8563 to 4270. [2022-03-15 21:57:29,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4270 states, 4269 states have (on average 4.580229561958304) internal successors, (19553), 4269 states have internal predecessors, (19553), 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) [2022-03-15 21:57:29,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4270 states to 4270 states and 19553 transitions. [2022-03-15 21:57:29,437 INFO L78 Accepts]: Start accepts. Automaton has 4270 states and 19553 transitions. Word has length 17 [2022-03-15 21:57:29,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:57:29,437 INFO L470 AbstractCegarLoop]: Abstraction has 4270 states and 19553 transitions. [2022-03-15 21:57:29,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.8) internal successors, (140), 50 states have internal predecessors, (140), 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) [2022-03-15 21:57:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 4270 states and 19553 transitions. [2022-03-15 21:57:29,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:57:29,446 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:57:29,446 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:57:29,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 21:57:29,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-15 21:57:29,659 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:57:29,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:57:29,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1936452164, now seen corresponding path program 12 times [2022-03-15 21:57:29,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:57:29,660 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222539296] [2022-03-15 21:57:29,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:57:29,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:57:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:57:29,796 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:57:29,796 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:57:29,796 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222539296] [2022-03-15 21:57:29,796 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222539296] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:57:29,796 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162281143] [2022-03-15 21:57:29,796 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:57:29,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:57:29,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:57:29,797 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:57:29,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 21:57:29,824 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 21:57:29,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:57:29,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 21:57:29,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:57:31,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:57:31,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:57:31,999 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:57:32,000 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 77 [2022-03-15 21:57:32,025 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:57:32,026 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 113 [2022-03-15 21:57:32,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:57:32,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:57:32,040 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:57:32,040 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 133 [2022-03-15 21:57:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:57:35,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:57:39,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:57:39,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:57:39,259 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:57:39,260 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 136 treesize of output 225 [2022-03-15 21:57:39,366 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:57:39,366 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 270 [2022-03-15 21:57:39,380 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:57:39,383 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:57:39,449 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:57:39,450 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 246 treesize of output 286 [2022-03-15 22:00:53,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:00:53,852 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162281143] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:00:53,852 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:00:53,852 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-03-15 22:00:53,852 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1603972529] [2022-03-15 22:00:53,853 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:00:53,854 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:00:53,861 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 163 transitions. [2022-03-15 22:00:53,861 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:00:55,727 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [113397#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j))))) (or (< (+ j 1) M) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j))) (+ res1 (select (select mult (select A i)) (select B i)))) (not (< j M)))), 113408#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))))) (or (< (+ j 1) M) (not (< j M)) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j)))))), 113401#(and (or (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (< j M)) (or (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (< j M))), 113390#(and (or (<= res1 res2) (< j M)) (or (< j M) (< res2 (+ res1 1)))), 113393#(and (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))), 113406#(and (or (< j M) (< res2 (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (< j M) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 113395#(and (or (< j M) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))) (or (< j M) (<= (+ res1 (select (select mult (select A i)) (select B i))) res2))), 113398#(and (or (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j))) res1) (<= (+ 3 j) M) (<= M (+ j 1))) (or (<= (+ 3 j) M) (<= M (+ j 1)) (<= res1 (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j)))))), 113407#(and (or (< j M) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2))) (or (< j M) (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))))), 113402#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))))) (or (< (+ j 1) M) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A j)) (select B j)))) (not (< j M)))), 113394#(and (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))))), 113409#(and (or (not (< (+ j 1) M)) (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j)))) (< (+ 2 j) M)) (or (not (< (+ j 1) M)) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)))) (< (+ 2 j) M))), 113396#(and (or (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (< j M)) (or (< j M) (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 (select (select mult (select A i)) (select B i)))))), 113403#(and (or (not (< (+ j 1) M)) (< (+ 2 j) M) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j))) (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))))) (or (not (< (+ j 1) M)) (< (+ 2 j) M) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j)))))), 113391#(and (<= (+ res1 (select (select mult (select A i)) (select B i))) res2) (< res2 (+ res1 (select (select mult (select A i)) (select B i)) 1))), 113400#(and (or (< j M) (< res2 (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))) (or (< j M) (<= (+ (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2))), 113392#(and (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ res1 (select (select mult (select A i)) (select B i))))), 113405#(and (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2)) (<= (+ (select (select mult (select A k)) (select B k)) res2) (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))))), 113404#(and (<= (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i))) res2) (< res2 (+ (select (select mult (select A (+ 2 i))) (select B (+ 2 i))) (select (select mult (select A (+ i 1))) (select B (+ i 1))) res1 (select (select mult (select A i)) (select B i)) 1))), 113399#(and (or (not (< (+ j 1) M)) (< (+ 2 j) M) (<= (+ res1 (select (select mult (select A i)) (select B i))) (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j))))) (or (not (< (+ j 1) M)) (<= (+ (select (select mult (select A k)) (select B k)) res2 (select (select mult (select A (+ j 1))) (select B (+ j 1))) (select (select mult (select A j)) (select B j))) (+ res1 (select (select mult (select A i)) (select B i)))) (< (+ 2 j) M)))] [2022-03-15 22:00:55,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 22:00:55,728 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:00:55,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 22:00:55,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1754, Unknown=3, NotChecked=0, Total=1892 [2022-03-15 22:00:55,728 INFO L87 Difference]: Start difference. First operand 4270 states and 19553 transitions. Second operand has 30 states, 29 states have (on average 3.3793103448275863) internal successors, (98), 29 states have internal predecessors, (98), 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) [2022-03-15 22:01:02,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:02,645 INFO L93 Difference]: Finished difference Result 6376 states and 25651 transitions. [2022-03-15 22:01:02,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-03-15 22:01:02,646 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.3793103448275863) internal successors, (98), 29 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:01:02,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:02,661 INFO L225 Difference]: With dead ends: 6376 [2022-03-15 22:01:02,661 INFO L226 Difference]: Without dead ends: 6322 [2022-03-15 22:01:02,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 47 SyntacticMatches, 13 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2570 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=1120, Invalid=9589, Unknown=3, NotChecked=0, Total=10712 [2022-03-15 22:01:02,663 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 320 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 2659 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 2659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:01:02,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 0 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 2659 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 22:01:02,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6322 states. [2022-03-15 22:01:02,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6322 to 4560. [2022-03-15 22:01:02,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4560 states, 4559 states have (on average 4.558455801710902) internal successors, (20782), 4559 states have internal predecessors, (20782), 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) [2022-03-15 22:01:02,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4560 states to 4560 states and 20782 transitions. [2022-03-15 22:01:02,820 INFO L78 Accepts]: Start accepts. Automaton has 4560 states and 20782 transitions. Word has length 17 [2022-03-15 22:01:02,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:02,820 INFO L470 AbstractCegarLoop]: Abstraction has 4560 states and 20782 transitions. [2022-03-15 22:01:02,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.3793103448275863) internal successors, (98), 29 states have internal predecessors, (98), 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) [2022-03-15 22:01:02,820 INFO L276 IsEmpty]: Start isEmpty. Operand 4560 states and 20782 transitions. [2022-03-15 22:01:02,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:01:02,830 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:02,830 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:02,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 22:01:03,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-03-15 22:01:03,048 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:01:03,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:03,048 INFO L85 PathProgramCache]: Analyzing trace with hash 710964548, now seen corresponding path program 13 times [2022-03-15 22:01:03,049 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:03,049 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129021934] [2022-03-15 22:01:03,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:03,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:03,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:03,341 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:03,341 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129021934] [2022-03-15 22:01:03,341 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129021934] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:01:03,341 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203949470] [2022-03-15 22:01:03,341 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:01:03,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:03,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:03,343 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:01:03,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 22:01:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:03,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:01:03,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:01:03,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:01:03,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:01:03,542 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:01:03,542 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 63 [2022-03-15 22:01:03,568 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:01:03,569 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 115 [2022-03-15 22:01:03,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:01:03,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:01:03,577 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:01:03,577 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 117 [2022-03-15 22:01:03,669 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:01:03,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:01:03,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:03,902 INFO L353 Elim1Store]: treesize reduction 38, result has 73.0 percent of original size [2022-03-15 22:01:03,903 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 72 treesize of output 157 [2022-03-15 22:01:03,982 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:01:03,982 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 268 [2022-03-15 22:01:03,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:03,996 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:03,996 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:03,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:01:04,029 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:01:04,029 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 256 treesize of output 274 Received shutdown request... [2022-03-15 22:01:50,264 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-03-15 22:01:50,266 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 22:01:50,280 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:01:50,280 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:01:50,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 22:01:50,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:01:50,479 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 18 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 3ms.. [2022-03-15 22:01:50,481 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 22:01:50,481 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 22:01:50,481 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 22:01:50,482 INFO L732 BasicCegarLoop]: Path program histogram: [13, 9, 1, 1, 1] [2022-03-15 22:01:50,486 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 22:01:50,486 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 22:01:50,497 INFO L202 PluginConnector]: Adding new model dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 10:01:50 BasicIcfg [2022-03-15 22:01:50,498 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 22:01:50,498 INFO L158 Benchmark]: Toolchain (without parser) took 859631.66ms. Allocated memory was 213.9MB in the beginning and 780.1MB in the end (delta: 566.2MB). Free memory was 178.0MB in the beginning and 561.1MB in the end (delta: -383.1MB). Peak memory consumption was 592.1MB. Max. memory is 8.0GB. [2022-03-15 22:01:50,498 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 213.9MB. Free memory is still 179.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:01:50,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.44ms. Allocated memory is still 213.9MB. Free memory was 177.9MB in the beginning and 176.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 22:01:50,498 INFO L158 Benchmark]: Boogie Preprocessor took 10.81ms. Allocated memory is still 213.9MB. Free memory was 176.4MB in the beginning and 175.5MB in the end (delta: 945.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:01:50,498 INFO L158 Benchmark]: RCFGBuilder took 193.59ms. Allocated memory is still 213.9MB. Free memory was 175.4MB in the beginning and 166.2MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-03-15 22:01:50,498 INFO L158 Benchmark]: TraceAbstraction took 859406.59ms. Allocated memory was 213.9MB in the beginning and 780.1MB in the end (delta: 566.2MB). Free memory was 165.6MB in the beginning and 561.1MB in the end (delta: -395.5MB). Peak memory consumption was 579.6MB. Max. memory is 8.0GB. [2022-03-15 22:01:50,499 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.09ms. Allocated memory is still 213.9MB. Free memory is still 179.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.44ms. Allocated memory is still 213.9MB. Free memory was 177.9MB in the beginning and 176.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 10.81ms. Allocated memory is still 213.9MB. Free memory was 176.4MB in the beginning and 175.5MB in the end (delta: 945.0kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 193.59ms. Allocated memory is still 213.9MB. Free memory was 175.4MB in the beginning and 166.2MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 859406.59ms. Allocated memory was 213.9MB in the beginning and 780.1MB in the end (delta: 566.2MB). Free memory was 165.6MB in the beginning and 561.1MB in the end (delta: -395.5MB). Peak memory consumption was 579.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 39 PlacesBefore, 25 PlacesAfterwards, 32 TransitionsBefore, 18 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 2 FixpointIterations, 6 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 190 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 183, positive: 181, positive conditional: 0, positive unconditional: 181, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 105, positive: 104, positive conditional: 0, positive unconditional: 104, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 183, positive: 77, positive conditional: 0, positive unconditional: 77, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 105, unknown conditional: 0, unknown unconditional: 105] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 0, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - 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: 61]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 18 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 3ms.. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 18 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 3ms.. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 18 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 3ms.. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 18 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 3ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 48 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 859.3s, OverallIterations: 25, TraceHistogramMax: 4, PathProgramHistogramMax: 13, EmptinessCheckTime: 0.1s, AutomataDifference: 203.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10005 SdHoareTripleChecker+Valid, 16.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10005 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 14.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7334 mSDsCounter, 3841 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27446 IncrementalHoareTripleChecker+Invalid, 31287 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3841 mSolverCounterUnsat, 0 mSDtfsCounter, 27446 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3690 GetRequests, 877 SyntacticMatches, 127 SemanticMatches, 2686 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265400 ImplicationChecksByTransitivity, 215.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4560occurred in iteration=24, InterpolantAutomatonStates: 2164, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 26461 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 567.5s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 947 ConstructedInterpolants, 10 QuantifiedInterpolants, 12698 SizeOfPredicates, 96 NumberOfNonLiveVariables, 1357 ConjunctsInSsa, 296 ConjunctsInUnsatCore, 66 InterpolantComputations, 3 PerfectInterpolantSequences, 152/446 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