/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/bitvector/byte_add_1-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 17:27:45,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 17:27:45,565 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 17:27:45,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 17:27:45,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 17:27:45,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 17:27:45,593 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 17:27:45,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 17:27:45,594 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 17:27:45,594 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 17:27:45,594 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 17:27:45,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 17:27:45,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 17:27:45,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 17:27:45,596 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 17:27:45,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 17:27:45,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 17:27:45,597 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 17:27:45,597 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 17:27:45,597 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 17:27:45,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 17:27:45,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 17:27:45,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 17:27:45,604 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 17:27:45,604 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 17:27:45,605 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 17:27:45,605 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 17:27:45,605 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 17:27:45,605 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 17:27:45,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 17:27:45,606 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 17:27:45,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 17:27:45,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 17:27:45,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 17:27:45,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 17:27:45,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 17:27:45,608 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 17:27:45,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 17:27:45,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 17:27:45,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 17:27:45,613 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 17:27:45,613 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 17:27:45,613 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 17:27:45,614 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 17:27:45,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 17:27:45,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 17:27:45,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 17:27:45,852 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 17:27:45,853 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 17:27:45,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/byte_add_1-1.i [2023-12-15 17:27:47,032 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 17:27:47,226 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 17:27:47,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_1-1.i [2023-12-15 17:27:47,234 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2db25e2ff/4af753ad23b44034a060acae0293737f/FLAG585c44092 [2023-12-15 17:27:47,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2db25e2ff/4af753ad23b44034a060acae0293737f [2023-12-15 17:27:47,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 17:27:47,250 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 17:27:47,251 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 17:27:47,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 17:27:47,257 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 17:27:47,257 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:27:47" (1/1) ... [2023-12-15 17:27:47,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ec0d775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:27:47, skipping insertion in model container [2023-12-15 17:27:47,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:27:47" (1/1) ... [2023-12-15 17:27:47,287 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 17:27:47,421 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_1-1.i[1168,1181] [2023-12-15 17:27:47,462 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 17:27:47,475 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 17:27:47,485 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_1-1.i[1168,1181] [2023-12-15 17:27:47,503 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 17:27:47,515 INFO L206 MainTranslator]: Completed translation [2023-12-15 17:27:47,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:27:47 WrapperNode [2023-12-15 17:27:47,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 17:27:47,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 17:27:47,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 17:27:47,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 17:27:47,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:27:47" (1/1) ... [2023-12-15 17:27:47,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:27:47" (1/1) ... [2023-12-15 17:27:47,574 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 151 [2023-12-15 17:27:47,574 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 17:27:47,575 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 17:27:47,575 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 17:27:47,575 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 17:27:47,585 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:27:47" (1/1) ... [2023-12-15 17:27:47,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:27:47" (1/1) ... [2023-12-15 17:27:47,588 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:27:47" (1/1) ... [2023-12-15 17:27:47,604 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 17:27:47,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:27:47" (1/1) ... [2023-12-15 17:27:47,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:27:47" (1/1) ... [2023-12-15 17:27:47,610 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:27:47" (1/1) ... [2023-12-15 17:27:47,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:27:47" (1/1) ... [2023-12-15 17:27:47,615 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:27:47" (1/1) ... [2023-12-15 17:27:47,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:27:47" (1/1) ... [2023-12-15 17:27:47,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 17:27:47,620 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 17:27:47,620 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 17:27:47,620 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 17:27:47,621 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:27:47" (1/1) ... [2023-12-15 17:27:47,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 17:27:47,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:27:47,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 17:27:47,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 17:27:47,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 17:27:47,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 17:27:47,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 17:27:47,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 17:27:47,771 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 17:27:47,773 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 17:27:48,108 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 17:27:48,142 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 17:27:48,142 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-15 17:27:48,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:27:48 BoogieIcfgContainer [2023-12-15 17:27:48,143 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 17:27:48,144 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 17:27:48,145 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 17:27:48,147 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 17:27:48,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 05:27:47" (1/3) ... [2023-12-15 17:27:48,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412fefec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 05:27:48, skipping insertion in model container [2023-12-15 17:27:48,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:27:47" (2/3) ... [2023-12-15 17:27:48,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412fefec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 05:27:48, skipping insertion in model container [2023-12-15 17:27:48,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:27:48" (3/3) ... [2023-12-15 17:27:48,150 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2023-12-15 17:27:48,165 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 17:27:48,165 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 17:27:48,215 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 17:27:48,221 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3f2bea71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 17:27:48,222 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 17:27:48,227 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 42 states have (on average 1.880952380952381) internal successors, (79), 43 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:48,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-15 17:27:48,253 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:27:48,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:27:48,257 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:27:48,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:27:48,269 INFO L85 PathProgramCache]: Analyzing trace with hash -701051337, now seen corresponding path program 1 times [2023-12-15 17:27:48,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:27:48,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446602384] [2023-12-15 17:27:48,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:27:48,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:27:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:27:48,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 17:27:48,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:27:48,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446602384] [2023-12-15 17:27:48,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446602384] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:27:48,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 17:27:48,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 17:27:48,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361183870] [2023-12-15 17:27:48,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:27:48,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 17:27:48,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:27:48,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 17:27:48,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 17:27:48,516 INFO L87 Difference]: Start difference. First operand has 44 states, 42 states have (on average 1.880952380952381) internal successors, (79), 43 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:48,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:27:48,555 INFO L93 Difference]: Finished difference Result 62 states and 109 transitions. [2023-12-15 17:27:48,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 17:27:48,557 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 [2023-12-15 17:27:48,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:27:48,564 INFO L225 Difference]: With dead ends: 62 [2023-12-15 17:27:48,564 INFO L226 Difference]: Without dead ends: 42 [2023-12-15 17:27:48,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 17:27:48,569 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 17:27:48,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 17:27:48,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-15 17:27:48,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-12-15 17:27:48,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 41 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:48,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 74 transitions. [2023-12-15 17:27:48,600 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 74 transitions. Word has length 13 [2023-12-15 17:27:48,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:27:48,600 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 74 transitions. [2023-12-15 17:27:48,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:48,600 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 74 transitions. [2023-12-15 17:27:48,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-15 17:27:48,601 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:27:48,601 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:27:48,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 17:27:48,602 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:27:48,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:27:48,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1267888409, now seen corresponding path program 1 times [2023-12-15 17:27:48,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:27:48,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185199848] [2023-12-15 17:27:48,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:27:48,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:27:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:27:48,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 17:27:48,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:27:48,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185199848] [2023-12-15 17:27:48,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185199848] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:27:48,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 17:27:48,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 17:27:48,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102055379] [2023-12-15 17:27:48,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:27:48,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 17:27:48,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:27:48,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 17:27:48,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 17:27:48,773 INFO L87 Difference]: Start difference. First operand 42 states and 74 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:48,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:27:48,927 INFO L93 Difference]: Finished difference Result 98 states and 177 transitions. [2023-12-15 17:27:48,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 17:27:48,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 [2023-12-15 17:27:48,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:27:48,930 INFO L225 Difference]: With dead ends: 98 [2023-12-15 17:27:48,930 INFO L226 Difference]: Without dead ends: 65 [2023-12-15 17:27:48,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 17:27:48,932 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 24 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 17:27:48,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 76 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 17:27:48,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-15 17:27:48,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2023-12-15 17:27:48,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.596774193548387) internal successors, (99), 62 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:48,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 99 transitions. [2023-12-15 17:27:48,946 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 99 transitions. Word has length 13 [2023-12-15 17:27:48,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:27:48,947 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 99 transitions. [2023-12-15 17:27:48,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:48,947 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 99 transitions. [2023-12-15 17:27:48,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-15 17:27:48,948 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:27:48,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:27:48,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 17:27:48,948 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:27:48,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:27:48,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1612037902, now seen corresponding path program 1 times [2023-12-15 17:27:48,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:27:48,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862439261] [2023-12-15 17:27:48,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:27:48,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:27:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:27:49,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 17:27:49,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:27:49,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862439261] [2023-12-15 17:27:49,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862439261] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:27:49,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 17:27:49,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 17:27:49,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375876063] [2023-12-15 17:27:49,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:27:49,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 17:27:49,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:27:49,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 17:27:49,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 17:27:49,115 INFO L87 Difference]: Start difference. First operand 63 states and 99 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:49,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:27:49,357 INFO L93 Difference]: Finished difference Result 155 states and 270 transitions. [2023-12-15 17:27:49,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 17:27:49,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-15 17:27:49,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:27:49,361 INFO L225 Difference]: With dead ends: 155 [2023-12-15 17:27:49,361 INFO L226 Difference]: Without dead ends: 122 [2023-12-15 17:27:49,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 17:27:49,365 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 92 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 17:27:49,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 99 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 17:27:49,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-15 17:27:49,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 86. [2023-12-15 17:27:49,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.576470588235294) internal successors, (134), 85 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:49,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 134 transitions. [2023-12-15 17:27:49,376 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 134 transitions. Word has length 19 [2023-12-15 17:27:49,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:27:49,376 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 134 transitions. [2023-12-15 17:27:49,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:49,376 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 134 transitions. [2023-12-15 17:27:49,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-15 17:27:49,377 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:27:49,377 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:27:49,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 17:27:49,378 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:27:49,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:27:49,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1944328577, now seen corresponding path program 1 times [2023-12-15 17:27:49,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:27:49,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981055322] [2023-12-15 17:27:49,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:27:49,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:27:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:27:49,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-15 17:27:49,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:27:49,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981055322] [2023-12-15 17:27:49,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981055322] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:27:49,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 17:27:49,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 17:27:49,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158399910] [2023-12-15 17:27:49,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:27:49,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 17:27:49,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:27:49,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 17:27:49,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 17:27:49,556 INFO L87 Difference]: Start difference. First operand 86 states and 134 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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) [2023-12-15 17:27:49,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:27:49,735 INFO L93 Difference]: Finished difference Result 247 states and 380 transitions. [2023-12-15 17:27:49,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 17:27:49,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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 25 [2023-12-15 17:27:49,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:27:49,739 INFO L225 Difference]: With dead ends: 247 [2023-12-15 17:27:49,739 INFO L226 Difference]: Without dead ends: 173 [2023-12-15 17:27:49,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 17:27:49,748 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 94 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 17:27:49,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 198 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 17:27:49,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-12-15 17:27:49,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 94. [2023-12-15 17:27:49,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.5376344086021505) internal successors, (143), 93 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:49,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 143 transitions. [2023-12-15 17:27:49,769 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 143 transitions. Word has length 25 [2023-12-15 17:27:49,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:27:49,769 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 143 transitions. [2023-12-15 17:27:49,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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) [2023-12-15 17:27:49,770 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 143 transitions. [2023-12-15 17:27:49,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-15 17:27:49,771 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:27:49,771 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:27:49,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 17:27:49,772 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:27:49,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:27:49,772 INFO L85 PathProgramCache]: Analyzing trace with hash 889628198, now seen corresponding path program 1 times [2023-12-15 17:27:49,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:27:49,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995318753] [2023-12-15 17:27:49,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:27:49,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:27:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:27:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-15 17:27:49,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:27:49,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995318753] [2023-12-15 17:27:49,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995318753] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:27:49,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 17:27:49,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 17:27:49,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146214287] [2023-12-15 17:27:49,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:27:49,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 17:27:49,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:27:49,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 17:27:49,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 17:27:49,917 INFO L87 Difference]: Start difference. First operand 94 states and 143 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:50,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:27:50,064 INFO L93 Difference]: Finished difference Result 268 states and 406 transitions. [2023-12-15 17:27:50,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 17:27:50,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-15 17:27:50,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:27:50,065 INFO L225 Difference]: With dead ends: 268 [2023-12-15 17:27:50,066 INFO L226 Difference]: Without dead ends: 193 [2023-12-15 17:27:50,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 17:27:50,067 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 98 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 17:27:50,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 206 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 17:27:50,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-12-15 17:27:50,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 104. [2023-12-15 17:27:50,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.5145631067961165) internal successors, (156), 103 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 156 transitions. [2023-12-15 17:27:50,074 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 156 transitions. Word has length 26 [2023-12-15 17:27:50,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:27:50,074 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 156 transitions. [2023-12-15 17:27:50,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:50,075 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 156 transitions. [2023-12-15 17:27:50,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-15 17:27:50,078 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:27:50,078 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:27:50,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 17:27:50,079 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:27:50,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:27:50,080 INFO L85 PathProgramCache]: Analyzing trace with hash -449843762, now seen corresponding path program 1 times [2023-12-15 17:27:50,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:27:50,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378112562] [2023-12-15 17:27:50,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:27:50,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:27:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:27:50,187 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 17:27:50,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:27:50,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378112562] [2023-12-15 17:27:50,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378112562] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:27:50,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071834429] [2023-12-15 17:27:50,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:27:50,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:27:50,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:27:50,194 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 17:27:50,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 17:27:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:27:50,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-15 17:27:50,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:27:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-15 17:27:50,349 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 17:27:50,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071834429] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:27:50,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 17:27:50,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-12-15 17:27:50,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911020589] [2023-12-15 17:27:50,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:27:50,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 17:27:50,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:27:50,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 17:27:50,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-15 17:27:50,352 INFO L87 Difference]: Start difference. First operand 104 states and 156 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:50,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:27:50,521 INFO L93 Difference]: Finished difference Result 221 states and 354 transitions. [2023-12-15 17:27:50,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 17:27:50,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-15 17:27:50,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:27:50,527 INFO L225 Difference]: With dead ends: 221 [2023-12-15 17:27:50,528 INFO L226 Difference]: Without dead ends: 149 [2023-12-15 17:27:50,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-15 17:27:50,530 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 37 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 17:27:50,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 134 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 17:27:50,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-12-15 17:27:50,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 133. [2023-12-15 17:27:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.446969696969697) internal successors, (191), 132 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:50,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2023-12-15 17:27:50,547 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 27 [2023-12-15 17:27:50,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:27:50,547 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 191 transitions. [2023-12-15 17:27:50,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:50,548 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 191 transitions. [2023-12-15 17:27:50,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-15 17:27:50,549 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:27:50,550 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:27:50,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 17:27:50,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-15 17:27:50,755 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:27:50,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:27:50,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1572960125, now seen corresponding path program 1 times [2023-12-15 17:27:50,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:27:50,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665656275] [2023-12-15 17:27:50,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:27:50,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:27:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:27:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 17:27:50,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:27:50,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665656275] [2023-12-15 17:27:50,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665656275] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:27:50,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591687031] [2023-12-15 17:27:50,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:27:50,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:27:50,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:27:50,867 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 17:27:50,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 17:27:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:27:50,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-15 17:27:50,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:27:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-15 17:27:50,951 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 17:27:50,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591687031] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:27:50,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 17:27:50,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2023-12-15 17:27:50,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330673750] [2023-12-15 17:27:50,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:27:50,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 17:27:50,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:27:50,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 17:27:50,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-15 17:27:50,952 INFO L87 Difference]: Start difference. First operand 133 states and 191 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:51,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:27:51,221 INFO L93 Difference]: Finished difference Result 525 states and 771 transitions. [2023-12-15 17:27:51,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 17:27:51,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-12-15 17:27:51,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:27:51,223 INFO L225 Difference]: With dead ends: 525 [2023-12-15 17:27:51,223 INFO L226 Difference]: Without dead ends: 396 [2023-12-15 17:27:51,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-15 17:27:51,224 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 176 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 17:27:51,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 356 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 17:27:51,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2023-12-15 17:27:51,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 303. [2023-12-15 17:27:51,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 1.4105960264900663) internal successors, (426), 302 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 426 transitions. [2023-12-15 17:27:51,235 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 426 transitions. Word has length 33 [2023-12-15 17:27:51,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:27:51,236 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 426 transitions. [2023-12-15 17:27:51,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:51,236 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 426 transitions. [2023-12-15 17:27:51,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-15 17:27:51,237 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:27:51,237 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:27:51,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 17:27:51,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-15 17:27:51,442 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:27:51,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:27:51,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1205786005, now seen corresponding path program 1 times [2023-12-15 17:27:51,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:27:51,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003055033] [2023-12-15 17:27:51,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:27:51,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:27:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:27:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 17:27:51,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:27:51,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003055033] [2023-12-15 17:27:51,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003055033] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:27:51,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141616244] [2023-12-15 17:27:51,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:27:51,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:27:51,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:27:51,588 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 17:27:51,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-15 17:27:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:27:51,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-15 17:27:51,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:27:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-15 17:27:51,677 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 17:27:51,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141616244] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:27:51,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 17:27:51,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-12-15 17:27:51,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227805662] [2023-12-15 17:27:51,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:27:51,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 17:27:51,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:27:51,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 17:27:51,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 17:27:51,679 INFO L87 Difference]: Start difference. First operand 303 states and 426 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:51,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:27:51,851 INFO L93 Difference]: Finished difference Result 709 states and 1033 transitions. [2023-12-15 17:27:51,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 17:27:51,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-15 17:27:51,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:27:51,854 INFO L225 Difference]: With dead ends: 709 [2023-12-15 17:27:51,854 INFO L226 Difference]: Without dead ends: 433 [2023-12-15 17:27:51,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 17:27:51,855 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 36 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 17:27:51,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 134 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 17:27:51,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2023-12-15 17:27:51,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 361. [2023-12-15 17:27:51,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 1.3777777777777778) internal successors, (496), 360 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:51,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 496 transitions. [2023-12-15 17:27:51,870 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 496 transitions. Word has length 34 [2023-12-15 17:27:51,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:27:51,873 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 496 transitions. [2023-12-15 17:27:51,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:51,873 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 496 transitions. [2023-12-15 17:27:51,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-15 17:27:51,874 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:27:51,874 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:27:51,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 17:27:52,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:27:52,079 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:27:52,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:27:52,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1759920966, now seen corresponding path program 1 times [2023-12-15 17:27:52,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:27:52,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207316832] [2023-12-15 17:27:52,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:27:52,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:27:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:27:52,202 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-15 17:27:52,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:27:52,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207316832] [2023-12-15 17:27:52,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207316832] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:27:52,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 17:27:52,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 17:27:52,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043673364] [2023-12-15 17:27:52,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:27:52,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 17:27:52,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:27:52,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 17:27:52,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 17:27:52,204 INFO L87 Difference]: Start difference. First operand 361 states and 496 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:52,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:27:52,486 INFO L93 Difference]: Finished difference Result 1438 states and 1956 transitions. [2023-12-15 17:27:52,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 17:27:52,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-12-15 17:27:52,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:27:52,490 INFO L225 Difference]: With dead ends: 1438 [2023-12-15 17:27:52,490 INFO L226 Difference]: Without dead ends: 1110 [2023-12-15 17:27:52,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 17:27:52,491 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 199 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 17:27:52,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 401 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 17:27:52,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2023-12-15 17:27:52,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 361. [2023-12-15 17:27:52,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 1.3777777777777778) internal successors, (496), 360 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 496 transitions. [2023-12-15 17:27:52,512 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 496 transitions. Word has length 40 [2023-12-15 17:27:52,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:27:52,512 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 496 transitions. [2023-12-15 17:27:52,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:52,512 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 496 transitions. [2023-12-15 17:27:52,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-15 17:27:52,513 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:27:52,513 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:27:52,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 17:27:52,513 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:27:52,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:27:52,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1087520423, now seen corresponding path program 1 times [2023-12-15 17:27:52,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:27:52,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096708031] [2023-12-15 17:27:52,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:27:52,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:27:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:27:52,627 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-15 17:27:52,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:27:52,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096708031] [2023-12-15 17:27:52,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096708031] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:27:52,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 17:27:52,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 17:27:52,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012017119] [2023-12-15 17:27:52,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:27:52,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 17:27:52,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:27:52,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 17:27:52,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 17:27:52,629 INFO L87 Difference]: Start difference. First operand 361 states and 496 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:53,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:27:53,017 INFO L93 Difference]: Finished difference Result 749 states and 1024 transitions. [2023-12-15 17:27:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 17:27:53,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-12-15 17:27:53,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:27:53,019 INFO L225 Difference]: With dead ends: 749 [2023-12-15 17:27:53,019 INFO L226 Difference]: Without dead ends: 614 [2023-12-15 17:27:53,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-15 17:27:53,020 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 284 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 17:27:53,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 621 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 17:27:53,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2023-12-15 17:27:53,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 372. [2023-12-15 17:27:53,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 1.3692722371967656) internal successors, (508), 371 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:53,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 508 transitions. [2023-12-15 17:27:53,038 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 508 transitions. Word has length 41 [2023-12-15 17:27:53,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:27:53,038 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 508 transitions. [2023-12-15 17:27:53,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:53,039 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 508 transitions. [2023-12-15 17:27:53,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-15 17:27:53,039 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:27:53,039 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:27:53,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 17:27:53,040 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:27:53,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:27:53,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1156462875, now seen corresponding path program 1 times [2023-12-15 17:27:53,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:27:53,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086861000] [2023-12-15 17:27:53,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:27:53,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:27:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:27:53,160 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-15 17:27:53,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:27:53,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086861000] [2023-12-15 17:27:53,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086861000] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:27:53,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 17:27:53,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 17:27:53,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625866111] [2023-12-15 17:27:53,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:27:53,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 17:27:53,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:27:53,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 17:27:53,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 17:27:53,162 INFO L87 Difference]: Start difference. First operand 372 states and 508 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:53,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:27:53,184 INFO L93 Difference]: Finished difference Result 722 states and 983 transitions. [2023-12-15 17:27:53,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 17:27:53,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-12-15 17:27:53,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:27:53,186 INFO L225 Difference]: With dead ends: 722 [2023-12-15 17:27:53,186 INFO L226 Difference]: Without dead ends: 352 [2023-12-15 17:27:53,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 17:27:53,187 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 65 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 17:27:53,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 67 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 17:27:53,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2023-12-15 17:27:53,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2023-12-15 17:27:53,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 1.358974358974359) internal successors, (477), 351 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 477 transitions. [2023-12-15 17:27:53,203 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 477 transitions. Word has length 41 [2023-12-15 17:27:53,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:27:53,204 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 477 transitions. [2023-12-15 17:27:53,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 477 transitions. [2023-12-15 17:27:53,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-15 17:27:53,204 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:27:53,205 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:27:53,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 17:27:53,205 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:27:53,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:27:53,205 INFO L85 PathProgramCache]: Analyzing trace with hash -49999210, now seen corresponding path program 1 times [2023-12-15 17:27:53,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:27:53,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608682794] [2023-12-15 17:27:53,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:27:53,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:27:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:27:53,257 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-15 17:27:53,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:27:53,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608682794] [2023-12-15 17:27:53,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608682794] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:27:53,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 17:27:53,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 17:27:53,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717805900] [2023-12-15 17:27:53,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:27:53,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 17:27:53,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:27:53,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 17:27:53,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 17:27:53,259 INFO L87 Difference]: Start difference. First operand 352 states and 477 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:27:53,285 INFO L93 Difference]: Finished difference Result 492 states and 654 transitions. [2023-12-15 17:27:53,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 17:27:53,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-12-15 17:27:53,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:27:53,287 INFO L225 Difference]: With dead ends: 492 [2023-12-15 17:27:53,287 INFO L226 Difference]: Without dead ends: 449 [2023-12-15 17:27:53,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 17:27:53,288 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 4 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 17:27:53,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 130 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 17:27:53,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2023-12-15 17:27:53,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 437. [2023-12-15 17:27:53,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 1.3211009174311927) internal successors, (576), 436 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:53,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 576 transitions. [2023-12-15 17:27:53,312 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 576 transitions. Word has length 46 [2023-12-15 17:27:53,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:27:53,312 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 576 transitions. [2023-12-15 17:27:53,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:53,312 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 576 transitions. [2023-12-15 17:27:53,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-15 17:27:53,313 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:27:53,313 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:27:53,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 17:27:53,313 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:27:53,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:27:53,314 INFO L85 PathProgramCache]: Analyzing trace with hash 224760404, now seen corresponding path program 1 times [2023-12-15 17:27:53,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:27:53,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106645256] [2023-12-15 17:27:53,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:27:53,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:27:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:27:53,440 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-15 17:27:53,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:27:53,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106645256] [2023-12-15 17:27:53,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106645256] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:27:53,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719509008] [2023-12-15 17:27:53,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:27:53,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:27:53,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:27:53,442 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 17:27:53,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-15 17:27:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:27:53,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-15 17:27:53,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:27:53,535 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-15 17:27:53,535 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 17:27:53,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719509008] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:27:53,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 17:27:53,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2023-12-15 17:27:53,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891350984] [2023-12-15 17:27:53,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:27:53,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 17:27:53,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:27:53,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 17:27:53,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 17:27:53,537 INFO L87 Difference]: Start difference. First operand 437 states and 576 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:53,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:27:53,626 INFO L93 Difference]: Finished difference Result 976 states and 1299 transitions. [2023-12-15 17:27:53,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 17:27:53,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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 46 [2023-12-15 17:27:53,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:27:53,628 INFO L225 Difference]: With dead ends: 976 [2023-12-15 17:27:53,628 INFO L226 Difference]: Without dead ends: 479 [2023-12-15 17:27:53,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-15 17:27:53,629 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 63 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 17:27:53,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 66 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 17:27:53,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2023-12-15 17:27:53,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 389. [2023-12-15 17:27:53,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 1.2860824742268042) internal successors, (499), 388 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:53,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 499 transitions. [2023-12-15 17:27:53,646 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 499 transitions. Word has length 46 [2023-12-15 17:27:53,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:27:53,647 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 499 transitions. [2023-12-15 17:27:53,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:53,647 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 499 transitions. [2023-12-15 17:27:53,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-15 17:27:53,648 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:27:53,648 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:27:53,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-15 17:27:53,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:27:53,852 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:27:53,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:27:53,853 INFO L85 PathProgramCache]: Analyzing trace with hash 315293426, now seen corresponding path program 1 times [2023-12-15 17:27:53,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:27:53,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127127179] [2023-12-15 17:27:53,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:27:53,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:27:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:27:54,034 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-15 17:27:54,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:27:54,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127127179] [2023-12-15 17:27:54,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127127179] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:27:54,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 17:27:54,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 17:27:54,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35921604] [2023-12-15 17:27:54,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:27:54,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 17:27:54,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:27:54,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 17:27:54,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-15 17:27:54,035 INFO L87 Difference]: Start difference. First operand 389 states and 499 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:54,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:27:54,138 INFO L93 Difference]: Finished difference Result 1193 states and 1522 transitions. [2023-12-15 17:27:54,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 17:27:54,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2023-12-15 17:27:54,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:27:54,141 INFO L225 Difference]: With dead ends: 1193 [2023-12-15 17:27:54,142 INFO L226 Difference]: Without dead ends: 830 [2023-12-15 17:27:54,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-15 17:27:54,143 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 160 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 17:27:54,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 155 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 17:27:54,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2023-12-15 17:27:54,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 587. [2023-12-15 17:27:54,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 586 states have (on average 1.2781569965870307) internal successors, (749), 586 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:54,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 749 transitions. [2023-12-15 17:27:54,169 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 749 transitions. Word has length 67 [2023-12-15 17:27:54,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:27:54,169 INFO L495 AbstractCegarLoop]: Abstraction has 587 states and 749 transitions. [2023-12-15 17:27:54,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:54,169 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 749 transitions. [2023-12-15 17:27:54,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-15 17:27:54,170 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:27:54,170 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:27:54,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 17:27:54,170 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:27:54,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:27:54,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1310614836, now seen corresponding path program 1 times [2023-12-15 17:27:54,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:27:54,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357238956] [2023-12-15 17:27:54,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:27:54,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:27:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:27:54,547 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 17:27:54,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:27:54,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357238956] [2023-12-15 17:27:54,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357238956] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:27:54,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700467985] [2023-12-15 17:27:54,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:27:54,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:27:54,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:27:54,549 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 17:27:54,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-15 17:27:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:27:54,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-15 17:27:54,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:27:54,803 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 31 proven. 28 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-15 17:27:54,803 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 17:27:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-15 17:27:55,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700467985] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 17:27:55,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 17:27:55,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 20 [2023-12-15 17:27:55,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777967645] [2023-12-15 17:27:55,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 17:27:55,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-15 17:27:55,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:27:55,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-15 17:27:55,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2023-12-15 17:27:55,044 INFO L87 Difference]: Start difference. First operand 587 states and 749 transitions. Second operand has 21 states, 21 states have (on average 7.9523809523809526) internal successors, (167), 20 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:58,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:27:58,342 INFO L93 Difference]: Finished difference Result 2268 states and 2894 transitions. [2023-12-15 17:27:58,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2023-12-15 17:27:58,343 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.9523809523809526) internal successors, (167), 20 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2023-12-15 17:27:58,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:27:58,350 INFO L225 Difference]: With dead ends: 2268 [2023-12-15 17:27:58,350 INFO L226 Difference]: Without dead ends: 2260 [2023-12-15 17:27:58,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2477 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1883, Invalid=7047, Unknown=0, NotChecked=0, Total=8930 [2023-12-15 17:27:58,354 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 818 mSDsluCounter, 1801 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 1929 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-15 17:27:58,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 1929 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-15 17:27:58,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2023-12-15 17:27:58,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 981. [2023-12-15 17:27:58,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 1.3081632653061224) internal successors, (1282), 980 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:58,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1282 transitions. [2023-12-15 17:27:58,412 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1282 transitions. Word has length 67 [2023-12-15 17:27:58,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:27:58,413 INFO L495 AbstractCegarLoop]: Abstraction has 981 states and 1282 transitions. [2023-12-15 17:27:58,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.9523809523809526) internal successors, (167), 20 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:58,413 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1282 transitions. [2023-12-15 17:27:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-15 17:27:58,414 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:27:58,414 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:27:58,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-15 17:27:58,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-15 17:27:58,620 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:27:58,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:27:58,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1049730223, now seen corresponding path program 1 times [2023-12-15 17:27:58,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:27:58,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989739919] [2023-12-15 17:27:58,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:27:58,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:27:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:27:58,839 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-15 17:27:58,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:27:58,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989739919] [2023-12-15 17:27:58,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989739919] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:27:58,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 17:27:58,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 17:27:58,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24985652] [2023-12-15 17:27:58,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:27:58,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 17:27:58,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:27:58,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 17:27:58,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 17:27:58,841 INFO L87 Difference]: Start difference. First operand 981 states and 1282 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:59,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:27:59,327 INFO L93 Difference]: Finished difference Result 2278 states and 3001 transitions. [2023-12-15 17:27:59,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 17:27:59,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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 69 [2023-12-15 17:27:59,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:27:59,334 INFO L225 Difference]: With dead ends: 2278 [2023-12-15 17:27:59,334 INFO L226 Difference]: Without dead ends: 1673 [2023-12-15 17:27:59,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-15 17:27:59,335 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 307 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 17:27:59,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 554 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 17:27:59,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2023-12-15 17:27:59,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 977. [2023-12-15 17:27:59,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.3094262295081966) internal successors, (1278), 976 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1278 transitions. [2023-12-15 17:27:59,399 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1278 transitions. Word has length 69 [2023-12-15 17:27:59,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:27:59,400 INFO L495 AbstractCegarLoop]: Abstraction has 977 states and 1278 transitions. [2023-12-15 17:27:59,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:27:59,400 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1278 transitions. [2023-12-15 17:27:59,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-15 17:27:59,401 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:27:59,401 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:27:59,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 17:27:59,401 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:27:59,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:27:59,402 INFO L85 PathProgramCache]: Analyzing trace with hash -667674692, now seen corresponding path program 1 times [2023-12-15 17:27:59,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:27:59,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493497933] [2023-12-15 17:27:59,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:27:59,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:27:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:27:59,585 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-15 17:27:59,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:27:59,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493497933] [2023-12-15 17:27:59,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493497933] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:27:59,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931050202] [2023-12-15 17:27:59,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:27:59,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:27:59,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:27:59,587 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 17:27:59,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-15 17:27:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:27:59,785 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-15 17:27:59,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:27:59,867 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-15 17:27:59,868 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 17:28:00,047 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 52 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-15 17:28:00,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931050202] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 17:28:00,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 17:28:00,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 16 [2023-12-15 17:28:00,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565460165] [2023-12-15 17:28:00,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 17:28:00,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-15 17:28:00,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:28:00,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-15 17:28:00,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2023-12-15 17:28:00,049 INFO L87 Difference]: Start difference. First operand 977 states and 1278 transitions. Second operand has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:28:00,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:28:00,986 INFO L93 Difference]: Finished difference Result 3069 states and 4034 transitions. [2023-12-15 17:28:00,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-15 17:28:00,986 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2023-12-15 17:28:00,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:28:00,993 INFO L225 Difference]: With dead ends: 3069 [2023-12-15 17:28:00,993 INFO L226 Difference]: Without dead ends: 2061 [2023-12-15 17:28:00,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702 [2023-12-15 17:28:00,996 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 716 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 17:28:00,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 556 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-15 17:28:00,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2061 states. [2023-12-15 17:28:01,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2061 to 1687. [2023-12-15 17:28:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1687 states, 1686 states have (on average 1.2965599051008303) internal successors, (2186), 1686 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:28:01,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2186 transitions. [2023-12-15 17:28:01,103 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 2186 transitions. Word has length 71 [2023-12-15 17:28:01,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:28:01,105 INFO L495 AbstractCegarLoop]: Abstraction has 1687 states and 2186 transitions. [2023-12-15 17:28:01,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:28:01,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2186 transitions. [2023-12-15 17:28:01,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-15 17:28:01,110 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:28:01,110 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:28:01,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-15 17:28:01,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-15 17:28:01,316 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:28:01,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:28:01,316 INFO L85 PathProgramCache]: Analyzing trace with hash 64292734, now seen corresponding path program 1 times [2023-12-15 17:28:01,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:28:01,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452231117] [2023-12-15 17:28:01,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:28:01,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:28:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:28:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-15 17:28:01,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:28:01,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452231117] [2023-12-15 17:28:01,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452231117] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:28:01,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620019776] [2023-12-15 17:28:01,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:28:01,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:28:01,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:28:01,654 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 17:28:01,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-15 17:28:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:28:01,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-15 17:28:01,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:28:02,098 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-15 17:28:02,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 17:28:02,205 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 21 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-15 17:28:02,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620019776] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 17:28:02,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 17:28:02,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-12-15 17:28:02,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637528255] [2023-12-15 17:28:02,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 17:28:02,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 17:28:02,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:28:02,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 17:28:02,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-12-15 17:28:02,207 INFO L87 Difference]: Start difference. First operand 1687 states and 2186 transitions. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:28:02,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:28:02,618 INFO L93 Difference]: Finished difference Result 3460 states and 4436 transitions. [2023-12-15 17:28:02,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 17:28:02,619 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 11 states have internal predecessors, (113), 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 71 [2023-12-15 17:28:02,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:28:02,624 INFO L225 Difference]: With dead ends: 3460 [2023-12-15 17:28:02,624 INFO L226 Difference]: Without dead ends: 1845 [2023-12-15 17:28:02,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2023-12-15 17:28:02,627 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 232 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 17:28:02,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 554 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 17:28:02,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2023-12-15 17:28:02,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1377. [2023-12-15 17:28:02,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1376 states have (on average 1.273982558139535) internal successors, (1753), 1376 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:28:02,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1753 transitions. [2023-12-15 17:28:02,747 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1753 transitions. Word has length 71 [2023-12-15 17:28:02,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:28:02,748 INFO L495 AbstractCegarLoop]: Abstraction has 1377 states and 1753 transitions. [2023-12-15 17:28:02,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:28:02,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1753 transitions. [2023-12-15 17:28:02,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-15 17:28:02,750 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:28:02,750 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:28:02,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-15 17:28:02,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:28:02,957 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:28:02,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:28:02,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1987520768, now seen corresponding path program 2 times [2023-12-15 17:28:02,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:28:02,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449774271] [2023-12-15 17:28:02,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:28:02,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:28:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:28:03,515 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 15 proven. 56 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-15 17:28:03,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:28:03,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449774271] [2023-12-15 17:28:03,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449774271] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:28:03,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996127684] [2023-12-15 17:28:03,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 17:28:03,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:28:03,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:28:03,517 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 17:28:03,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-15 17:28:03,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-15 17:28:03,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 17:28:03,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-15 17:28:03,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:28:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 27 proven. 42 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-15 17:28:04,331 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 17:28:05,218 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 25 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-15 17:28:05,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996127684] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 17:28:05,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 17:28:05,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 9] total 27 [2023-12-15 17:28:05,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043462124] [2023-12-15 17:28:05,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 17:28:05,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-15 17:28:05,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:28:05,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-15 17:28:05,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2023-12-15 17:28:05,223 INFO L87 Difference]: Start difference. First operand 1377 states and 1753 transitions. Second operand has 27 states, 27 states have (on average 7.037037037037037) internal successors, (190), 27 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:28:16,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:28:16,745 INFO L93 Difference]: Finished difference Result 9708 states and 11992 transitions. [2023-12-15 17:28:16,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2023-12-15 17:28:16,746 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 7.037037037037037) internal successors, (190), 27 states have internal predecessors, (190), 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 71 [2023-12-15 17:28:16,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:28:16,771 INFO L225 Difference]: With dead ends: 9708 [2023-12-15 17:28:16,771 INFO L226 Difference]: Without dead ends: 9702 [2023-12-15 17:28:16,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6828 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=3353, Invalid=17239, Unknown=0, NotChecked=0, Total=20592 [2023-12-15 17:28:16,778 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 1946 mSDsluCounter, 2254 mSDsCounter, 0 mSdLazyCounter, 1935 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1946 SdHoareTripleChecker+Valid, 2464 SdHoareTripleChecker+Invalid, 2035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-15 17:28:16,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1946 Valid, 2464 Invalid, 2035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1935 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-15 17:28:16,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9702 states. [2023-12-15 17:28:17,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9702 to 2897. [2023-12-15 17:28:17,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2897 states, 2896 states have (on average 1.298342541436464) internal successors, (3760), 2896 states have internal predecessors, (3760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:28:17,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2897 states to 2897 states and 3760 transitions. [2023-12-15 17:28:17,049 INFO L78 Accepts]: Start accepts. Automaton has 2897 states and 3760 transitions. Word has length 71 [2023-12-15 17:28:17,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:28:17,050 INFO L495 AbstractCegarLoop]: Abstraction has 2897 states and 3760 transitions. [2023-12-15 17:28:17,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.037037037037037) internal successors, (190), 27 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:28:17,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 3760 transitions. [2023-12-15 17:28:17,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-15 17:28:17,052 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:28:17,052 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:28:17,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-15 17:28:17,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:28:17,258 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:28:17,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:28:17,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1484894367, now seen corresponding path program 1 times [2023-12-15 17:28:17,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:28:17,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342818897] [2023-12-15 17:28:17,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:28:17,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:28:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:28:17,872 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 4 proven. 69 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-15 17:28:17,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:28:17,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342818897] [2023-12-15 17:28:17,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342818897] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:28:17,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275054975] [2023-12-15 17:28:17,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:28:17,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:28:17,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:28:17,874 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 17:28:17,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-15 17:28:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:28:18,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-15 17:28:18,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:28:18,811 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-15 17:28:18,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 17:28:18,936 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-15 17:28:18,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275054975] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 17:28:18,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 17:28:18,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 21 [2023-12-15 17:28:18,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068326609] [2023-12-15 17:28:18,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 17:28:18,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-15 17:28:18,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:28:18,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-15 17:28:18,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2023-12-15 17:28:18,939 INFO L87 Difference]: Start difference. First operand 2897 states and 3760 transitions. Second operand has 22 states, 22 states have (on average 7.0) internal successors, (154), 21 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:28:20,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:28:20,151 INFO L93 Difference]: Finished difference Result 7031 states and 9070 transitions. [2023-12-15 17:28:20,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-15 17:28:20,152 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.0) internal successors, (154), 21 states have internal predecessors, (154), 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 72 [2023-12-15 17:28:20,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:28:20,164 INFO L225 Difference]: With dead ends: 7031 [2023-12-15 17:28:20,164 INFO L226 Difference]: Without dead ends: 4502 [2023-12-15 17:28:20,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=345, Invalid=1137, Unknown=0, NotChecked=0, Total=1482 [2023-12-15 17:28:20,168 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 478 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 17:28:20,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1282 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 17:28:20,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4502 states. [2023-12-15 17:28:20,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4502 to 3049. [2023-12-15 17:28:20,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3049 states, 3048 states have (on average 1.3162729658792651) internal successors, (4012), 3048 states have internal predecessors, (4012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:28:20,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3049 states to 3049 states and 4012 transitions. [2023-12-15 17:28:20,424 INFO L78 Accepts]: Start accepts. Automaton has 3049 states and 4012 transitions. Word has length 72 [2023-12-15 17:28:20,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:28:20,425 INFO L495 AbstractCegarLoop]: Abstraction has 3049 states and 4012 transitions. [2023-12-15 17:28:20,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.0) internal successors, (154), 21 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:28:20,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3049 states and 4012 transitions. [2023-12-15 17:28:20,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-15 17:28:20,427 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:28:20,427 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:28:20,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-15 17:28:20,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:28:20,633 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:28:20,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:28:20,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1960049728, now seen corresponding path program 1 times [2023-12-15 17:28:20,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:28:20,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233410882] [2023-12-15 17:28:20,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:28:20,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:28:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:28:21,340 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 28 proven. 53 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-15 17:28:21,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:28:21,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233410882] [2023-12-15 17:28:21,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233410882] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:28:21,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782281084] [2023-12-15 17:28:21,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:28:21,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:28:21,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:28:21,345 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 17:28:21,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-15 17:28:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:28:21,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 17:28:21,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:28:21,778 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-12-15 17:28:21,778 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 17:28:21,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782281084] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:28:21,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 17:28:21,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 15 [2023-12-15 17:28:21,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370816319] [2023-12-15 17:28:21,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:28:21,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 17:28:21,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:28:21,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 17:28:21,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-12-15 17:28:21,779 INFO L87 Difference]: Start difference. First operand 3049 states and 4012 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:28:21,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:28:21,996 INFO L93 Difference]: Finished difference Result 3068 states and 4036 transitions. [2023-12-15 17:28:21,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 17:28:21,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2023-12-15 17:28:21,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:28:22,003 INFO L225 Difference]: With dead ends: 3068 [2023-12-15 17:28:22,003 INFO L226 Difference]: Without dead ends: 3064 [2023-12-15 17:28:22,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2023-12-15 17:28:22,004 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 10 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 17:28:22,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 153 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 17:28:22,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3064 states. [2023-12-15 17:28:22,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3064 to 3055. [2023-12-15 17:28:22,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3055 states, 3054 states have (on average 1.3159790438768828) internal successors, (4019), 3054 states have internal predecessors, (4019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:28:22,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3055 states to 3055 states and 4019 transitions. [2023-12-15 17:28:22,189 INFO L78 Accepts]: Start accepts. Automaton has 3055 states and 4019 transitions. Word has length 72 [2023-12-15 17:28:22,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:28:22,189 INFO L495 AbstractCegarLoop]: Abstraction has 3055 states and 4019 transitions. [2023-12-15 17:28:22,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:28:22,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3055 states and 4019 transitions. [2023-12-15 17:28:22,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-15 17:28:22,191 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:28:22,192 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:28:22,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-15 17:28:22,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-12-15 17:28:22,397 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:28:22,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:28:22,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1510466783, now seen corresponding path program 1 times [2023-12-15 17:28:22,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:28:22,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964237240] [2023-12-15 17:28:22,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:28:22,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:28:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:28:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 37 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-15 17:28:22,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:28:22,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964237240] [2023-12-15 17:28:22,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964237240] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:28:22,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603177144] [2023-12-15 17:28:22,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:28:22,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:28:22,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:28:22,572 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 17:28:22,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-15 17:28:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:28:22,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-15 17:28:22,657 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:28:22,924 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 42 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-15 17:28:22,924 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 17:28:23,105 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-15 17:28:23,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603177144] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 17:28:23,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 17:28:23,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 15 [2023-12-15 17:28:23,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224115977] [2023-12-15 17:28:23,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 17:28:23,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-15 17:28:23,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:28:23,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-15 17:28:23,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-12-15 17:28:23,106 INFO L87 Difference]: Start difference. First operand 3055 states and 4019 transitions. Second operand has 15 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 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) [2023-12-15 17:28:24,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:28:24,013 INFO L93 Difference]: Finished difference Result 7364 states and 9469 transitions. [2023-12-15 17:28:24,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 17:28:24,013 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 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 72 [2023-12-15 17:28:24,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:28:24,021 INFO L225 Difference]: With dead ends: 7364 [2023-12-15 17:28:24,021 INFO L226 Difference]: Without dead ends: 7360 [2023-12-15 17:28:24,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 131 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2023-12-15 17:28:24,022 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 627 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 17:28:24,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 531 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 17:28:24,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7360 states. [2023-12-15 17:28:24,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7360 to 4097. [2023-12-15 17:28:24,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4097 states, 4096 states have (on average 1.3671875) internal successors, (5600), 4096 states have internal predecessors, (5600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:28:24,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 5600 transitions. [2023-12-15 17:28:24,334 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 5600 transitions. Word has length 72 [2023-12-15 17:28:24,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:28:24,335 INFO L495 AbstractCegarLoop]: Abstraction has 4097 states and 5600 transitions. [2023-12-15 17:28:24,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 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) [2023-12-15 17:28:24,335 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 5600 transitions. [2023-12-15 17:28:24,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-15 17:28:24,337 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:28:24,337 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:28:24,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-15 17:28:24,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-12-15 17:28:24,542 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:28:24,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:28:24,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1510407201, now seen corresponding path program 1 times [2023-12-15 17:28:24,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:28:24,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015769747] [2023-12-15 17:28:24,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:28:24,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:28:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:28:24,874 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 60 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-15 17:28:24,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:28:24,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015769747] [2023-12-15 17:28:24,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015769747] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:28:24,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079033787] [2023-12-15 17:28:24,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:28:24,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:28:24,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:28:24,877 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 17:28:24,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-15 17:28:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:28:25,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-15 17:28:25,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:28:25,345 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 17:28:25,345 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 17:28:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 17:28:25,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079033787] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 17:28:25,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 17:28:25,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2023-12-15 17:28:25,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808125431] [2023-12-15 17:28:25,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 17:28:25,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-15 17:28:25,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:28:25,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-15 17:28:25,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2023-12-15 17:28:25,562 INFO L87 Difference]: Start difference. First operand 4097 states and 5600 transitions. Second operand has 23 states, 23 states have (on average 8.304347826086957) internal successors, (191), 22 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:28:27,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:28:27,004 INFO L93 Difference]: Finished difference Result 7653 states and 10201 transitions. [2023-12-15 17:28:27,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-15 17:28:27,004 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.304347826086957) internal successors, (191), 22 states have internal predecessors, (191), 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 72 [2023-12-15 17:28:27,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:28:27,016 INFO L225 Difference]: With dead ends: 7653 [2023-12-15 17:28:27,016 INFO L226 Difference]: Without dead ends: 7635 [2023-12-15 17:28:27,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=609, Invalid=1841, Unknown=0, NotChecked=0, Total=2450 [2023-12-15 17:28:27,019 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 433 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 17:28:27,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1364 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 17:28:27,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7635 states. [2023-12-15 17:28:27,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7635 to 4227. [2023-12-15 17:28:27,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4227 states, 4226 states have (on average 1.369380028395646) internal successors, (5787), 4226 states have internal predecessors, (5787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:28:27,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4227 states to 4227 states and 5787 transitions. [2023-12-15 17:28:27,382 INFO L78 Accepts]: Start accepts. Automaton has 4227 states and 5787 transitions. Word has length 72 [2023-12-15 17:28:27,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:28:27,382 INFO L495 AbstractCegarLoop]: Abstraction has 4227 states and 5787 transitions. [2023-12-15 17:28:27,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.304347826086957) internal successors, (191), 22 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:28:27,382 INFO L276 IsEmpty]: Start isEmpty. Operand 4227 states and 5787 transitions. [2023-12-15 17:28:27,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-15 17:28:27,384 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:28:27,384 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:28:27,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-15 17:28:27,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-12-15 17:28:27,590 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:28:27,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:28:27,591 INFO L85 PathProgramCache]: Analyzing trace with hash 633292127, now seen corresponding path program 1 times [2023-12-15 17:28:27,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:28:27,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555877075] [2023-12-15 17:28:27,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:28:27,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:28:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 17:28:27,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 17:28:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 17:28:27,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 17:28:27,730 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 17:28:27,731 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 17:28:27,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-15 17:28:27,737 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:28:27,740 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 17:28:27,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 05:28:27 BoogieIcfgContainer [2023-12-15 17:28:27,814 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 17:28:27,814 INFO L158 Benchmark]: Toolchain (without parser) took 40564.23ms. Allocated memory was 274.7MB in the beginning and 685.8MB in the end (delta: 411.0MB). Free memory was 224.6MB in the beginning and 445.8MB in the end (delta: -221.1MB). Peak memory consumption was 190.3MB. Max. memory is 8.0GB. [2023-12-15 17:28:27,815 INFO L158 Benchmark]: CDTParser took 0.63ms. Allocated memory is still 184.5MB. Free memory was 135.2MB in the beginning and 135.0MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 17:28:27,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.71ms. Allocated memory is still 274.7MB. Free memory was 224.6MB in the beginning and 211.4MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 17:28:27,815 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.90ms. Allocated memory is still 274.7MB. Free memory was 211.0MB in the beginning and 208.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 17:28:27,816 INFO L158 Benchmark]: Boogie Preprocessor took 44.85ms. Allocated memory is still 274.7MB. Free memory was 208.2MB in the beginning and 205.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 17:28:27,816 INFO L158 Benchmark]: RCFGBuilder took 522.64ms. Allocated memory is still 274.7MB. Free memory was 205.1MB in the beginning and 183.4MB in the end (delta: 21.7MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-15 17:28:27,818 INFO L158 Benchmark]: TraceAbstraction took 39669.32ms. Allocated memory was 274.7MB in the beginning and 685.8MB in the end (delta: 411.0MB). Free memory was 183.0MB in the beginning and 445.8MB in the end (delta: -262.7MB). Peak memory consumption was 149.4MB. Max. memory is 8.0GB. [2023-12-15 17:28:27,821 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.63ms. Allocated memory is still 184.5MB. Free memory was 135.2MB in the beginning and 135.0MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 268.71ms. Allocated memory is still 274.7MB. Free memory was 224.6MB in the beginning and 211.4MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.90ms. Allocated memory is still 274.7MB. Free memory was 211.0MB in the beginning and 208.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.85ms. Allocated memory is still 274.7MB. Free memory was 208.2MB in the beginning and 205.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 522.64ms. Allocated memory is still 274.7MB. Free memory was 205.1MB in the beginning and 183.4MB in the end (delta: 21.7MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 39669.32ms. Allocated memory was 274.7MB in the beginning and 685.8MB in the end (delta: 411.0MB). Free memory was 183.0MB in the beginning and 445.8MB in the end (delta: -262.7MB). Peak memory consumption was 149.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 25]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 116. Possible FailurePath: [L124] unsigned int a, b, r; [L126] b = __VERIFIER_nondet_uint() [L128] a = 234770789 [L130] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, na=4, nb=4] [L69] COND TRUE b3 == (unsigned char)0 [L70] nb = nb - 1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, na=4, nb=3] [L71] COND TRUE b2 == (unsigned char)0 [L72] nb = nb - 1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, na=4, nb=2] [L73] COND TRUE b1 == (unsigned char)0 [L74] nb = nb - 1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, na=4, nb=1] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=101] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=256] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=1, i=0, na=4, nb=1, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=1, i=1, na=4, nb=1, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L85] COND TRUE i == (unsigned char)1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L89] COND FALSE !(i < nb) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L86] COND TRUE i == (unsigned char)2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L89] COND FALSE !(i < nb) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L87] COND TRUE i == (unsigned char)3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L89] COND FALSE !(i < nb) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) | (r2 << 16U) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; [L130] RET, EXPR mp_add(a, b) [L130] r = mp_add(a, b) [L132] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L25] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.5s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 23.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6899 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6899 mSDsluCounter, 12103 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9726 mSDsCounter, 393 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8677 IncrementalHoareTripleChecker+Invalid, 9070 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 393 mSolverCounterUnsat, 2377 mSDtfsCounter, 8677 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1688 GetRequests, 1215 SyntacticMatches, 14 SemanticMatches, 459 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10456 ImplicationChecksByTransitivity, 13.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4227occurred in iteration=23, InterpolantAutomatonStates: 365, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 19478 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 1889 NumberOfCodeBlocks, 1889 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2270 ConstructedInterpolants, 11 QuantifiedInterpolants, 15576 SizeOfPredicates, 59 NumberOfNonLiveVariables, 2069 ConjunctsInSsa, 184 ConjunctsInUnsatCore, 42 InterpolantComputations, 16 PerfectInterpolantSequences, 1531/2353 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-15 17:28:27,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...