/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-64bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.h_segments.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 19:30:08,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 19:30:08,455 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2023-12-16 19:30:08,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 19:30:08,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 19:30:08,478 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 19:30:08,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 19:30:08,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 19:30:08,479 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 19:30:08,479 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 19:30:08,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 19:30:08,480 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 19:30:08,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 19:30:08,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 19:30:08,481 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 19:30:08,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 19:30:08,482 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 19:30:08,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 19:30:08,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 19:30:08,483 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 19:30:08,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 19:30:08,487 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 19:30:08,487 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 19:30:08,487 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 19:30:08,487 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 19:30:08,488 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 19:30:08,488 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 19:30:08,488 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 19:30:08,488 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 19:30:08,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:30:08,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 19:30:08,489 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 19:30:08,489 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 19:30:08,489 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 19:30:08,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 19:30:08,490 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 19:30:08,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 19:30:08,490 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 19:30:08,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 19:30:08,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 19:30:08,491 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-16 19:30:08,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 19:30:08,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 19:30:08,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 19:30:08,685 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 19:30:08,685 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 19:30:08,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.h_segments.c [2023-12-16 19:30:09,849 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 19:30:10,061 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 19:30:10,061 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.h_segments.c [2023-12-16 19:30:10,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f09e1494b/1db2b1401f954cd8b06f53944d0b093b/FLAG1d50cd72c [2023-12-16 19:30:10,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f09e1494b/1db2b1401f954cd8b06f53944d0b093b [2023-12-16 19:30:10,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 19:30:10,085 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 19:30:10,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 19:30:10,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 19:30:10,093 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 19:30:10,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:30:10" (1/1) ... [2023-12-16 19:30:10,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@202bd684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:10, skipping insertion in model container [2023-12-16 19:30:10,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:30:10" (1/1) ... [2023-12-16 19:30:10,119 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 19:30:10,235 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.h_segments.c[1250,1263] [2023-12-16 19:30:10,298 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:30:10,306 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 19:30:10,315 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.h_segments.c[1250,1263] [2023-12-16 19:30:10,349 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:30:10,370 INFO L206 MainTranslator]: Completed translation [2023-12-16 19:30:10,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:10 WrapperNode [2023-12-16 19:30:10,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 19:30:10,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 19:30:10,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 19:30:10,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 19:30:10,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:10" (1/1) ... [2023-12-16 19:30:10,390 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:10" (1/1) ... [2023-12-16 19:30:10,467 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 346 [2023-12-16 19:30:10,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 19:30:10,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 19:30:10,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 19:30:10,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 19:30:10,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:10" (1/1) ... [2023-12-16 19:30:10,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:10" (1/1) ... [2023-12-16 19:30:10,494 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:10" (1/1) ... [2023-12-16 19:30:10,514 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 19:30:10,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:10" (1/1) ... [2023-12-16 19:30:10,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:10" (1/1) ... [2023-12-16 19:30:10,527 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:10" (1/1) ... [2023-12-16 19:30:10,531 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:10" (1/1) ... [2023-12-16 19:30:10,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:10" (1/1) ... [2023-12-16 19:30:10,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:10" (1/1) ... [2023-12-16 19:30:10,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 19:30:10,544 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 19:30:10,545 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 19:30:10,545 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 19:30:10,545 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:10" (1/1) ... [2023-12-16 19:30:10,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:30:10,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:30:10,579 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 19:30:10,588 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 19:30:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 19:30:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 19:30:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 19:30:10,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 19:30:10,691 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 19:30:10,693 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 19:30:11,171 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 19:30:11,201 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 19:30:11,201 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 19:30:11,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:30:11 BoogieIcfgContainer [2023-12-16 19:30:11,203 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 19:30:11,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 19:30:11,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 19:30:11,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 19:30:11,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:30:10" (1/3) ... [2023-12-16 19:30:11,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1a88bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:30:11, skipping insertion in model container [2023-12-16 19:30:11,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:10" (2/3) ... [2023-12-16 19:30:11,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1a88bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:30:11, skipping insertion in model container [2023-12-16 19:30:11,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:30:11" (3/3) ... [2023-12-16 19:30:11,214 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_segments.c [2023-12-16 19:30:11,226 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 19:30:11,227 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 19:30:11,266 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 19:30:11,272 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;@7507a131, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 19:30:11,272 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 19:30:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 61 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:11,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-16 19:30:11,284 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:11,285 INFO L195 NwaCegarLoop]: trace histogram [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 19:30:11,285 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:11,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:11,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1096434565, now seen corresponding path program 1 times [2023-12-16 19:30:11,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:11,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901152650] [2023-12-16 19:30:11,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:11,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:11,931 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 19:30:11,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:11,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901152650] [2023-12-16 19:30:11,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901152650] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:11,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:11,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:30:11,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395016978] [2023-12-16 19:30:11,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:11,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:30:11,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:11,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:30:11,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:30:11,973 INFO L87 Difference]: Start difference. First operand has 62 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 61 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:12,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:12,032 INFO L93 Difference]: Finished difference Result 120 states and 196 transitions. [2023-12-16 19:30:12,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:30:12,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-12-16 19:30:12,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:12,042 INFO L225 Difference]: With dead ends: 120 [2023-12-16 19:30:12,042 INFO L226 Difference]: Without dead ends: 62 [2023-12-16 19:30:12,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:30:12,049 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 1 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:12,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 274 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:30:12,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-16 19:30:12,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-12-16 19:30:12,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:12,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 98 transitions. [2023-12-16 19:30:12,086 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 98 transitions. Word has length 30 [2023-12-16 19:30:12,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:12,087 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 98 transitions. [2023-12-16 19:30:12,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:12,087 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 98 transitions. [2023-12-16 19:30:12,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-16 19:30:12,088 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:12,089 INFO L195 NwaCegarLoop]: trace histogram [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 19:30:12,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 19:30:12,089 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:12,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:12,090 INFO L85 PathProgramCache]: Analyzing trace with hash -368541749, now seen corresponding path program 1 times [2023-12-16 19:30:12,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:12,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378658336] [2023-12-16 19:30:12,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:12,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:12,296 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 19:30:12,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:12,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378658336] [2023-12-16 19:30:12,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378658336] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:12,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:12,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:30:12,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215614916] [2023-12-16 19:30:12,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:12,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:30:12,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:12,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:30:12,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:30:12,305 INFO L87 Difference]: Start difference. First operand 62 states and 98 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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 19:30:12,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:12,348 INFO L93 Difference]: Finished difference Result 123 states and 194 transitions. [2023-12-16 19:30:12,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:30:12,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2023-12-16 19:30:12,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:12,352 INFO L225 Difference]: With dead ends: 123 [2023-12-16 19:30:12,352 INFO L226 Difference]: Without dead ends: 65 [2023-12-16 19:30:12,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:30:12,354 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 1 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:12,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 272 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:30:12,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-16 19:30:12,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2023-12-16 19:30:12,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.5873015873015872) internal successors, (100), 63 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:12,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 100 transitions. [2023-12-16 19:30:12,365 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 100 transitions. Word has length 31 [2023-12-16 19:30:12,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:12,365 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 100 transitions. [2023-12-16 19:30:12,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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 19:30:12,366 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 100 transitions. [2023-12-16 19:30:12,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-16 19:30:12,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:12,367 INFO L195 NwaCegarLoop]: trace histogram [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 19:30:12,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 19:30:12,368 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:12,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:12,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1249675359, now seen corresponding path program 1 times [2023-12-16 19:30:12,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:12,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304283452] [2023-12-16 19:30:12,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:12,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:12,741 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 19:30:12,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:12,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304283452] [2023-12-16 19:30:12,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304283452] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:12,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:12,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:30:12,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385749739] [2023-12-16 19:30:12,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:12,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:30:12,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:12,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:30:12,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:30:12,747 INFO L87 Difference]: Start difference. First operand 64 states and 100 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:12,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:12,869 INFO L93 Difference]: Finished difference Result 212 states and 334 transitions. [2023-12-16 19:30:12,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 19:30:12,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-12-16 19:30:12,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:12,875 INFO L225 Difference]: With dead ends: 212 [2023-12-16 19:30:12,876 INFO L226 Difference]: Without dead ends: 152 [2023-12-16 19:30:12,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-12-16 19:30:12,878 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 369 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:12,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 450 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:30:12,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-12-16 19:30:12,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 67. [2023-12-16 19:30:12,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.5606060606060606) internal successors, (103), 66 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:12,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2023-12-16 19:30:12,886 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 32 [2023-12-16 19:30:12,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:12,886 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2023-12-16 19:30:12,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:12,887 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2023-12-16 19:30:12,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-16 19:30:12,887 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:12,888 INFO L195 NwaCegarLoop]: trace histogram [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 19:30:12,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 19:30:12,888 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:12,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:12,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1270284575, now seen corresponding path program 1 times [2023-12-16 19:30:12,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:12,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573905962] [2023-12-16 19:30:12,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:12,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:13,597 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 19:30:13,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:13,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573905962] [2023-12-16 19:30:13,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573905962] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:13,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:13,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:30:13,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68124619] [2023-12-16 19:30:13,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:13,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 19:30:13,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:13,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 19:30:13,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:30:13,599 INFO L87 Difference]: Start difference. First operand 67 states and 103 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:13,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:13,751 INFO L93 Difference]: Finished difference Result 264 states and 404 transitions. [2023-12-16 19:30:13,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 19:30:13,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-12-16 19:30:13,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:13,752 INFO L225 Difference]: With dead ends: 264 [2023-12-16 19:30:13,752 INFO L226 Difference]: Without dead ends: 201 [2023-12-16 19:30:13,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2023-12-16 19:30:13,754 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 505 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:13,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 494 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:30:13,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-12-16 19:30:13,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 72. [2023-12-16 19:30:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.5352112676056338) internal successors, (109), 71 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 19:30:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 109 transitions. [2023-12-16 19:30:13,761 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 109 transitions. Word has length 32 [2023-12-16 19:30:13,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:13,761 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 109 transitions. [2023-12-16 19:30:13,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:13,762 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 109 transitions. [2023-12-16 19:30:13,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-16 19:30:13,763 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:13,763 INFO L195 NwaCegarLoop]: trace histogram [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 19:30:13,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 19:30:13,763 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:13,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:13,764 INFO L85 PathProgramCache]: Analyzing trace with hash 247664855, now seen corresponding path program 1 times [2023-12-16 19:30:13,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:13,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512794542] [2023-12-16 19:30:13,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:13,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:14,144 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 19:30:14,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:14,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512794542] [2023-12-16 19:30:14,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512794542] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:14,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:14,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 19:30:14,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792875235] [2023-12-16 19:30:14,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:14,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 19:30:14,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:14,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 19:30:14,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:30:14,148 INFO L87 Difference]: Start difference. First operand 72 states and 109 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:14,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:14,448 INFO L93 Difference]: Finished difference Result 353 states and 532 transitions. [2023-12-16 19:30:14,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 19:30:14,450 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-12-16 19:30:14,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:14,451 INFO L225 Difference]: With dead ends: 353 [2023-12-16 19:30:14,452 INFO L226 Difference]: Without dead ends: 285 [2023-12-16 19:30:14,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2023-12-16 19:30:14,456 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 599 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:14,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 936 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:30:14,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-12-16 19:30:14,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 76. [2023-12-16 19:30:14,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.52) internal successors, (114), 75 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2023-12-16 19:30:14,473 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 33 [2023-12-16 19:30:14,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:14,474 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2023-12-16 19:30:14,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:14,475 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2023-12-16 19:30:14,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-16 19:30:14,477 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:14,477 INFO L195 NwaCegarLoop]: trace histogram [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 19:30:14,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 19:30:14,477 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:14,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:14,479 INFO L85 PathProgramCache]: Analyzing trace with hash 327732221, now seen corresponding path program 1 times [2023-12-16 19:30:14,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:14,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777825945] [2023-12-16 19:30:14,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:14,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:14,603 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 19:30:14,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:14,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777825945] [2023-12-16 19:30:14,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777825945] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:14,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:14,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:30:14,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707817830] [2023-12-16 19:30:14,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:14,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:30:14,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:14,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:30:14,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:30:14,606 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:14,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:14,656 INFO L93 Difference]: Finished difference Result 219 states and 328 transitions. [2023-12-16 19:30:14,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 19:30:14,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-12-16 19:30:14,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:14,658 INFO L225 Difference]: With dead ends: 219 [2023-12-16 19:30:14,658 INFO L226 Difference]: Without dead ends: 147 [2023-12-16 19:30:14,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:30:14,660 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 264 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:14,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 254 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:30:14,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-12-16 19:30:14,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 86. [2023-12-16 19:30:14,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 85 states have internal predecessors, (128), 0 states have call successors, (0), 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 19:30:14,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 128 transitions. [2023-12-16 19:30:14,672 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 128 transitions. Word has length 33 [2023-12-16 19:30:14,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:14,672 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 128 transitions. [2023-12-16 19:30:14,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:14,672 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 128 transitions. [2023-12-16 19:30:14,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-16 19:30:14,673 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:14,673 INFO L195 NwaCegarLoop]: trace histogram [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 19:30:14,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 19:30:14,674 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:14,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:14,674 INFO L85 PathProgramCache]: Analyzing trace with hash -36940381, now seen corresponding path program 1 times [2023-12-16 19:30:14,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:14,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941721496] [2023-12-16 19:30:14,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:14,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:14,776 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 19:30:14,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:14,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941721496] [2023-12-16 19:30:14,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941721496] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:14,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:14,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:30:14,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807003948] [2023-12-16 19:30:14,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:14,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:30:14,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:14,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:30:14,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:30:14,778 INFO L87 Difference]: Start difference. First operand 86 states and 128 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:14,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:14,826 INFO L93 Difference]: Finished difference Result 214 states and 318 transitions. [2023-12-16 19:30:14,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 19:30:14,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-12-16 19:30:14,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:14,827 INFO L225 Difference]: With dead ends: 214 [2023-12-16 19:30:14,827 INFO L226 Difference]: Without dead ends: 139 [2023-12-16 19:30:14,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:30:14,831 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 256 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:14,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 255 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:30:14,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-12-16 19:30:14,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 83. [2023-12-16 19:30:14,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.5) internal successors, (123), 82 states have internal predecessors, (123), 0 states have call successors, (0), 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 19:30:14,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 123 transitions. [2023-12-16 19:30:14,841 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 123 transitions. Word has length 33 [2023-12-16 19:30:14,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:14,841 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 123 transitions. [2023-12-16 19:30:14,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:14,841 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 123 transitions. [2023-12-16 19:30:14,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-16 19:30:14,843 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:14,843 INFO L195 NwaCegarLoop]: trace histogram [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 19:30:14,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 19:30:14,844 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:14,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:14,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1360547115, now seen corresponding path program 1 times [2023-12-16 19:30:14,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:14,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264711622] [2023-12-16 19:30:14,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:14,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:15,284 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 19:30:15,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:15,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264711622] [2023-12-16 19:30:15,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264711622] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:15,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:15,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 19:30:15,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210927174] [2023-12-16 19:30:15,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:15,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 19:30:15,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:15,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 19:30:15,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-16 19:30:15,287 INFO L87 Difference]: Start difference. First operand 83 states and 123 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 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 19:30:16,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:16,155 INFO L93 Difference]: Finished difference Result 480 states and 721 transitions. [2023-12-16 19:30:16,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-16 19:30:16,156 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 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 34 [2023-12-16 19:30:16,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:16,157 INFO L225 Difference]: With dead ends: 480 [2023-12-16 19:30:16,157 INFO L226 Difference]: Without dead ends: 408 [2023-12-16 19:30:16,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=364, Invalid=1042, Unknown=0, NotChecked=0, Total=1406 [2023-12-16 19:30:16,159 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 844 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:16,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1349 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:30:16,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2023-12-16 19:30:16,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 91. [2023-12-16 19:30:16,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.5) internal successors, (135), 90 states have internal predecessors, (135), 0 states have call successors, (0), 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 19:30:16,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 135 transitions. [2023-12-16 19:30:16,166 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 135 transitions. Word has length 34 [2023-12-16 19:30:16,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:16,166 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 135 transitions. [2023-12-16 19:30:16,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 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 19:30:16,166 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 135 transitions. [2023-12-16 19:30:16,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-16 19:30:16,167 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:16,167 INFO L195 NwaCegarLoop]: trace histogram [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 19:30:16,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 19:30:16,167 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:16,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:16,168 INFO L85 PathProgramCache]: Analyzing trace with hash 940275475, now seen corresponding path program 1 times [2023-12-16 19:30:16,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:16,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284675920] [2023-12-16 19:30:16,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:16,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:16,381 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 19:30:16,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:16,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284675920] [2023-12-16 19:30:16,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284675920] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:16,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:16,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:30:16,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995464146] [2023-12-16 19:30:16,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:16,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:30:16,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:16,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:30:16,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:30:16,383 INFO L87 Difference]: Start difference. First operand 91 states and 135 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 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 19:30:16,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:16,433 INFO L93 Difference]: Finished difference Result 251 states and 374 transitions. [2023-12-16 19:30:16,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:30:16,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 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 34 [2023-12-16 19:30:16,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:16,435 INFO L225 Difference]: With dead ends: 251 [2023-12-16 19:30:16,435 INFO L226 Difference]: Without dead ends: 171 [2023-12-16 19:30:16,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:30:16,436 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 240 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:16,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 299 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:30:16,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-12-16 19:30:16,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 95. [2023-12-16 19:30:16,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 94 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:16,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 140 transitions. [2023-12-16 19:30:16,442 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 140 transitions. Word has length 34 [2023-12-16 19:30:16,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:16,443 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 140 transitions. [2023-12-16 19:30:16,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 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 19:30:16,443 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 140 transitions. [2023-12-16 19:30:16,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-16 19:30:16,444 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:16,444 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-12-16 19:30:16,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 19:30:16,444 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:16,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:16,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1794736181, now seen corresponding path program 1 times [2023-12-16 19:30:16,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:16,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860178254] [2023-12-16 19:30:16,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:16,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:16,896 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 19:30:16,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:16,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860178254] [2023-12-16 19:30:16,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860178254] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:16,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:16,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-16 19:30:16,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492399841] [2023-12-16 19:30:16,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:16,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 19:30:16,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:16,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 19:30:16,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-16 19:30:16,899 INFO L87 Difference]: Start difference. First operand 95 states and 140 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 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 19:30:20,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:20,185 INFO L93 Difference]: Finished difference Result 1310 states and 1944 transitions. [2023-12-16 19:30:20,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2023-12-16 19:30:20,186 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2023-12-16 19:30:20,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:20,190 INFO L225 Difference]: With dead ends: 1310 [2023-12-16 19:30:20,190 INFO L226 Difference]: Without dead ends: 1226 [2023-12-16 19:30:20,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4433 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2054, Invalid=9288, Unknown=0, NotChecked=0, Total=11342 [2023-12-16 19:30:20,194 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 2430 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2430 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:20,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2430 Valid, 2000 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 19:30:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2023-12-16 19:30:20,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 102. [2023-12-16 19:30:20,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.4851485148514851) internal successors, (150), 101 states have internal predecessors, (150), 0 states have call successors, (0), 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 19:30:20,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 150 transitions. [2023-12-16 19:30:20,205 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 150 transitions. Word has length 35 [2023-12-16 19:30:20,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:20,205 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 150 transitions. [2023-12-16 19:30:20,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 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 19:30:20,206 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 150 transitions. [2023-12-16 19:30:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-16 19:30:20,206 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:20,206 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-12-16 19:30:20,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 19:30:20,207 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:20,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:20,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1489113865, now seen corresponding path program 1 times [2023-12-16 19:30:20,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:20,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484772378] [2023-12-16 19:30:20,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:20,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:20,591 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 19:30:20,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:20,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484772378] [2023-12-16 19:30:20,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484772378] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:20,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:20,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 19:30:20,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945988738] [2023-12-16 19:30:20,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:20,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 19:30:20,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:20,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 19:30:20,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-12-16 19:30:20,593 INFO L87 Difference]: Start difference. First operand 102 states and 150 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 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 19:30:21,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:21,341 INFO L93 Difference]: Finished difference Result 466 states and 686 transitions. [2023-12-16 19:30:21,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-16 19:30:21,342 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2023-12-16 19:30:21,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:21,344 INFO L225 Difference]: With dead ends: 466 [2023-12-16 19:30:21,344 INFO L226 Difference]: Without dead ends: 375 [2023-12-16 19:30:21,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=307, Invalid=749, Unknown=0, NotChecked=0, Total=1056 [2023-12-16 19:30:21,345 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 1508 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:21,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 854 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:30:21,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2023-12-16 19:30:21,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 110. [2023-12-16 19:30:21,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.4770642201834863) internal successors, (161), 109 states have internal predecessors, (161), 0 states have call successors, (0), 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 19:30:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 161 transitions. [2023-12-16 19:30:21,352 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 161 transitions. Word has length 35 [2023-12-16 19:30:21,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:21,352 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 161 transitions. [2023-12-16 19:30:21,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 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 19:30:21,352 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 161 transitions. [2023-12-16 19:30:21,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-16 19:30:21,356 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:21,356 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-12-16 19:30:21,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 19:30:21,357 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:21,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:21,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1038187355, now seen corresponding path program 1 times [2023-12-16 19:30:21,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:21,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818268411] [2023-12-16 19:30:21,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:21,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:21,475 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 19:30:21,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:21,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818268411] [2023-12-16 19:30:21,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818268411] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:21,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:21,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:30:21,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549429248] [2023-12-16 19:30:21,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:21,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:30:21,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:21,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:30:21,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:30:21,477 INFO L87 Difference]: Start difference. First operand 110 states and 161 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 19:30:21,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:21,521 INFO L93 Difference]: Finished difference Result 266 states and 386 transitions. [2023-12-16 19:30:21,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 19:30:21,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2023-12-16 19:30:21,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:21,523 INFO L225 Difference]: With dead ends: 266 [2023-12-16 19:30:21,523 INFO L226 Difference]: Without dead ends: 167 [2023-12-16 19:30:21,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:30:21,524 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 237 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:21,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 254 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:30:21,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-12-16 19:30:21,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 115. [2023-12-16 19:30:21,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.456140350877193) internal successors, (166), 114 states have internal predecessors, (166), 0 states have call successors, (0), 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 19:30:21,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 166 transitions. [2023-12-16 19:30:21,532 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 166 transitions. Word has length 35 [2023-12-16 19:30:21,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:21,532 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 166 transitions. [2023-12-16 19:30:21,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 19:30:21,532 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 166 transitions. [2023-12-16 19:30:21,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 19:30:21,532 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:21,533 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2023-12-16 19:30:21,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 19:30:21,533 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:21,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:21,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1687960505, now seen corresponding path program 1 times [2023-12-16 19:30:21,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:21,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066489727] [2023-12-16 19:30:21,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:21,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:21,975 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 19:30:21,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:21,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066489727] [2023-12-16 19:30:21,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066489727] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:21,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:21,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-16 19:30:21,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697349927] [2023-12-16 19:30:21,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:21,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 19:30:21,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:21,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 19:30:21,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-12-16 19:30:21,978 INFO L87 Difference]: Start difference. First operand 115 states and 166 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 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 19:30:24,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:24,282 INFO L93 Difference]: Finished difference Result 646 states and 948 transitions. [2023-12-16 19:30:24,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-12-16 19:30:24,283 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 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 36 [2023-12-16 19:30:24,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:24,285 INFO L225 Difference]: With dead ends: 646 [2023-12-16 19:30:24,285 INFO L226 Difference]: Without dead ends: 547 [2023-12-16 19:30:24,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1031, Invalid=3001, Unknown=0, NotChecked=0, Total=4032 [2023-12-16 19:30:24,288 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 1957 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1957 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:24,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1957 Valid, 1867 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 19:30:24,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2023-12-16 19:30:24,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 123. [2023-12-16 19:30:24,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.459016393442623) internal successors, (178), 122 states have internal predecessors, (178), 0 states have call successors, (0), 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 19:30:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 178 transitions. [2023-12-16 19:30:24,299 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 178 transitions. Word has length 36 [2023-12-16 19:30:24,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:24,299 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 178 transitions. [2023-12-16 19:30:24,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 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 19:30:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 178 transitions. [2023-12-16 19:30:24,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 19:30:24,300 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:24,300 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2023-12-16 19:30:24,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 19:30:24,300 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:24,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:24,301 INFO L85 PathProgramCache]: Analyzing trace with hash 87046857, now seen corresponding path program 1 times [2023-12-16 19:30:24,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:24,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113079920] [2023-12-16 19:30:24,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:24,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:30:24,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 19:30:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:30:24,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 19:30:24,409 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 19:30:24,410 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 19:30:24,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 19:30:24,415 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:30:24,417 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 19:30:24,473 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 19:30:24,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:30:24 BoogieIcfgContainer [2023-12-16 19:30:24,491 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 19:30:24,492 INFO L158 Benchmark]: Toolchain (without parser) took 14406.96ms. Allocated memory was 260.0MB in the beginning and 468.7MB in the end (delta: 208.7MB). Free memory was 209.0MB in the beginning and 343.4MB in the end (delta: -134.3MB). Peak memory consumption was 74.9MB. Max. memory is 8.0GB. [2023-12-16 19:30:24,492 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 180.4MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 19:30:24,492 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.12ms. Allocated memory is still 260.0MB. Free memory was 209.0MB in the beginning and 193.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 19:30:24,493 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.21ms. Allocated memory is still 260.0MB. Free memory was 193.8MB in the beginning and 186.0MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-12-16 19:30:24,493 INFO L158 Benchmark]: Boogie Preprocessor took 75.97ms. Allocated memory is still 260.0MB. Free memory was 186.0MB in the beginning and 181.2MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 19:30:24,493 INFO L158 Benchmark]: RCFGBuilder took 658.64ms. Allocated memory is still 260.0MB. Free memory was 181.2MB in the beginning and 208.4MB in the end (delta: -27.2MB). Peak memory consumption was 32.6MB. Max. memory is 8.0GB. [2023-12-16 19:30:24,493 INFO L158 Benchmark]: TraceAbstraction took 13283.92ms. Allocated memory was 260.0MB in the beginning and 468.7MB in the end (delta: 208.7MB). Free memory was 207.9MB in the beginning and 343.4MB in the end (delta: -135.5MB). Peak memory consumption was 72.7MB. Max. memory is 8.0GB. [2023-12-16 19:30:24,495 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.13ms. Allocated memory is still 180.4MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 285.12ms. Allocated memory is still 260.0MB. Free memory was 209.0MB in the beginning and 193.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 95.21ms. Allocated memory is still 260.0MB. Free memory was 193.8MB in the beginning and 186.0MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 75.97ms. Allocated memory is still 260.0MB. Free memory was 186.0MB in the beginning and 181.2MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 658.64ms. Allocated memory is still 260.0MB. Free memory was 181.2MB in the beginning and 208.4MB in the end (delta: -27.2MB). Peak memory consumption was 32.6MB. Max. memory is 8.0GB. * TraceAbstraction took 13283.92ms. Allocated memory was 260.0MB in the beginning and 468.7MB in the end (delta: 208.7MB). Free memory was 207.9MB in the beginning and 343.4MB in the end (delta: -135.5MB). Peak memory consumption was 72.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: 21]: 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 bitwiseAnd at line 113. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 8); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (8 - 1); [L32] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 32); [L33] const SORT_8 msb_SORT_8 = (SORT_8)1 << (32 - 1); [L35] const SORT_52 mask_SORT_52 = (SORT_52)-1 >> (sizeof(SORT_52) * 8 - 2); [L36] const SORT_52 msb_SORT_52 = (SORT_52)1 << (2 - 1); [L38] const SORT_54 mask_SORT_54 = (SORT_54)-1 >> (sizeof(SORT_54) * 8 - 3); [L39] const SORT_54 msb_SORT_54 = (SORT_54)1 << (3 - 1); [L41] const SORT_4 var_5 = 0; [L42] const SORT_8 var_10 = 0; [L43] const SORT_8 var_13 = 1; [L44] const SORT_8 var_17 = 2; [L45] const SORT_8 var_21 = 3; [L46] const SORT_8 var_25 = 4; [L47] const SORT_1 var_30 = 1; [L48] const SORT_4 var_41 = 1; [L49] const SORT_4 var_44 = 4; [L50] const SORT_4 var_45 = 3; [L51] const SORT_4 var_50 = 2; [L53] SORT_1 input_2; [L54] SORT_1 input_3; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=128, msb_SORT_52=2, msb_SORT_54=4, msb_SORT_8=2147483648, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L56] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L58] SORT_4 init_7_arg_1 = var_5; [L59] state_6 = init_7_arg_1 VAL [init_7_arg_1=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=128, msb_SORT_52=2, msb_SORT_54=4, msb_SORT_8=2147483648, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L62] input_2 = __VERIFIER_nondet_uchar() [L63] input_3 = __VERIFIER_nondet_uchar() [L64] EXPR input_3 & mask_SORT_1 VAL [init_7_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=128, msb_SORT_52=2, msb_SORT_54=4, msb_SORT_8=2147483648, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L64] input_3 = input_3 & mask_SORT_1 [L67] SORT_4 var_9_arg_0 = state_6; VAL [init_7_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=128, msb_SORT_52=2, msb_SORT_54=4, msb_SORT_8=2147483648, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0, var_9_arg_0=0] [L68] EXPR var_9_arg_0 & mask_SORT_4 VAL [init_7_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=128, msb_SORT_52=2, msb_SORT_54=4, msb_SORT_8=2147483648, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0, var_9_arg_0=0] [L68] var_9_arg_0 = var_9_arg_0 & mask_SORT_4 [L69] SORT_8 var_9 = var_9_arg_0; [L70] SORT_8 var_11_arg_0 = var_9; [L71] SORT_8 var_11_arg_1 = var_10; [L72] SORT_1 var_11 = var_11_arg_0 == var_11_arg_1; [L73] SORT_4 var_12_arg_0 = state_6; VAL [init_7_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=128, msb_SORT_52=2, msb_SORT_54=4, msb_SORT_8=2147483648, state_6=0, var_10=0, var_11=1, var_11_arg_0=0, var_11_arg_1=0, var_12_arg_0=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0, var_9=0, var_9_arg_0=0] [L74] EXPR var_12_arg_0 & mask_SORT_4 VAL [init_7_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=128, msb_SORT_52=2, msb_SORT_54=4, msb_SORT_8=2147483648, state_6=0, var_10=0, var_11=1, var_11_arg_0=0, var_11_arg_1=0, var_12_arg_0=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0, var_9=0, var_9_arg_0=0] [L74] var_12_arg_0 = var_12_arg_0 & mask_SORT_4 [L75] SORT_8 var_12 = var_12_arg_0; [L76] SORT_8 var_14_arg_0 = var_12; [L77] SORT_8 var_14_arg_1 = var_13; [L78] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L79] SORT_1 var_15_arg_0 = var_11; [L80] SORT_1 var_15_arg_1 = var_14; VAL [init_7_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=128, msb_SORT_52=2, msb_SORT_54=4, msb_SORT_8=2147483648, state_6=0, var_10=0, var_11=1, var_11_arg_0=0, var_11_arg_1=0, var_12=0, var_12_arg_0=0, var_13=1, var_14=0, var_14_arg_0=0, var_14_arg_1=1, var_15_arg_0=1, var_15_arg_1=0, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0, var_9=0, var_9_arg_0=0] [L81] EXPR var_15_arg_0 | var_15_arg_1 VAL [init_7_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=128, msb_SORT_52=2, msb_SORT_54=4, msb_SORT_8=2147483648, state_6=0, var_10=0, var_11=1, var_11_arg_0=0, var_11_arg_1=0, var_12=0, var_12_arg_0=0, var_13=1, var_14=0, var_14_arg_0=0, var_14_arg_1=1, var_15_arg_0=1, var_15_arg_1=0, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0, var_9=0, var_9_arg_0=0] [L81] SORT_1 var_15 = var_15_arg_0 | var_15_arg_1; [L82] SORT_4 var_16_arg_0 = state_6; VAL [init_7_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=128, msb_SORT_52=2, msb_SORT_54=4, msb_SORT_8=2147483648, state_6=0, var_10=0, var_11=1, var_11_arg_0=0, var_11_arg_1=0, var_12=0, var_12_arg_0=0, var_13=1, var_14=0, var_14_arg_0=0, var_14_arg_1=1, var_15=1, var_15_arg_0=1, var_15_arg_1=0, var_16_arg_0=0, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0, var_9=0, var_9_arg_0=0] [L83] EXPR var_16_arg_0 & mask_SORT_4 VAL [init_7_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=128, msb_SORT_52=2, msb_SORT_54=4, msb_SORT_8=2147483648, state_6=0, var_10=0, var_11=1, var_11_arg_0=0, var_11_arg_1=0, var_12=0, var_12_arg_0=0, var_13=1, var_14=0, var_14_arg_0=0, var_14_arg_1=1, var_15=1, var_15_arg_0=1, var_15_arg_1=0, var_16_arg_0=0, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0, var_9=0, var_9_arg_0=0] [L83] var_16_arg_0 = var_16_arg_0 & mask_SORT_4 [L84] SORT_8 var_16 = var_16_arg_0; [L85] SORT_8 var_18_arg_0 = var_16; [L86] SORT_8 var_18_arg_1 = var_17; [L87] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L88] SORT_1 var_19_arg_0 = var_15; [L89] SORT_1 var_19_arg_1 = var_18; VAL [init_7_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=128, msb_SORT_52=2, msb_SORT_54=4, msb_SORT_8=2147483648, state_6=0, var_10=0, var_11=1, var_11_arg_0=0, var_11_arg_1=0, var_12=0, var_12_arg_0=0, var_13=1, var_14=0, var_14_arg_0=0, var_14_arg_1=1, var_15=1, var_15_arg_0=1, var_15_arg_1=0, var_16=0, var_16_arg_0=0, var_17=2, var_18=0, var_18_arg_0=0, var_18_arg_1=2, var_19_arg_0=1, var_19_arg_1=0, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0, var_9=0, var_9_arg_0=0] [L90] EXPR var_19_arg_0 | var_19_arg_1 VAL [init_7_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=128, msb_SORT_52=2, msb_SORT_54=4, msb_SORT_8=2147483648, state_6=0, var_10=0, var_11=1, var_11_arg_0=0, var_11_arg_1=0, var_12=0, var_12_arg_0=0, var_13=1, var_14=0, var_14_arg_0=0, var_14_arg_1=1, var_15=1, var_15_arg_0=1, var_15_arg_1=0, var_16=0, var_16_arg_0=0, var_17=2, var_18=0, var_18_arg_0=0, var_18_arg_1=2, var_19_arg_0=1, var_19_arg_1=0, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0, var_9=0, var_9_arg_0=0] [L90] SORT_1 var_19 = var_19_arg_0 | var_19_arg_1; [L91] SORT_4 var_20_arg_0 = state_6; VAL [init_7_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=128, msb_SORT_52=2, msb_SORT_54=4, msb_SORT_8=2147483648, state_6=0, var_10=0, var_11=1, var_11_arg_0=0, var_11_arg_1=0, var_12=0, var_12_arg_0=0, var_13=1, var_14=0, var_14_arg_0=0, var_14_arg_1=1, var_15=1, var_15_arg_0=1, var_15_arg_1=0, var_16=0, var_16_arg_0=0, var_17=2, var_18=0, var_18_arg_0=0, var_18_arg_1=2, var_19=1, var_19_arg_0=1, var_19_arg_1=0, var_20_arg_0=0, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0, var_9=0, var_9_arg_0=0] [L92] EXPR var_20_arg_0 & mask_SORT_4 VAL [init_7_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=128, msb_SORT_52=2, msb_SORT_54=4, msb_SORT_8=2147483648, state_6=0, var_10=0, var_11=1, var_11_arg_0=0, var_11_arg_1=0, var_12=0, var_12_arg_0=0, var_13=1, var_14=0, var_14_arg_0=0, var_14_arg_1=1, var_15=1, var_15_arg_0=1, var_15_arg_1=0, var_16=0, var_16_arg_0=0, var_17=2, var_18=0, var_18_arg_0=0, var_18_arg_1=2, var_19=1, var_19_arg_0=1, var_19_arg_1=0, var_20_arg_0=0, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0, var_9=0, var_9_arg_0=0] [L92] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L93] SORT_8 var_20 = var_20_arg_0; [L94] SORT_8 var_22_arg_0 = var_20; [L95] SORT_8 var_22_arg_1 = var_21; [L96] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L97] SORT_1 var_23_arg_0 = var_19; [L98] SORT_1 var_23_arg_1 = var_22; VAL [init_7_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=128, msb_SORT_52=2, msb_SORT_54=4, msb_SORT_8=2147483648, state_6=0, var_10=0, var_11=1, var_11_arg_0=0, var_11_arg_1=0, var_12=0, var_12_arg_0=0, var_13=1, var_14=0, var_14_arg_0=0, var_14_arg_1=1, var_15=1, var_15_arg_0=1, var_15_arg_1=0, var_16=0, var_16_arg_0=0, var_17=2, var_18=0, var_18_arg_0=0, var_18_arg_1=2, var_19=1, var_19_arg_0=1, var_19_arg_1=0, var_20=0, var_20_arg_0=0, var_21=3, var_22=0, var_22_arg_0=0, var_22_arg_1=3, var_23_arg_0=1, var_23_arg_1=0, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0, var_9=0, var_9_arg_0=0] [L99] EXPR var_23_arg_0 | var_23_arg_1 VAL [init_7_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=128, msb_SORT_52=2, msb_SORT_54=4, msb_SORT_8=2147483648, state_6=0, var_10=0, var_11=1, var_11_arg_0=0, var_11_arg_1=0, var_12=0, var_12_arg_0=0, var_13=1, var_14=0, var_14_arg_0=0, var_14_arg_1=1, var_15=1, var_15_arg_0=1, var_15_arg_1=0, var_16=0, var_16_arg_0=0, var_17=2, var_18=0, var_18_arg_0=0, var_18_arg_1=2, var_19=1, var_19_arg_0=1, var_19_arg_1=0, var_20=0, var_20_arg_0=0, var_21=3, var_22=0, var_22_arg_0=0, var_22_arg_1=3, var_23_arg_0=1, var_23_arg_1=0, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0, var_9=0, var_9_arg_0=0] [L99] SORT_1 var_23 = var_23_arg_0 | var_23_arg_1; [L100] SORT_4 var_24_arg_0 = state_6; VAL [init_7_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=128, msb_SORT_52=2, msb_SORT_54=4, msb_SORT_8=2147483648, state_6=0, var_10=0, var_11=1, var_11_arg_0=0, var_11_arg_1=0, var_12=0, var_12_arg_0=0, var_13=1, var_14=0, var_14_arg_0=0, var_14_arg_1=1, var_15=1, var_15_arg_0=1, var_15_arg_1=0, var_16=0, var_16_arg_0=0, var_17=2, var_18=0, var_18_arg_0=0, var_18_arg_1=2, var_19=1, var_19_arg_0=1, var_19_arg_1=0, var_20=0, var_20_arg_0=0, var_21=3, var_22=0, var_22_arg_0=0, var_22_arg_1=3, var_23=1, var_23_arg_0=1, var_23_arg_1=0, var_24_arg_0=0, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0, var_9=0, var_9_arg_0=0] [L101] EXPR var_24_arg_0 & mask_SORT_4 VAL [init_7_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=128, msb_SORT_52=2, msb_SORT_54=4, msb_SORT_8=2147483648, state_6=0, var_10=0, var_11=1, var_11_arg_0=0, var_11_arg_1=0, var_12=0, var_12_arg_0=0, var_13=1, var_14=0, var_14_arg_0=0, var_14_arg_1=1, var_15=1, var_15_arg_0=1, var_15_arg_1=0, var_16=0, var_16_arg_0=0, var_17=2, var_18=0, var_18_arg_0=0, var_18_arg_1=2, var_19=1, var_19_arg_0=1, var_19_arg_1=0, var_20=0, var_20_arg_0=0, var_21=3, var_22=0, var_22_arg_0=0, var_22_arg_1=3, var_23=1, var_23_arg_0=1, var_23_arg_1=0, var_24_arg_0=0, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0, var_9=0, var_9_arg_0=0] [L101] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L102] SORT_8 var_24 = var_24_arg_0; [L103] SORT_8 var_26_arg_0 = var_24; [L104] SORT_8 var_26_arg_1 = var_25; [L105] SORT_1 var_26 = var_26_arg_0 == var_26_arg_1; [L106] SORT_1 var_27_arg_0 = var_23; [L107] SORT_1 var_27_arg_1 = var_26; VAL [init_7_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=128, msb_SORT_52=2, msb_SORT_54=4, msb_SORT_8=2147483648, state_6=0, var_10=0, var_11=1, var_11_arg_0=0, var_11_arg_1=0, var_12=0, var_12_arg_0=0, var_13=1, var_14=0, var_14_arg_0=0, var_14_arg_1=1, var_15=1, var_15_arg_0=1, var_15_arg_1=0, var_16=0, var_16_arg_0=0, var_17=2, var_18=0, var_18_arg_0=0, var_18_arg_1=2, var_19=1, var_19_arg_0=1, var_19_arg_1=0, var_20=0, var_20_arg_0=0, var_21=3, var_22=0, var_22_arg_0=0, var_22_arg_1=3, var_23=1, var_23_arg_0=1, var_23_arg_1=0, var_24=0, var_24_arg_0=0, var_25=4, var_26=0, var_26_arg_0=0, var_26_arg_1=4, var_27_arg_0=1, var_27_arg_1=0, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0, var_9=0, var_9_arg_0=0] [L108] EXPR var_27_arg_0 | var_27_arg_1 VAL [init_7_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=128, msb_SORT_52=2, msb_SORT_54=4, msb_SORT_8=2147483648, state_6=0, var_10=0, var_11=1, var_11_arg_0=0, var_11_arg_1=0, var_12=0, var_12_arg_0=0, var_13=1, var_14=0, var_14_arg_0=0, var_14_arg_1=1, var_15=1, var_15_arg_0=1, var_15_arg_1=0, var_16=0, var_16_arg_0=0, var_17=2, var_18=0, var_18_arg_0=0, var_18_arg_1=2, var_19=1, var_19_arg_0=1, var_19_arg_1=0, var_20=0, var_20_arg_0=0, var_21=3, var_22=0, var_22_arg_0=0, var_22_arg_1=3, var_23=1, var_23_arg_0=1, var_23_arg_1=0, var_24=0, var_24_arg_0=0, var_25=4, var_26=0, var_26_arg_0=0, var_26_arg_1=4, var_27_arg_0=1, var_27_arg_1=0, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0, var_9=0, var_9_arg_0=0] [L108] SORT_1 var_27 = var_27_arg_0 | var_27_arg_1; [L109] SORT_1 var_31_arg_0 = var_27; [L110] SORT_1 var_31 = ~var_31_arg_0; [L111] SORT_1 var_32_arg_0 = var_30; [L112] SORT_1 var_32_arg_1 = var_31; VAL [init_7_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=128, msb_SORT_52=2, msb_SORT_54=4, msb_SORT_8=2147483648, state_6=0, var_10=0, var_11=1, var_11_arg_0=0, var_11_arg_1=0, var_12=0, var_12_arg_0=0, var_13=1, var_14=0, var_14_arg_0=0, var_14_arg_1=1, var_15=1, var_15_arg_0=1, var_15_arg_1=0, var_16=0, var_16_arg_0=0, var_17=2, var_18=0, var_18_arg_0=0, var_18_arg_1=2, var_19=1, var_19_arg_0=1, var_19_arg_1=0, var_20=0, var_20_arg_0=0, var_21=3, var_22=0, var_22_arg_0=0, var_22_arg_1=3, var_23=1, var_23_arg_0=1, var_23_arg_1=0, var_24=0, var_24_arg_0=0, var_25=4, var_26=0, var_26_arg_0=0, var_26_arg_1=4, var_27=1, var_27_arg_0=1, var_27_arg_1=0, var_30=1, var_31=254, var_31_arg_0=1, var_32_arg_0=1, var_32_arg_1=254, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0, var_9=0, var_9_arg_0=0] [L113] EXPR var_32_arg_0 & var_32_arg_1 VAL [init_7_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=128, msb_SORT_52=2, msb_SORT_54=4, msb_SORT_8=2147483648, state_6=0, var_10=0, var_11=1, var_11_arg_0=0, var_11_arg_1=0, var_12=0, var_12_arg_0=0, var_13=1, var_14=0, var_14_arg_0=0, var_14_arg_1=1, var_15=1, var_15_arg_0=1, var_15_arg_1=0, var_16=0, var_16_arg_0=0, var_17=2, var_18=0, var_18_arg_0=0, var_18_arg_1=2, var_19=1, var_19_arg_0=1, var_19_arg_1=0, var_20=0, var_20_arg_0=0, var_21=3, var_22=0, var_22_arg_0=0, var_22_arg_1=3, var_23=1, var_23_arg_0=1, var_23_arg_1=0, var_24=0, var_24_arg_0=0, var_25=4, var_26=0, var_26_arg_0=0, var_26_arg_1=4, var_27=1, var_27_arg_0=1, var_27_arg_1=0, var_30=1, var_31=254, var_31_arg_0=1, var_32_arg_0=1, var_32_arg_1=254, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0, var_9=0, var_9_arg_0=0] [L113] SORT_1 var_32 = var_32_arg_0 & var_32_arg_1; [L114] EXPR var_32 & mask_SORT_1 VAL [init_7_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=128, msb_SORT_52=2, msb_SORT_54=4, msb_SORT_8=2147483648, state_6=0, var_10=0, var_11=1, var_11_arg_0=0, var_11_arg_1=0, var_12=0, var_12_arg_0=0, var_13=1, var_14=0, var_14_arg_0=0, var_14_arg_1=1, var_15=1, var_15_arg_0=1, var_15_arg_1=0, var_16=0, var_16_arg_0=0, var_17=2, var_18=0, var_18_arg_0=0, var_18_arg_1=2, var_19=1, var_19_arg_0=1, var_19_arg_1=0, var_20=0, var_20_arg_0=0, var_21=3, var_22=0, var_22_arg_0=0, var_22_arg_1=3, var_23=1, var_23_arg_0=1, var_23_arg_1=0, var_24=0, var_24_arg_0=0, var_25=4, var_26=0, var_26_arg_0=0, var_26_arg_1=4, var_27=1, var_27_arg_0=1, var_27_arg_1=0, var_30=1, var_31=254, var_31_arg_0=1, var_32=1, var_32_arg_0=1, var_32_arg_1=254, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0, var_9=0, var_9_arg_0=0] [L114] var_32 = var_32 & mask_SORT_1 [L115] SORT_1 bad_33_arg_0 = var_32; [L116] CALL __VERIFIER_assert(!(bad_33_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9211 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9211 mSDsluCounter, 9558 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7992 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1759 IncrementalHoareTripleChecker+Invalid, 1769 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 1566 mSDtfsCounter, 1759 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 325 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6178 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=13, InterpolantAutomatonStates: 272, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 2799 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 469 NumberOfCodeBlocks, 469 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 420 ConstructedInterpolants, 0 QuantifiedInterpolants, 1559 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 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 19:30:24,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...