/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/bitvector/byte_add_2-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 00:29:22,728 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 00:29:22,791 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 00:29:22,795 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 00:29:22,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 00:29:22,816 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 00:29:22,816 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 00:29:22,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 00:29:22,817 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 00:29:22,820 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 00:29:22,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 00:29:22,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 00:29:22,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 00:29:22,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 00:29:22,822 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 00:29:22,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 00:29:22,822 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 00:29:22,822 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 00:29:22,822 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 00:29:22,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 00:29:22,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 00:29:22,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 00:29:22,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 00:29:22,824 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 00:29:22,824 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 00:29:22,824 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 00:29:22,824 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 00:29:22,825 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 00:29:22,825 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 00:29:22,825 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 00:29:22,826 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 00:29:22,826 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 00:29:22,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 00:29:22,826 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 00:29:22,826 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 00:29:22,826 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 00:29:22,827 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 00:29:22,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 00:29:22,827 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 00:29:22,827 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 00:29:22,827 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 00:29:22,827 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 00:29:22,827 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 00:29:22,827 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 00:29:23,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 00:29:23,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 00:29:23,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 00:29:23,035 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 00:29:23,035 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 00:29:23,036 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/byte_add_2-2.i [2023-12-16 00:29:24,122 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 00:29:24,301 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 00:29:24,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_2-2.i [2023-12-16 00:29:24,311 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f83c178d6/94a82e6297624d2b9f87e0b7129e3206/FLAG8cf072d63 [2023-12-16 00:29:24,326 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f83c178d6/94a82e6297624d2b9f87e0b7129e3206 [2023-12-16 00:29:24,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 00:29:24,329 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 00:29:24,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 00:29:24,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 00:29:24,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 00:29:24,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:29:24" (1/1) ... [2023-12-16 00:29:24,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21c348a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:29:24, skipping insertion in model container [2023-12-16 00:29:24,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:29:24" (1/1) ... [2023-12-16 00:29:24,363 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 00:29:24,492 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_2-2.i[1168,1181] [2023-12-16 00:29:24,530 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 00:29:24,537 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 00:29:24,545 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_2-2.i[1168,1181] [2023-12-16 00:29:24,565 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 00:29:24,574 INFO L206 MainTranslator]: Completed translation [2023-12-16 00:29:24,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:29:24 WrapperNode [2023-12-16 00:29:24,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 00:29:24,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 00:29:24,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 00:29:24,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 00:29:24,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:29:24" (1/1) ... [2023-12-16 00:29:24,585 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:29:24" (1/1) ... [2023-12-16 00:29:24,608 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 141 [2023-12-16 00:29:24,608 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 00:29:24,608 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 00:29:24,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 00:29:24,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 00:29:24,617 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:29:24" (1/1) ... [2023-12-16 00:29:24,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:29:24" (1/1) ... [2023-12-16 00:29:24,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:29:24" (1/1) ... [2023-12-16 00:29:24,628 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-16 00:29:24,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:29:24" (1/1) ... [2023-12-16 00:29:24,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:29:24" (1/1) ... [2023-12-16 00:29:24,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:29:24" (1/1) ... [2023-12-16 00:29:24,635 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:29:24" (1/1) ... [2023-12-16 00:29:24,636 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:29:24" (1/1) ... [2023-12-16 00:29:24,637 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:29:24" (1/1) ... [2023-12-16 00:29:24,639 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 00:29:24,640 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 00:29:24,640 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 00:29:24,640 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 00:29:24,640 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:29:24" (1/1) ... [2023-12-16 00:29:24,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 00:29:24,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:29:24,683 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 00:29:24,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 00:29:24,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 00:29:24,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 00:29:24,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 00:29:24,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 00:29:24,792 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 00:29:24,794 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 00:29:25,100 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 00:29:25,118 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 00:29:25,119 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 00:29:25,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:29:25 BoogieIcfgContainer [2023-12-16 00:29:25,119 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 00:29:25,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 00:29:25,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 00:29:25,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 00:29:25,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 12:29:24" (1/3) ... [2023-12-16 00:29:25,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6058843a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:29:25, skipping insertion in model container [2023-12-16 00:29:25,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:29:24" (2/3) ... [2023-12-16 00:29:25,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6058843a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:29:25, skipping insertion in model container [2023-12-16 00:29:25,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:29:25" (3/3) ... [2023-12-16 00:29:25,127 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i [2023-12-16 00:29:25,139 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 00:29:25,139 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 00:29:25,170 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 00:29:25,174 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;@7a4fdd4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 00:29:25,175 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 00:29:25,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:25,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 00:29:25,182 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:29:25,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:29:25,183 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:29:25,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:29:25,187 INFO L85 PathProgramCache]: Analyzing trace with hash 459643034, now seen corresponding path program 1 times [2023-12-16 00:29:25,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:29:25,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701817113] [2023-12-16 00:29:25,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:25,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:29:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 00:29:25,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:29:25,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701817113] [2023-12-16 00:29:25,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701817113] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:29:25,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:29:25,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 00:29:25,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227743405] [2023-12-16 00:29:25,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:29:25,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 00:29:25,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:29:25,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 00:29:25,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 00:29:25,336 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:25,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:29:25,356 INFO L93 Difference]: Finished difference Result 50 states and 85 transitions. [2023-12-16 00:29:25,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 00:29:25,358 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-12-16 00:29:25,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:29:25,364 INFO L225 Difference]: With dead ends: 50 [2023-12-16 00:29:25,364 INFO L226 Difference]: Without dead ends: 36 [2023-12-16 00:29:25,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 00:29:25,368 INFO L413 NwaCegarLoop]: 61 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, 61 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-16 00:29:25,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:29:25,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-16 00:29:25,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-12-16 00:29:25,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 35 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 62 transitions. [2023-12-16 00:29:25,394 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 62 transitions. Word has length 10 [2023-12-16 00:29:25,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:29:25,394 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 62 transitions. [2023-12-16 00:29:25,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:25,394 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 62 transitions. [2023-12-16 00:29:25,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 00:29:25,396 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:29:25,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:29:25,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 00:29:25,396 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:29:25,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:29:25,397 INFO L85 PathProgramCache]: Analyzing trace with hash 371044600, now seen corresponding path program 1 times [2023-12-16 00:29:25,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:29:25,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423612469] [2023-12-16 00:29:25,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:25,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:29:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 00:29:25,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:29:25,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423612469] [2023-12-16 00:29:25,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423612469] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:29:25,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:29:25,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 00:29:25,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858766396] [2023-12-16 00:29:25,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:29:25,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 00:29:25,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:29:25,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 00:29:25,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 00:29:25,499 INFO L87 Difference]: Start difference. First operand 36 states and 62 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:25,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:29:25,633 INFO L93 Difference]: Finished difference Result 86 states and 153 transitions. [2023-12-16 00:29:25,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 00:29:25,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-12-16 00:29:25,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:29:25,635 INFO L225 Difference]: With dead ends: 86 [2023-12-16 00:29:25,635 INFO L226 Difference]: Without dead ends: 59 [2023-12-16 00:29:25,636 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-16 00:29:25,637 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 52 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-16 00:29:25,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 52 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 00:29:25,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-16 00:29:25,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2023-12-16 00:29:25,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 56 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:25,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 87 transitions. [2023-12-16 00:29:25,646 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 87 transitions. Word has length 10 [2023-12-16 00:29:25,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:29:25,646 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 87 transitions. [2023-12-16 00:29:25,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:25,646 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 87 transitions. [2023-12-16 00:29:25,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-16 00:29:25,647 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:29:25,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:29:25,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 00:29:25,648 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:29:25,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:29:25,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1656804765, now seen corresponding path program 1 times [2023-12-16 00:29:25,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:29:25,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271631328] [2023-12-16 00:29:25,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:25,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:29:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:25,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 00:29:25,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:29:25,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271631328] [2023-12-16 00:29:25,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271631328] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:29:25,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:29:25,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 00:29:25,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197407870] [2023-12-16 00:29:25,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:29:25,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 00:29:25,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:29:25,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 00:29:25,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 00:29:25,795 INFO L87 Difference]: Start difference. First operand 57 states and 87 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:25,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:29:25,932 INFO L93 Difference]: Finished difference Result 136 states and 212 transitions. [2023-12-16 00:29:25,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 00:29:25,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-16 00:29:25,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:29:25,933 INFO L225 Difference]: With dead ends: 136 [2023-12-16 00:29:25,933 INFO L226 Difference]: Without dead ends: 99 [2023-12-16 00:29:25,933 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-16 00:29:25,937 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 82 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 138 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-16 00:29:25,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 138 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 00:29:25,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-16 00:29:25,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 65. [2023-12-16 00:29:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.5) internal successors, (96), 64 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2023-12-16 00:29:25,945 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 16 [2023-12-16 00:29:25,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:29:25,946 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 96 transitions. [2023-12-16 00:29:25,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:25,946 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 96 transitions. [2023-12-16 00:29:25,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 00:29:25,946 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:29:25,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:29:25,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 00:29:25,947 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:29:25,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:29:25,947 INFO L85 PathProgramCache]: Analyzing trace with hash 662822522, now seen corresponding path program 1 times [2023-12-16 00:29:25,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:29:25,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306109676] [2023-12-16 00:29:25,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:25,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:29:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:26,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 00:29:26,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:29:26,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306109676] [2023-12-16 00:29:26,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306109676] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:29:26,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:29:26,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 00:29:26,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360850098] [2023-12-16 00:29:26,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:29:26,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 00:29:26,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:29:26,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 00:29:26,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 00:29:26,062 INFO L87 Difference]: Start difference. First operand 65 states and 96 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:26,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:29:26,181 INFO L93 Difference]: Finished difference Result 162 states and 244 transitions. [2023-12-16 00:29:26,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 00:29:26,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-16 00:29:26,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:29:26,182 INFO L225 Difference]: With dead ends: 162 [2023-12-16 00:29:26,182 INFO L226 Difference]: Without dead ends: 119 [2023-12-16 00:29:26,183 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-16 00:29:26,184 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 86 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 146 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-16 00:29:26,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 146 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 00:29:26,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-16 00:29:26,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 75. [2023-12-16 00:29:26,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.472972972972973) internal successors, (109), 74 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:26,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2023-12-16 00:29:26,190 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 17 [2023-12-16 00:29:26,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:29:26,190 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2023-12-16 00:29:26,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:26,191 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2023-12-16 00:29:26,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 00:29:26,191 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:29:26,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:29:26,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 00:29:26,192 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:29:26,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:29:26,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1401335308, now seen corresponding path program 1 times [2023-12-16 00:29:26,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:29:26,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321914874] [2023-12-16 00:29:26,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:26,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:29:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:26,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 00:29:26,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:29:26,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321914874] [2023-12-16 00:29:26,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321914874] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:29:26,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110306023] [2023-12-16 00:29:26,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:26,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:29:26,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:29:26,248 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 00:29:26,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 00:29:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:26,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 00:29:26,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:29:26,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 00:29:26,378 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 00:29:26,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110306023] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:29:26,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 00:29:26,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-12-16 00:29:26,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189041042] [2023-12-16 00:29:26,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:29:26,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 00:29:26,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:29:26,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 00:29:26,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 00:29:26,380 INFO L87 Difference]: Start difference. First operand 75 states and 109 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:26,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:29:26,500 INFO L93 Difference]: Finished difference Result 143 states and 234 transitions. [2023-12-16 00:29:26,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 00:29:26,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-16 00:29:26,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:29:26,503 INFO L225 Difference]: With dead ends: 143 [2023-12-16 00:29:26,503 INFO L226 Difference]: Without dead ends: 116 [2023-12-16 00:29:26,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 00:29:26,505 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 46 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 00:29:26,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 63 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 00:29:26,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-16 00:29:26,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2023-12-16 00:29:26,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.402061855670103) internal successors, (136), 97 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:26,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2023-12-16 00:29:26,523 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 18 [2023-12-16 00:29:26,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:29:26,523 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2023-12-16 00:29:26,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2023-12-16 00:29:26,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 00:29:26,524 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:29:26,524 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:29:26,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-16 00:29:26,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:29:26,731 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:29:26,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:29:26,732 INFO L85 PathProgramCache]: Analyzing trace with hash 332112547, now seen corresponding path program 1 times [2023-12-16 00:29:26,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:29:26,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319340843] [2023-12-16 00:29:26,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:26,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:29:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:26,806 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-16 00:29:26,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:29:26,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319340843] [2023-12-16 00:29:26,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319340843] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:29:26,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227255191] [2023-12-16 00:29:26,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:26,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:29:26,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:29:26,808 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 00:29:26,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 00:29:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:26,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 00:29:26,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:29:26,872 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-16 00:29:26,873 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 00:29:26,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227255191] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:29:26,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 00:29:26,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-12-16 00:29:26,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238134346] [2023-12-16 00:29:26,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:29:26,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 00:29:26,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:29:26,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 00:29:26,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 00:29:26,874 INFO L87 Difference]: Start difference. First operand 98 states and 136 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:27,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:29:27,014 INFO L93 Difference]: Finished difference Result 209 states and 310 transitions. [2023-12-16 00:29:27,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 00:29:27,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-16 00:29:27,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:29:27,015 INFO L225 Difference]: With dead ends: 209 [2023-12-16 00:29:27,015 INFO L226 Difference]: Without dead ends: 143 [2023-12-16 00:29:27,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 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-16 00:29:27,016 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 37 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 98 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.1s IncrementalHoareTripleChecker+Time [2023-12-16 00:29:27,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 98 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 00:29:27,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-12-16 00:29:27,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 121. [2023-12-16 00:29:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.3583333333333334) internal successors, (163), 120 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:27,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 163 transitions. [2023-12-16 00:29:27,021 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 163 transitions. Word has length 24 [2023-12-16 00:29:27,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:29:27,021 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 163 transitions. [2023-12-16 00:29:27,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:27,022 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 163 transitions. [2023-12-16 00:29:27,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-16 00:29:27,022 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:29:27,023 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] [2023-12-16 00:29:27,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 00:29:27,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-16 00:29:27,243 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:29:27,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:29:27,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1216719026, now seen corresponding path program 1 times [2023-12-16 00:29:27,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:29:27,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335253656] [2023-12-16 00:29:27,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:27,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:29:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:27,350 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-16 00:29:27,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:29:27,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335253656] [2023-12-16 00:29:27,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335253656] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:29:27,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059094956] [2023-12-16 00:29:27,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:27,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:29:27,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:29:27,366 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 00:29:27,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 00:29:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:27,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 00:29:27,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:29:27,470 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-16 00:29:27,471 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 00:29:27,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059094956] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:29:27,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 00:29:27,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-12-16 00:29:27,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453392575] [2023-12-16 00:29:27,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:29:27,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 00:29:27,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:29:27,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 00:29:27,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 00:29:27,472 INFO L87 Difference]: Start difference. First operand 121 states and 163 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:27,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:29:27,603 INFO L93 Difference]: Finished difference Result 255 states and 362 transitions. [2023-12-16 00:29:27,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 00:29:27,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-12-16 00:29:27,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:29:27,604 INFO L225 Difference]: With dead ends: 255 [2023-12-16 00:29:27,604 INFO L226 Difference]: Without dead ends: 166 [2023-12-16 00:29:27,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 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-16 00:29:27,609 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 36 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 98 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.1s IncrementalHoareTripleChecker+Time [2023-12-16 00:29:27,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 98 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 00:29:27,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-12-16 00:29:27,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 144. [2023-12-16 00:29:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.3286713286713288) internal successors, (190), 143 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-16 00:29:27,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 190 transitions. [2023-12-16 00:29:27,614 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 190 transitions. Word has length 30 [2023-12-16 00:29:27,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:29:27,614 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 190 transitions. [2023-12-16 00:29:27,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:27,614 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 190 transitions. [2023-12-16 00:29:27,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 00:29:27,615 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:29:27,615 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] [2023-12-16 00:29:27,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-16 00:29:27,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:29:27,816 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:29:27,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:29:27,816 INFO L85 PathProgramCache]: Analyzing trace with hash -25271043, now seen corresponding path program 1 times [2023-12-16 00:29:27,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:29:27,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651857191] [2023-12-16 00:29:27,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:27,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:29:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:27,933 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-16 00:29:27,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:29:27,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651857191] [2023-12-16 00:29:27,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651857191] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:29:27,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:29:27,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 00:29:27,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250061090] [2023-12-16 00:29:27,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:29:27,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 00:29:27,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:29:27,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 00:29:27,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 00:29:27,935 INFO L87 Difference]: Start difference. First operand 144 states and 190 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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-16 00:29:28,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:29:28,132 INFO L93 Difference]: Finished difference Result 527 states and 687 transitions. [2023-12-16 00:29:28,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 00:29:28,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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 36 [2023-12-16 00:29:28,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:29:28,133 INFO L225 Difference]: With dead ends: 527 [2023-12-16 00:29:28,133 INFO L226 Difference]: Without dead ends: 412 [2023-12-16 00:29:28,134 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-16 00:29:28,134 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 176 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 281 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-16 00:29:28,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 281 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 00:29:28,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2023-12-16 00:29:28,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 144. [2023-12-16 00:29:28,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.3286713286713288) internal successors, (190), 143 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-16 00:29:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 190 transitions. [2023-12-16 00:29:28,140 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 190 transitions. Word has length 36 [2023-12-16 00:29:28,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:29:28,141 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 190 transitions. [2023-12-16 00:29:28,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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-16 00:29:28,141 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 190 transitions. [2023-12-16 00:29:28,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-16 00:29:28,141 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:29:28,141 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] [2023-12-16 00:29:28,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 00:29:28,142 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:29:28,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:29:28,142 INFO L85 PathProgramCache]: Analyzing trace with hash 503964974, now seen corresponding path program 1 times [2023-12-16 00:29:28,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:29:28,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197452026] [2023-12-16 00:29:28,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:28,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:29:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:28,252 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-16 00:29:28,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:29:28,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197452026] [2023-12-16 00:29:28,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197452026] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:29:28,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:29:28,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 00:29:28,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942271355] [2023-12-16 00:29:28,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:29:28,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 00:29:28,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:29:28,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 00:29:28,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 00:29:28,253 INFO L87 Difference]: Start difference. First operand 144 states and 190 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:28,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:29:28,452 INFO L93 Difference]: Finished difference Result 507 states and 662 transitions. [2023-12-16 00:29:28,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 00:29:28,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-12-16 00:29:28,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:29:28,454 INFO L225 Difference]: With dead ends: 507 [2023-12-16 00:29:28,454 INFO L226 Difference]: Without dead ends: 393 [2023-12-16 00:29:28,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-16 00:29:28,456 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 165 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 00:29:28,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 246 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 00:29:28,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2023-12-16 00:29:28,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 144. [2023-12-16 00:29:28,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.3286713286713288) internal successors, (190), 143 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-16 00:29:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 190 transitions. [2023-12-16 00:29:28,466 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 190 transitions. Word has length 37 [2023-12-16 00:29:28,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:29:28,466 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 190 transitions. [2023-12-16 00:29:28,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:28,466 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 190 transitions. [2023-12-16 00:29:28,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 00:29:28,472 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:29:28,472 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] [2023-12-16 00:29:28,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 00:29:28,472 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:29:28,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:29:28,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1565502776, now seen corresponding path program 1 times [2023-12-16 00:29:28,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:29:28,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128715996] [2023-12-16 00:29:28,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:28,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:29:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:28,613 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-16 00:29:28,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:29:28,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128715996] [2023-12-16 00:29:28,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128715996] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:29:28,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:29:28,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 00:29:28,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177576972] [2023-12-16 00:29:28,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:29:28,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 00:29:28,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:29:28,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 00:29:28,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 00:29:28,615 INFO L87 Difference]: Start difference. First operand 144 states and 190 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:28,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:29:28,916 INFO L93 Difference]: Finished difference Result 637 states and 829 transitions. [2023-12-16 00:29:28,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 00:29:28,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-12-16 00:29:28,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:29:28,918 INFO L225 Difference]: With dead ends: 637 [2023-12-16 00:29:28,918 INFO L226 Difference]: Without dead ends: 523 [2023-12-16 00:29:28,918 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-16 00:29:28,919 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 248 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 417 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-16 00:29:28,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 417 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 00:29:28,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2023-12-16 00:29:28,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 144. [2023-12-16 00:29:28,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.3286713286713288) internal successors, (190), 143 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-16 00:29:28,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 190 transitions. [2023-12-16 00:29:28,927 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 190 transitions. Word has length 38 [2023-12-16 00:29:28,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:29:28,927 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 190 transitions. [2023-12-16 00:29:28,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:28,927 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 190 transitions. [2023-12-16 00:29:28,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 00:29:28,930 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:29:28,930 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] [2023-12-16 00:29:28,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 00:29:28,930 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:29:28,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:29:28,931 INFO L85 PathProgramCache]: Analyzing trace with hash 863902902, now seen corresponding path program 1 times [2023-12-16 00:29:28,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:29:28,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138177875] [2023-12-16 00:29:28,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:28,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:29:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:29,041 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-16 00:29:29,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:29:29,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138177875] [2023-12-16 00:29:29,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138177875] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:29:29,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:29:29,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 00:29:29,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608449070] [2023-12-16 00:29:29,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:29:29,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 00:29:29,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:29:29,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 00:29:29,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 00:29:29,043 INFO L87 Difference]: Start difference. First operand 144 states and 190 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:29,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:29:29,427 INFO L93 Difference]: Finished difference Result 678 states and 880 transitions. [2023-12-16 00:29:29,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 00:29:29,428 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-12-16 00:29:29,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:29:29,429 INFO L225 Difference]: With dead ends: 678 [2023-12-16 00:29:29,429 INFO L226 Difference]: Without dead ends: 563 [2023-12-16 00:29:29,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-16 00:29:29,430 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 355 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 00:29:29,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 591 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 00:29:29,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2023-12-16 00:29:29,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 132. [2023-12-16 00:29:29,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.3129770992366412) internal successors, (172), 131 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:29,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 172 transitions. [2023-12-16 00:29:29,443 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 172 transitions. Word has length 38 [2023-12-16 00:29:29,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:29:29,443 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 172 transitions. [2023-12-16 00:29:29,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:29,443 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 172 transitions. [2023-12-16 00:29:29,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-16 00:29:29,443 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:29:29,443 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] [2023-12-16 00:29:29,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 00:29:29,444 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:29:29,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:29:29,444 INFO L85 PathProgramCache]: Analyzing trace with hash -68020551, now seen corresponding path program 1 times [2023-12-16 00:29:29,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:29:29,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20770200] [2023-12-16 00:29:29,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:29,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:29:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:29,501 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-16 00:29:29,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:29:29,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20770200] [2023-12-16 00:29:29,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20770200] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:29:29,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:29:29,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 00:29:29,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297874293] [2023-12-16 00:29:29,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:29:29,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 00:29:29,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:29:29,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 00:29:29,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 00:29:29,503 INFO L87 Difference]: Start difference. First operand 132 states and 172 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:29,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:29:29,519 INFO L93 Difference]: Finished difference Result 191 states and 243 transitions. [2023-12-16 00:29:29,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 00:29:29,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-12-16 00:29:29,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:29:29,521 INFO L225 Difference]: With dead ends: 191 [2023-12-16 00:29:29,521 INFO L226 Difference]: Without dead ends: 160 [2023-12-16 00:29:29,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 00:29:29,521 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 116 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-16 00:29:29,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 116 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:29:29,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-12-16 00:29:29,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2023-12-16 00:29:29,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.2830188679245282) internal successors, (204), 159 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:29,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 204 transitions. [2023-12-16 00:29:29,532 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 204 transitions. Word has length 43 [2023-12-16 00:29:29,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:29:29,532 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 204 transitions. [2023-12-16 00:29:29,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:29,532 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 204 transitions. [2023-12-16 00:29:29,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-16 00:29:29,532 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:29:29,533 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] [2023-12-16 00:29:29,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 00:29:29,533 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:29:29,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:29:29,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1318182843, now seen corresponding path program 1 times [2023-12-16 00:29:29,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:29:29,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315443511] [2023-12-16 00:29:29,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:29,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:29:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:29,617 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-16 00:29:29,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:29:29,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315443511] [2023-12-16 00:29:29,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315443511] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:29:29,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807813749] [2023-12-16 00:29:29,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:29,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:29:29,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:29:29,619 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 00:29:29,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-16 00:29:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:29,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 00:29:29,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:29:29,696 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-16 00:29:29,696 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 00:29:29,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807813749] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:29:29,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 00:29:29,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2023-12-16 00:29:29,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310285940] [2023-12-16 00:29:29,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:29:29,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 00:29:29,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:29:29,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 00:29:29,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 00:29:29,697 INFO L87 Difference]: Start difference. First operand 160 states and 204 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:29,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:29:29,789 INFO L93 Difference]: Finished difference Result 479 states and 619 transitions. [2023-12-16 00:29:29,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 00:29:29,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 43 [2023-12-16 00:29:29,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:29:29,791 INFO L225 Difference]: With dead ends: 479 [2023-12-16 00:29:29,791 INFO L226 Difference]: Without dead ends: 303 [2023-12-16 00:29:29,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 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-16 00:29:29,791 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 38 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 00:29:29,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 131 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 00:29:29,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-12-16 00:29:29,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 282. [2023-12-16 00:29:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.2775800711743772) internal successors, (359), 281 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 359 transitions. [2023-12-16 00:29:29,806 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 359 transitions. Word has length 43 [2023-12-16 00:29:29,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:29:29,806 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 359 transitions. [2023-12-16 00:29:29,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:29,806 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 359 transitions. [2023-12-16 00:29:29,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-16 00:29:29,807 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:29:29,807 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] [2023-12-16 00:29:29,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-16 00:29:30,011 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-16 00:29:30,012 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:29:30,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:29:30,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1208906059, now seen corresponding path program 1 times [2023-12-16 00:29:30,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:29:30,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856658377] [2023-12-16 00:29:30,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:30,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:29:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:30,124 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-16 00:29:30,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:29:30,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856658377] [2023-12-16 00:29:30,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856658377] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:29:30,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76862636] [2023-12-16 00:29:30,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:30,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:29:30,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:29:30,126 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 00:29:30,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-16 00:29:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:30,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-16 00:29:30,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:29:30,252 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-16 00:29:30,252 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 00:29:30,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76862636] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:29:30,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 00:29:30,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-12-16 00:29:30,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60459702] [2023-12-16 00:29:30,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:29:30,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 00:29:30,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:29:30,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 00:29:30,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 00:29:30,253 INFO L87 Difference]: Start difference. First operand 282 states and 359 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:30,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:29:30,434 INFO L93 Difference]: Finished difference Result 782 states and 1022 transitions. [2023-12-16 00:29:30,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 00:29:30,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 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 44 [2023-12-16 00:29:30,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:29:30,436 INFO L225 Difference]: With dead ends: 782 [2023-12-16 00:29:30,436 INFO L226 Difference]: Without dead ends: 510 [2023-12-16 00:29:30,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-12-16 00:29:30,437 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 112 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 00:29:30,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 249 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 00:29:30,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2023-12-16 00:29:30,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 435. [2023-12-16 00:29:30,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 434 states have (on average 1.2788018433179724) internal successors, (555), 434 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:30,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 555 transitions. [2023-12-16 00:29:30,457 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 555 transitions. Word has length 44 [2023-12-16 00:29:30,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:29:30,457 INFO L495 AbstractCegarLoop]: Abstraction has 435 states and 555 transitions. [2023-12-16 00:29:30,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:30,457 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 555 transitions. [2023-12-16 00:29:30,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-16 00:29:30,458 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:29:30,458 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] [2023-12-16 00:29:30,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-16 00:29:30,663 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,SelfDestructingSolverStorable13 [2023-12-16 00:29:30,663 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:29:30,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:29:30,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1256829466, now seen corresponding path program 1 times [2023-12-16 00:29:30,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:29:30,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714864046] [2023-12-16 00:29:30,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:30,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:29:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:30,785 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-16 00:29:30,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:29:30,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714864046] [2023-12-16 00:29:30,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714864046] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:29:30,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:29:30,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 00:29:30,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395633307] [2023-12-16 00:29:30,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:29:30,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 00:29:30,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:29:30,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 00:29:30,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 00:29:30,787 INFO L87 Difference]: Start difference. First operand 435 states and 555 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:31,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:29:31,192 INFO L93 Difference]: Finished difference Result 2158 states and 2728 transitions. [2023-12-16 00:29:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 00:29:31,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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 45 [2023-12-16 00:29:31,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:29:31,196 INFO L225 Difference]: With dead ends: 2158 [2023-12-16 00:29:31,196 INFO L226 Difference]: Without dead ends: 1775 [2023-12-16 00:29:31,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-16 00:29:31,198 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 299 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 00:29:31,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 504 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 00:29:31,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2023-12-16 00:29:31,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 423. [2023-12-16 00:29:31,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 1.2867298578199051) internal successors, (543), 422 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:31,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 543 transitions. [2023-12-16 00:29:31,225 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 543 transitions. Word has length 45 [2023-12-16 00:29:31,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:29:31,225 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 543 transitions. [2023-12-16 00:29:31,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:31,225 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 543 transitions. [2023-12-16 00:29:31,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-16 00:29:31,226 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:29:31,226 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, 1] [2023-12-16 00:29:31,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 00:29:31,226 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:29:31,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:29:31,226 INFO L85 PathProgramCache]: Analyzing trace with hash -959300569, now seen corresponding path program 1 times [2023-12-16 00:29:31,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:29:31,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735184091] [2023-12-16 00:29:31,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:31,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:29:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:31,325 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-16 00:29:31,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:29:31,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735184091] [2023-12-16 00:29:31,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735184091] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:29:31,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994051020] [2023-12-16 00:29:31,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:31,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:29:31,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:29:31,326 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 00:29:31,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-16 00:29:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:31,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 00:29:31,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:29:31,396 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-16 00:29:31,396 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 00:29:31,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994051020] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:29:31,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 00:29:31,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-16 00:29:31,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311432059] [2023-12-16 00:29:31,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:29:31,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 00:29:31,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:29:31,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 00:29:31,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 00:29:31,398 INFO L87 Difference]: Start difference. First operand 423 states and 543 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:31,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:29:31,500 INFO L93 Difference]: Finished difference Result 1310 states and 1686 transitions. [2023-12-16 00:29:31,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 00:29:31,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2023-12-16 00:29:31,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:29:31,503 INFO L225 Difference]: With dead ends: 1310 [2023-12-16 00:29:31,503 INFO L226 Difference]: Without dead ends: 861 [2023-12-16 00:29:31,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 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-16 00:29:31,504 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 24 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 00:29:31,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 130 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 00:29:31,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2023-12-16 00:29:31,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 776. [2023-12-16 00:29:31,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 775 states have (on average 1.270967741935484) internal successors, (985), 775 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:31,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 985 transitions. [2023-12-16 00:29:31,539 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 985 transitions. Word has length 47 [2023-12-16 00:29:31,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:29:31,539 INFO L495 AbstractCegarLoop]: Abstraction has 776 states and 985 transitions. [2023-12-16 00:29:31,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:31,539 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 985 transitions. [2023-12-16 00:29:31,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-16 00:29:31,540 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:29:31,540 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, 1, 1] [2023-12-16 00:29:31,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-16 00:29:31,745 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,SelfDestructingSolverStorable15 [2023-12-16 00:29:31,746 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:29:31,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:29:31,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1777222138, now seen corresponding path program 1 times [2023-12-16 00:29:31,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:29:31,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481933695] [2023-12-16 00:29:31,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:31,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:29:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:31,858 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-16 00:29:31,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:29:31,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481933695] [2023-12-16 00:29:31,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481933695] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:29:31,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566307757] [2023-12-16 00:29:31,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:31,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:29:31,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:29:31,874 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 00:29:31,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-16 00:29:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:31,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 00:29:31,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:29:32,005 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-16 00:29:32,005 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 00:29:32,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566307757] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:29:32,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 00:29:32,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2023-12-16 00:29:32,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871100892] [2023-12-16 00:29:32,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:29:32,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 00:29:32,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:29:32,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 00:29:32,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 00:29:32,007 INFO L87 Difference]: Start difference. First operand 776 states and 985 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:32,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:29:32,191 INFO L93 Difference]: Finished difference Result 1755 states and 2248 transitions. [2023-12-16 00:29:32,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 00:29:32,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2023-12-16 00:29:32,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:29:32,195 INFO L225 Difference]: With dead ends: 1755 [2023-12-16 00:29:32,195 INFO L226 Difference]: Without dead ends: 1329 [2023-12-16 00:29:32,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-12-16 00:29:32,196 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 91 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 00:29:32,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 235 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 00:29:32,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2023-12-16 00:29:32,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1114. [2023-12-16 00:29:32,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 1113 states have (on average 1.266846361185984) internal successors, (1410), 1113 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:32,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1410 transitions. [2023-12-16 00:29:32,257 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1410 transitions. Word has length 48 [2023-12-16 00:29:32,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:29:32,258 INFO L495 AbstractCegarLoop]: Abstraction has 1114 states and 1410 transitions. [2023-12-16 00:29:32,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:32,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1410 transitions. [2023-12-16 00:29:32,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-16 00:29:32,259 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:29:32,259 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, 1, 1, 1] [2023-12-16 00:29:32,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-16 00:29:32,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:29:32,464 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:29:32,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:29:32,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1940647856, now seen corresponding path program 1 times [2023-12-16 00:29:32,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:29:32,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951071071] [2023-12-16 00:29:32,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:32,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:29:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:32,574 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-16 00:29:32,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:29:32,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951071071] [2023-12-16 00:29:32,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951071071] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:29:32,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898128961] [2023-12-16 00:29:32,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:32,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:29:32,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:29:32,576 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-16 00:29:32,626 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-16 00:29:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:29:32,702 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-16 00:29:32,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:29:32,840 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-16 00:29:32,841 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:29:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-16 00:29:33,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898128961] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 00:29:33,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-16 00:29:33,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 11] total 21 [2023-12-16 00:29:33,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464277298] [2023-12-16 00:29:33,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:29:33,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 00:29:33,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:29:33,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 00:29:33,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-12-16 00:29:33,008 INFO L87 Difference]: Start difference. First operand 1114 states and 1410 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:33,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:29:33,708 INFO L93 Difference]: Finished difference Result 2988 states and 3844 transitions. [2023-12-16 00:29:33,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 00:29:33,708 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2023-12-16 00:29:33,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:29:33,715 INFO L225 Difference]: With dead ends: 2988 [2023-12-16 00:29:33,715 INFO L226 Difference]: Without dead ends: 2563 [2023-12-16 00:29:33,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=679, Unknown=0, NotChecked=0, Total=870 [2023-12-16 00:29:33,717 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 400 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 00:29:33,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 201 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 00:29:33,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2563 states. [2023-12-16 00:29:33,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2563 to 1763. [2023-12-16 00:29:33,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1763 states, 1762 states have (on average 1.2792281498297389) internal successors, (2254), 1762 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:33,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2254 transitions. [2023-12-16 00:29:33,802 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2254 transitions. Word has length 49 [2023-12-16 00:29:33,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:29:33,802 INFO L495 AbstractCegarLoop]: Abstraction has 1763 states and 2254 transitions. [2023-12-16 00:29:33,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 00:29:33,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2254 transitions. [2023-12-16 00:29:33,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-16 00:29:33,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:29:33,803 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, 1, 1, 1] [2023-12-16 00:29:33,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-16 00:29:34,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-16 00:29:34,008 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:29:34,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:29:34,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1692501362, now seen corresponding path program 1 times [2023-12-16 00:29:34,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:29:34,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486759192] [2023-12-16 00:29:34,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:29:34,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:29:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 00:29:34,023 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 00:29:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 00:29:34,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 00:29:34,060 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 00:29:34,063 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 00:29:34,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-16 00:29:34,066 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:29:34,068 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 00:29:34,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 12:29:34 BoogieIcfgContainer [2023-12-16 00:29:34,124 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 00:29:34,125 INFO L158 Benchmark]: Toolchain (without parser) took 9795.60ms. Allocated memory was 188.7MB in the beginning and 402.7MB in the end (delta: 213.9MB). Free memory was 132.1MB in the beginning and 199.2MB in the end (delta: -67.1MB). Peak memory consumption was 147.4MB. Max. memory is 8.0GB. [2023-12-16 00:29:34,125 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 00:29:34,126 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.29ms. Allocated memory is still 188.7MB. Free memory was 131.8MB in the beginning and 118.4MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 00:29:34,126 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.82ms. Allocated memory is still 188.7MB. Free memory was 118.4MB in the beginning and 115.7MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 00:29:34,126 INFO L158 Benchmark]: Boogie Preprocessor took 30.78ms. Allocated memory is still 188.7MB. Free memory was 115.7MB in the beginning and 113.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 00:29:34,126 INFO L158 Benchmark]: RCFGBuilder took 479.53ms. Allocated memory was 188.7MB in the beginning and 335.5MB in the end (delta: 146.8MB). Free memory was 113.2MB in the beginning and 300.5MB in the end (delta: -187.3MB). Peak memory consumption was 23.8MB. Max. memory is 8.0GB. [2023-12-16 00:29:34,126 INFO L158 Benchmark]: TraceAbstraction took 9003.51ms. Allocated memory was 335.5MB in the beginning and 402.7MB in the end (delta: 67.1MB). Free memory was 299.9MB in the beginning and 199.2MB in the end (delta: 100.6MB). Peak memory consumption was 167.7MB. Max. memory is 8.0GB. [2023-12-16 00:29:34,129 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 243.29ms. Allocated memory is still 188.7MB. Free memory was 131.8MB in the beginning and 118.4MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.82ms. Allocated memory is still 188.7MB. Free memory was 118.4MB in the beginning and 115.7MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.78ms. Allocated memory is still 188.7MB. Free memory was 115.7MB in the beginning and 113.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 479.53ms. Allocated memory was 188.7MB in the beginning and 335.5MB in the end (delta: 146.8MB). Free memory was 113.2MB in the beginning and 300.5MB in the end (delta: -187.3MB). Peak memory consumption was 23.8MB. Max. memory is 8.0GB. * TraceAbstraction took 9003.51ms. Allocated memory was 335.5MB in the beginning and 402.7MB in the end (delta: 67.1MB). Free memory was 299.9MB in the beginning and 199.2MB in the end (delta: 100.6MB). Peak memory consumption was 167.7MB. 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 bitwise operation at line 116. Possible FailurePath: [L124] unsigned int a, b, r; [L125] a = __VERIFIER_nondet_uint() [L127] b = 234770789 [L129] 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)=0, \old(b)=234770789, a0=0, a=0, b0=234770789, b=234770789, na=4] [L59] COND TRUE a3 == (unsigned char)0 [L60] na = na - 1 VAL [\old(a)=0, \old(b)=234770789, a0=0, a3=0, a=0, b0=234770789, b=234770789, na=3] [L61] COND TRUE a2 == (unsigned char)0 [L62] na = na - 1 VAL [\old(a)=0, \old(b)=234770789, a0=0, a2=0, a3=0, a=0, b0=234770789, b=234770789, na=2] [L63] COND TRUE a1 == (unsigned char)0 [L64] na = na - 1 VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b=234770789, na=1] [L68] nb = (unsigned char)4 VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b=234770789, na=1, nb=4] [L69] COND TRUE b3 == (unsigned char)0 [L70] nb = nb - 1 VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b3=0, b=234770789, na=1, nb=3] [L71] COND TRUE b2 == (unsigned char)0 [L72] nb = nb - 1 VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b2=0, b3=0, b=234770789, na=1, nb=2] [L73] COND TRUE b1 == (unsigned char)0 [L74] nb = nb - 1 VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, na=1, nb=1] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=0, na=1, 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)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=0, na=1, nb=1, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=0, na=1, nb=1, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=0, na=1, nb=1, partial_sum=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=0, na=1, nb=1, partial_sum=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=0, na=1, nb=1, partial_sum=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=0, na=1, nb=1, partial_sum=0] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=0, na=1, nb=1, partial_sum=0] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=0, na=1, nb=1, partial_sum=101] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=0, na=1, nb=1, partial_sum=101] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=0, na=1, nb=1, partial_sum=101] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=0, na=1, nb=1, partial_sum=101] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=0, na=1, nb=1, partial_sum=101] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=0, na=1, nb=1, partial_sum=101, r0=101] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=0, na=1, nb=1, partial_sum=101, r0=101] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=0, na=1, nb=1, partial_sum=101, r0=101] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=0, na=1, nb=1, partial_sum=101, r0=101] [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=1, na=1, nb=1, partial_sum=101, r0=101] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=1, na=1, nb=1, partial_sum=101, r0=101] [L107] COND TRUE i < (unsigned char)4 VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=1, na=1, nb=1, partial_sum=101, r0=101] [L108] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=1, na=1, nb=1, partial_sum=101, r0=101] [L109] COND TRUE i == (unsigned char)1 [L109] r1 = (unsigned char)0 VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=1, na=1, nb=1, partial_sum=101, r0=101, r1=0] [L110] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=1, na=1, nb=1, partial_sum=101, r0=101, r1=0] [L111] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=1, na=1, nb=1, partial_sum=101, r0=101, r1=0] [L113] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=2, na=1, nb=1, partial_sum=101, r0=101, r1=0] [L107] COND TRUE i < (unsigned char)4 VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=2, na=1, nb=1, partial_sum=101, r0=101, r1=0] [L108] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=2, na=1, nb=1, partial_sum=101, r0=101, r1=0] [L109] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=2, na=1, nb=1, partial_sum=101, r0=101, r1=0] [L110] COND TRUE i == (unsigned char)2 [L110] r2 = (unsigned char)0 VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=2, na=1, nb=1, partial_sum=101, r0=101, r1=0, r2=0] [L111] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=2, na=1, nb=1, partial_sum=101, r0=101, r1=0, r2=0] [L113] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=3, na=1, nb=1, partial_sum=101, r0=101, r1=0, r2=0] [L107] COND TRUE i < (unsigned char)4 VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=3, na=1, nb=1, partial_sum=101, r0=101, r1=0, r2=0] [L108] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=3, na=1, nb=1, partial_sum=101, r0=101, r1=0, r2=0] [L109] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=3, na=1, nb=1, partial_sum=101, r0=101, r1=0, r2=0] [L110] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=3, na=1, nb=1, partial_sum=101, r0=101, r1=0, r2=0] [L111] COND TRUE i == (unsigned char)3 [L111] r3 = (unsigned char)0 VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=3, na=1, nb=1, partial_sum=101, r0=101, r1=0, r2=0, r3=0] [L113] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=4, na=1, nb=1, partial_sum=101, r0=101, r1=0, r2=0, r3=0] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=0, \old(b)=234770789, a0=0, a1=0, a2=0, a3=0, a=0, b0=234770789, b1=0, b2=0, b3=0, b=234770789, carry=0, i=4, na=1, nb=1, partial_sum=101, r0=101, r1=0, r2=0, r3=0] [L116] EXPR r1 << 8U [L116] EXPR r0 | (r1 << 8U) [L116] EXPR r2 << 16U [L116] EXPR r0 | (r1 << 8U) | (r2 << 16U) [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; [L129] RET, EXPR mp_add(a, b) [L129] r = mp_add(a, b) [L131] 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, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 19, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2223 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2223 mSDsluCounter, 3757 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2339 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3752 IncrementalHoareTripleChecker+Invalid, 3962 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 1418 mSDtfsCounter, 3752 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 491 GetRequests, 372 SyntacticMatches, 9 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1763occurred in iteration=18, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 4017 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 945 NumberOfCodeBlocks, 945 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 918 ConstructedInterpolants, 0 QuantifiedInterpolants, 3650 SizeOfPredicates, 15 NumberOfNonLiveVariables, 966 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 27 InterpolantComputations, 18 PerfectInterpolantSequences, 472/508 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-16 00:29:34,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...