/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.cal51.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 19:12:42,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 19:12:42,932 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:12:42,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 19:12:42,938 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 19:12:42,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 19:12:42,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 19:12:42,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 19:12:42,961 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 19:12:42,964 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 19:12:42,964 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 19:12:42,964 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 19:12:42,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 19:12:42,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 19:12:42,966 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 19:12:42,966 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 19:12:42,966 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 19:12:42,966 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 19:12:42,967 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 19:12:42,967 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 19:12:42,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 19:12:42,967 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 19:12:42,967 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 19:12:42,967 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 19:12:42,968 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 19:12:42,968 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 19:12:42,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 19:12:42,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 19:12:42,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 19:12:42,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:12:42,969 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 19:12:42,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 19:12:42,970 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 19:12:42,970 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 19:12:42,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 19:12:42,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 19:12:42,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 19:12:42,970 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 19:12:42,970 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 19:12:42,970 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 19:12:42,971 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:12:43,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 19:12:43,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 19:12:43,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 19:12:43,186 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 19:12:43,186 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 19:12:43,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cal51.c [2023-12-16 19:12:44,208 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 19:12:44,357 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 19:12:44,357 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cal51.c [2023-12-16 19:12:44,372 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5535ddb2/41253265c62444599ad6027d86daedd5/FLAG98a0bbef6 [2023-12-16 19:12:44,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5535ddb2/41253265c62444599ad6027d86daedd5 [2023-12-16 19:12:44,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 19:12:44,384 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 19:12:44,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 19:12:44,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 19:12:44,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 19:12:44,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:12:44" (1/1) ... [2023-12-16 19:12:44,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58db8880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:44, skipping insertion in model container [2023-12-16 19:12:44,390 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:12:44" (1/1) ... [2023-12-16 19:12:44,408 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 19:12:44,500 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.cal51.c[1245,1258] [2023-12-16 19:12:44,549 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:12:44,556 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 19:12:44,564 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.cal51.c[1245,1258] [2023-12-16 19:12:44,589 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:12:44,598 INFO L206 MainTranslator]: Completed translation [2023-12-16 19:12:44,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:44 WrapperNode [2023-12-16 19:12:44,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 19:12:44,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 19:12:44,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 19:12:44,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 19:12:44,604 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:12:44" (1/1) ... [2023-12-16 19:12:44,617 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:12:44" (1/1) ... [2023-12-16 19:12:44,698 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 412 [2023-12-16 19:12:44,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 19:12:44,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 19:12:44,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 19:12:44,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 19:12:44,722 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:44" (1/1) ... [2023-12-16 19:12:44,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:44" (1/1) ... [2023-12-16 19:12:44,746 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:44" (1/1) ... [2023-12-16 19:12:44,773 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-12-16 19:12:44,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:44" (1/1) ... [2023-12-16 19:12:44,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:44" (1/1) ... [2023-12-16 19:12:44,800 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:44" (1/1) ... [2023-12-16 19:12:44,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:44" (1/1) ... [2023-12-16 19:12:44,809 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:44" (1/1) ... [2023-12-16 19:12:44,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:44" (1/1) ... [2023-12-16 19:12:44,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 19:12:44,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 19:12:44,837 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 19:12:44,837 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 19:12:44,837 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:44" (1/1) ... [2023-12-16 19:12:44,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:12:44,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:12:44,874 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:12:44,900 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:12:44,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 19:12:44,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 19:12:44,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 19:12:44,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 19:12:44,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 19:12:45,006 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 19:12:45,008 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 19:12:45,392 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 19:12:45,420 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 19:12:45,421 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 19:12:45,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:12:45 BoogieIcfgContainer [2023-12-16 19:12:45,422 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 19:12:45,427 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 19:12:45,427 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 19:12:45,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 19:12:45,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:12:44" (1/3) ... [2023-12-16 19:12:45,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63dc04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:12:45, skipping insertion in model container [2023-12-16 19:12:45,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:44" (2/3) ... [2023-12-16 19:12:45,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63dc04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:12:45, skipping insertion in model container [2023-12-16 19:12:45,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:12:45" (3/3) ... [2023-12-16 19:12:45,431 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal51.c [2023-12-16 19:12:45,443 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 19:12:45,443 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 19:12:45,483 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 19:12:45,488 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;@4a1d51df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 19:12:45,489 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 19:12:45,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 66 states have (on average 1.6666666666666667) internal successors, (110), 67 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:45,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 19:12:45,498 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:12:45,498 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, 1, 1] [2023-12-16 19:12:45,499 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:12:45,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:12:45,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1434189855, now seen corresponding path program 1 times [2023-12-16 19:12:45,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:12:45,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601700162] [2023-12-16 19:12:45,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:12:45,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:12:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:12:46,052 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:12:46,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:12:46,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601700162] [2023-12-16 19:12:46,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601700162] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:12:46,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:12:46,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:12:46,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125123327] [2023-12-16 19:12:46,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:12:46,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:12:46,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:12:46,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:12:46,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:12:46,086 INFO L87 Difference]: Start difference. First operand has 68 states, 66 states have (on average 1.6666666666666667) internal successors, (110), 67 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:46,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:12:46,134 INFO L93 Difference]: Finished difference Result 123 states and 201 transitions. [2023-12-16 19:12:46,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:12:46,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-12-16 19:12:46,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:12:46,142 INFO L225 Difference]: With dead ends: 123 [2023-12-16 19:12:46,142 INFO L226 Difference]: Without dead ends: 68 [2023-12-16 19:12:46,143 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:12:46,146 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 304 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:12:46,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 304 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:12:46,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-16 19:12:46,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-12-16 19:12:46,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 67 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:46,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 108 transitions. [2023-12-16 19:12:46,169 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 108 transitions. Word has length 38 [2023-12-16 19:12:46,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:12:46,171 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 108 transitions. [2023-12-16 19:12:46,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:46,171 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 108 transitions. [2023-12-16 19:12:46,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-16 19:12:46,172 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:12:46,172 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, 1, 1, 1] [2023-12-16 19:12:46,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 19:12:46,172 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:12:46,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:12:46,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1511937697, now seen corresponding path program 1 times [2023-12-16 19:12:46,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:12:46,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170753238] [2023-12-16 19:12:46,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:12:46,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:12:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:12:46,302 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:12:46,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:12:46,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170753238] [2023-12-16 19:12:46,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170753238] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:12:46,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:12:46,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:12:46,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014524649] [2023-12-16 19:12:46,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:12:46,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:12:46,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:12:46,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:12:46,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:12:46,310 INFO L87 Difference]: Start difference. First operand 68 states and 108 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:46,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:12:46,345 INFO L93 Difference]: Finished difference Result 126 states and 199 transitions. [2023-12-16 19:12:46,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:12:46,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-12-16 19:12:46,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:12:46,348 INFO L225 Difference]: With dead ends: 126 [2023-12-16 19:12:46,348 INFO L226 Difference]: Without dead ends: 71 [2023-12-16 19:12:46,348 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:12:46,349 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 302 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:12:46,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 302 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:12:46,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-16 19:12:46,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2023-12-16 19:12:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.5942028985507246) internal successors, (110), 69 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:46,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 110 transitions. [2023-12-16 19:12:46,354 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 110 transitions. Word has length 39 [2023-12-16 19:12:46,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:12:46,354 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 110 transitions. [2023-12-16 19:12:46,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:46,354 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 110 transitions. [2023-12-16 19:12:46,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-16 19:12:46,355 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:12:46,355 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, 1, 1, 1, 1] [2023-12-16 19:12:46,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 19:12:46,355 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:12:46,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:12:46,355 INFO L85 PathProgramCache]: Analyzing trace with hash -585003911, now seen corresponding path program 1 times [2023-12-16 19:12:46,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:12:46,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399591004] [2023-12-16 19:12:46,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:12:46,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:12:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:12:46,596 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:12:46,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:12:46,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399591004] [2023-12-16 19:12:46,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399591004] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:12:46,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:12:46,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:12:46,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32889593] [2023-12-16 19:12:46,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:12:46,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:12:46,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:12:46,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:12:46,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:12:46,602 INFO L87 Difference]: Start difference. First operand 70 states and 110 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:46,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:12:46,699 INFO L93 Difference]: Finished difference Result 172 states and 268 transitions. [2023-12-16 19:12:46,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 19:12:46,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-12-16 19:12:46,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:12:46,702 INFO L225 Difference]: With dead ends: 172 [2023-12-16 19:12:46,702 INFO L226 Difference]: Without dead ends: 70 [2023-12-16 19:12:46,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:12:46,704 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 44 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:12:46,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 270 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:12:46,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-16 19:12:46,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-12-16 19:12:46,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.5797101449275361) internal successors, (109), 69 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:12:46,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 109 transitions. [2023-12-16 19:12:46,711 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 109 transitions. Word has length 40 [2023-12-16 19:12:46,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:12:46,711 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 109 transitions. [2023-12-16 19:12:46,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:46,711 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 109 transitions. [2023-12-16 19:12:46,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-16 19:12:46,712 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:12:46,712 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, 1, 1, 1, 1, 1] [2023-12-16 19:12:46,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 19:12:46,713 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:12:46,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:12:46,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1807209681, now seen corresponding path program 1 times [2023-12-16 19:12:46,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:12:46,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879615118] [2023-12-16 19:12:46,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:12:46,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:12:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:12:47,036 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:12:47,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:12:47,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879615118] [2023-12-16 19:12:47,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879615118] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:12:47,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:12:47,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:12:47,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720122211] [2023-12-16 19:12:47,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:12:47,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:12:47,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:12:47,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:12:47,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:12:47,039 INFO L87 Difference]: Start difference. First operand 70 states and 109 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:47,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:12:47,142 INFO L93 Difference]: Finished difference Result 215 states and 335 transitions. [2023-12-16 19:12:47,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 19:12:47,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-12-16 19:12:47,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:12:47,147 INFO L225 Difference]: With dead ends: 215 [2023-12-16 19:12:47,147 INFO L226 Difference]: Without dead ends: 158 [2023-12-16 19:12:47,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-16 19:12:47,154 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 456 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 437 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:12:47,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 437 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:12:47,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-12-16 19:12:47,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 102. [2023-12-16 19:12:47,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.5841584158415842) internal successors, (160), 101 states have internal predecessors, (160), 0 states have call successors, (0), 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:12:47,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 160 transitions. [2023-12-16 19:12:47,166 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 160 transitions. Word has length 41 [2023-12-16 19:12:47,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:12:47,166 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 160 transitions. [2023-12-16 19:12:47,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:47,166 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 160 transitions. [2023-12-16 19:12:47,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-16 19:12:47,169 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:12:47,170 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, 1, 1, 1, 1, 1, 1] [2023-12-16 19:12:47,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 19:12:47,170 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:12:47,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:12:47,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1788832239, now seen corresponding path program 1 times [2023-12-16 19:12:47,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:12:47,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352129756] [2023-12-16 19:12:47,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:12:47,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:12:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:12:47,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:12:47,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:12:47,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352129756] [2023-12-16 19:12:47,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352129756] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:12:47,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:12:47,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 19:12:47,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654185681] [2023-12-16 19:12:47,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:12:47,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 19:12:47,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:12:47,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 19:12:47,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:12:47,383 INFO L87 Difference]: Start difference. First operand 102 states and 160 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:47,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:12:47,558 INFO L93 Difference]: Finished difference Result 265 states and 412 transitions. [2023-12-16 19:12:47,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 19:12:47,559 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-12-16 19:12:47,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:12:47,560 INFO L225 Difference]: With dead ends: 265 [2023-12-16 19:12:47,560 INFO L226 Difference]: Without dead ends: 208 [2023-12-16 19:12:47,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2023-12-16 19:12:47,560 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 731 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:12:47,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 722 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:12:47,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-12-16 19:12:47,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 105. [2023-12-16 19:12:47,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.5769230769230769) internal successors, (164), 104 states have internal predecessors, (164), 0 states have call successors, (0), 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:12:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 164 transitions. [2023-12-16 19:12:47,566 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 164 transitions. Word has length 42 [2023-12-16 19:12:47,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:12:47,566 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 164 transitions. [2023-12-16 19:12:47,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:47,566 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 164 transitions. [2023-12-16 19:12:47,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-16 19:12:47,567 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:12:47,567 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, 1, 1, 1, 1, 1, 1] [2023-12-16 19:12:47,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 19:12:47,567 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:12:47,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:12:47,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1395805229, now seen corresponding path program 1 times [2023-12-16 19:12:47,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:12:47,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146918007] [2023-12-16 19:12:47,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:12:47,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:12:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:12:47,829 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:12:47,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:12:47,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146918007] [2023-12-16 19:12:47,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146918007] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:12:47,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:12:47,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 19:12:47,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724580204] [2023-12-16 19:12:47,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:12:47,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 19:12:47,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:12:47,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 19:12:47,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-16 19:12:47,831 INFO L87 Difference]: Start difference. First operand 105 states and 164 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:48,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:12:48,114 INFO L93 Difference]: Finished difference Result 266 states and 414 transitions. [2023-12-16 19:12:48,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 19:12:48,115 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-12-16 19:12:48,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:12:48,116 INFO L225 Difference]: With dead ends: 266 [2023-12-16 19:12:48,116 INFO L226 Difference]: Without dead ends: 209 [2023-12-16 19:12:48,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2023-12-16 19:12:48,116 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 611 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:12:48,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 1039 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:12:48,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-12-16 19:12:48,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 108. [2023-12-16 19:12:48,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.5700934579439252) internal successors, (168), 107 states have internal predecessors, (168), 0 states have call successors, (0), 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:12:48,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 168 transitions. [2023-12-16 19:12:48,121 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 168 transitions. Word has length 42 [2023-12-16 19:12:48,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:12:48,121 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 168 transitions. [2023-12-16 19:12:48,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:48,121 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 168 transitions. [2023-12-16 19:12:48,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-16 19:12:48,122 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:12:48,122 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, 1, 1, 1, 1, 1, 1] [2023-12-16 19:12:48,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 19:12:48,122 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:12:48,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:12:48,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1124154705, now seen corresponding path program 1 times [2023-12-16 19:12:48,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:12:48,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207726847] [2023-12-16 19:12:48,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:12:48,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:12:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:12:48,285 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:12:48,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:12:48,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207726847] [2023-12-16 19:12:48,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207726847] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:12:48,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:12:48,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:12:48,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87795714] [2023-12-16 19:12:48,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:12:48,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:12:48,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:12:48,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:12:48,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:12:48,287 INFO L87 Difference]: Start difference. First operand 108 states and 168 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:48,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:12:48,303 INFO L93 Difference]: Finished difference Result 188 states and 291 transitions. [2023-12-16 19:12:48,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:12:48,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-12-16 19:12:48,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:12:48,304 INFO L225 Difference]: With dead ends: 188 [2023-12-16 19:12:48,304 INFO L226 Difference]: Without dead ends: 108 [2023-12-16 19:12:48,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:12:48,305 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 162 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:12:48,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 191 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:12:48,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-16 19:12:48,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2023-12-16 19:12:48,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.5514018691588785) internal successors, (166), 107 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:12:48,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 166 transitions. [2023-12-16 19:12:48,312 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 166 transitions. Word has length 42 [2023-12-16 19:12:48,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:12:48,313 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 166 transitions. [2023-12-16 19:12:48,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 166 transitions. [2023-12-16 19:12:48,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-16 19:12:48,315 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:12:48,315 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:12:48,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 19:12:48,315 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:12:48,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:12:48,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1798482797, now seen corresponding path program 1 times [2023-12-16 19:12:48,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:12:48,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084180389] [2023-12-16 19:12:48,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:12:48,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:12:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:12:48,453 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:12:48,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:12:48,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084180389] [2023-12-16 19:12:48,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084180389] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:12:48,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:12:48,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:12:48,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337966658] [2023-12-16 19:12:48,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:12:48,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:12:48,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:12:48,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:12:48,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:12:48,455 INFO L87 Difference]: Start difference. First operand 108 states and 166 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:48,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:12:48,580 INFO L93 Difference]: Finished difference Result 273 states and 416 transitions. [2023-12-16 19:12:48,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:12:48,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-12-16 19:12:48,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:12:48,582 INFO L225 Difference]: With dead ends: 273 [2023-12-16 19:12:48,582 INFO L226 Difference]: Without dead ends: 193 [2023-12-16 19:12:48,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:12:48,584 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 242 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:12:48,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 198 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:12:48,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-12-16 19:12:48,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 114. [2023-12-16 19:12:48,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.5221238938053097) internal successors, (172), 113 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:48,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 172 transitions. [2023-12-16 19:12:48,594 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 172 transitions. Word has length 43 [2023-12-16 19:12:48,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:12:48,595 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 172 transitions. [2023-12-16 19:12:48,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:48,595 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 172 transitions. [2023-12-16 19:12:48,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-16 19:12:48,597 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:12:48,597 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:12:48,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 19:12:48,597 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:12:48,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:12:48,598 INFO L85 PathProgramCache]: Analyzing trace with hash -6955537, now seen corresponding path program 1 times [2023-12-16 19:12:48,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:12:48,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695688497] [2023-12-16 19:12:48,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:12:48,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:12:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:12:48,748 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:12:48,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:12:48,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695688497] [2023-12-16 19:12:48,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695688497] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:12:48,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:12:48,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:12:48,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076109972] [2023-12-16 19:12:48,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:12:48,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:12:48,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:12:48,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:12:48,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:12:48,751 INFO L87 Difference]: Start difference. First operand 114 states and 172 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:48,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:12:48,809 INFO L93 Difference]: Finished difference Result 188 states and 282 transitions. [2023-12-16 19:12:48,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:12:48,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-12-16 19:12:48,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:12:48,810 INFO L225 Difference]: With dead ends: 188 [2023-12-16 19:12:48,810 INFO L226 Difference]: Without dead ends: 114 [2023-12-16 19:12:48,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:12:48,813 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 92 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:12:48,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 126 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:12:48,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-16 19:12:48,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2023-12-16 19:12:48,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.5044247787610618) internal successors, (170), 113 states have internal predecessors, (170), 0 states have call successors, (0), 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:12:48,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 170 transitions. [2023-12-16 19:12:48,825 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 170 transitions. Word has length 43 [2023-12-16 19:12:48,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:12:48,825 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 170 transitions. [2023-12-16 19:12:48,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:48,825 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 170 transitions. [2023-12-16 19:12:48,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-16 19:12:48,827 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:12:48,827 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:12:48,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 19:12:48,827 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:12:48,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:12:48,830 INFO L85 PathProgramCache]: Analyzing trace with hash 222413919, now seen corresponding path program 1 times [2023-12-16 19:12:48,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:12:48,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624368067] [2023-12-16 19:12:48,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:12:48,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:12:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:12:48,961 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:12:48,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:12:48,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624368067] [2023-12-16 19:12:48,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624368067] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:12:48,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:12:48,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 19:12:48,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832219103] [2023-12-16 19:12:48,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:12:48,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:12:48,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:12:48,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:12:48,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:12:48,963 INFO L87 Difference]: Start difference. First operand 114 states and 170 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:49,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:12:49,019 INFO L93 Difference]: Finished difference Result 194 states and 290 transitions. [2023-12-16 19:12:49,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:12:49,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-12-16 19:12:49,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:12:49,019 INFO L225 Difference]: With dead ends: 194 [2023-12-16 19:12:49,020 INFO L226 Difference]: Without dead ends: 108 [2023-12-16 19:12:49,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:12:49,020 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 86 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:12:49,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 126 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:12:49,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-16 19:12:49,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2023-12-16 19:12:49,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.514018691588785) internal successors, (162), 107 states have internal predecessors, (162), 0 states have call successors, (0), 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:12:49,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 162 transitions. [2023-12-16 19:12:49,028 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 162 transitions. Word has length 44 [2023-12-16 19:12:49,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:12:49,028 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 162 transitions. [2023-12-16 19:12:49,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:49,028 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 162 transitions. [2023-12-16 19:12:49,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-16 19:12:49,028 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:12:49,028 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:12:49,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 19:12:49,029 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:12:49,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:12:49,029 INFO L85 PathProgramCache]: Analyzing trace with hash -2015311837, now seen corresponding path program 1 times [2023-12-16 19:12:49,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:12:49,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600147885] [2023-12-16 19:12:49,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:12:49,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:12:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:12:49,264 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:12:49,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:12:49,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600147885] [2023-12-16 19:12:49,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600147885] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:12:49,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:12:49,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 19:12:49,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959820544] [2023-12-16 19:12:49,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:12:49,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 19:12:49,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:12:49,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 19:12:49,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:12:49,265 INFO L87 Difference]: Start difference. First operand 108 states and 162 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:49,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:12:49,432 INFO L93 Difference]: Finished difference Result 257 states and 381 transitions. [2023-12-16 19:12:49,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 19:12:49,432 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-12-16 19:12:49,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:12:49,433 INFO L225 Difference]: With dead ends: 257 [2023-12-16 19:12:49,433 INFO L226 Difference]: Without dead ends: 189 [2023-12-16 19:12:49,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-12-16 19:12:49,434 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 160 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:12:49,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 805 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:12:49,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-12-16 19:12:49,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 120. [2023-12-16 19:12:49,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.4789915966386555) internal successors, (176), 119 states have internal predecessors, (176), 0 states have call successors, (0), 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:12:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2023-12-16 19:12:49,438 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 44 [2023-12-16 19:12:49,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:12:49,439 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2023-12-16 19:12:49,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2023-12-16 19:12:49,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-16 19:12:49,439 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:12:49,439 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:12:49,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 19:12:49,439 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:12:49,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:12:49,440 INFO L85 PathProgramCache]: Analyzing trace with hash 691307557, now seen corresponding path program 1 times [2023-12-16 19:12:49,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:12:49,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510435667] [2023-12-16 19:12:49,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:12:49,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:12:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:12:49,650 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:12:49,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:12:49,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510435667] [2023-12-16 19:12:49,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510435667] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:12:49,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:12:49,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:12:49,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397396233] [2023-12-16 19:12:49,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:12:49,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 19:12:49,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:12:49,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 19:12:49,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:12:49,651 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:49,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:12:49,721 INFO L93 Difference]: Finished difference Result 217 states and 316 transitions. [2023-12-16 19:12:49,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 19:12:49,722 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-12-16 19:12:49,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:12:49,725 INFO L225 Difference]: With dead ends: 217 [2023-12-16 19:12:49,725 INFO L226 Difference]: Without dead ends: 128 [2023-12-16 19:12:49,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-12-16 19:12:49,727 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 186 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:12:49,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 382 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:12:49,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-16 19:12:49,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2023-12-16 19:12:49,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.456) internal successors, (182), 125 states have internal predecessors, (182), 0 states have call successors, (0), 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:12:49,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 182 transitions. [2023-12-16 19:12:49,732 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 182 transitions. Word has length 44 [2023-12-16 19:12:49,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:12:49,732 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 182 transitions. [2023-12-16 19:12:49,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:49,732 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 182 transitions. [2023-12-16 19:12:49,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-16 19:12:49,732 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:12:49,732 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:12:49,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 19:12:49,732 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:12:49,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:12:49,733 INFO L85 PathProgramCache]: Analyzing trace with hash 557294051, now seen corresponding path program 1 times [2023-12-16 19:12:49,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:12:49,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931321681] [2023-12-16 19:12:49,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:12:49,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:12:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:12:49,897 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:12:49,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:12:49,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931321681] [2023-12-16 19:12:49,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931321681] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:12:49,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:12:49,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:12:49,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009280350] [2023-12-16 19:12:49,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:12:49,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:12:49,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:12:49,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:12:49,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:12:49,899 INFO L87 Difference]: Start difference. First operand 126 states and 182 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:49,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:12:49,916 INFO L93 Difference]: Finished difference Result 200 states and 289 transitions. [2023-12-16 19:12:49,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:12:49,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-12-16 19:12:49,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:12:49,917 INFO L225 Difference]: With dead ends: 200 [2023-12-16 19:12:49,917 INFO L226 Difference]: Without dead ends: 120 [2023-12-16 19:12:49,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:12:49,918 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 146 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:12:49,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 220 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:12:49,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-16 19:12:49,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-12-16 19:12:49,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.4453781512605042) internal successors, (172), 119 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:49,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 172 transitions. [2023-12-16 19:12:49,922 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 172 transitions. Word has length 44 [2023-12-16 19:12:49,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:12:49,922 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 172 transitions. [2023-12-16 19:12:49,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:49,922 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 172 transitions. [2023-12-16 19:12:49,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-16 19:12:49,922 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:12:49,922 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:12:49,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 19:12:49,922 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:12:49,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:12:49,923 INFO L85 PathProgramCache]: Analyzing trace with hash 756132757, now seen corresponding path program 1 times [2023-12-16 19:12:49,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:12:49,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202462647] [2023-12-16 19:12:49,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:12:49,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:12:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:12:50,048 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:12:50,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:12:50,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202462647] [2023-12-16 19:12:50,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202462647] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:12:50,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:12:50,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 19:12:50,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801572912] [2023-12-16 19:12:50,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:12:50,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:12:50,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:12:50,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:12:50,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:12:50,050 INFO L87 Difference]: Start difference. First operand 120 states and 172 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:50,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:12:50,098 INFO L93 Difference]: Finished difference Result 191 states and 274 transitions. [2023-12-16 19:12:50,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:12:50,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2023-12-16 19:12:50,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:12:50,099 INFO L225 Difference]: With dead ends: 191 [2023-12-16 19:12:50,100 INFO L226 Difference]: Without dead ends: 114 [2023-12-16 19:12:50,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:12:50,100 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 74 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:12:50,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 124 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:12:50,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-16 19:12:50,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2023-12-16 19:12:50,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.4513274336283186) internal successors, (164), 113 states have internal predecessors, (164), 0 states have call successors, (0), 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:12:50,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2023-12-16 19:12:50,105 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 45 [2023-12-16 19:12:50,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:12:50,105 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2023-12-16 19:12:50,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:50,105 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2023-12-16 19:12:50,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-16 19:12:50,105 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:12:50,105 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:12:50,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 19:12:50,105 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:12:50,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:12:50,106 INFO L85 PathProgramCache]: Analyzing trace with hash 41851729, now seen corresponding path program 1 times [2023-12-16 19:12:50,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:12:50,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775412881] [2023-12-16 19:12:50,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:12:50,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:12:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:12:50,388 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:12:50,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:12:50,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775412881] [2023-12-16 19:12:50,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775412881] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:12:50,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:12:50,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 19:12:50,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840149500] [2023-12-16 19:12:50,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:12:50,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 19:12:50,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:12:50,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 19:12:50,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:12:50,390 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:12:50,549 INFO L93 Difference]: Finished difference Result 320 states and 448 transitions. [2023-12-16 19:12:50,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 19:12:50,549 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2023-12-16 19:12:50,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:12:50,550 INFO L225 Difference]: With dead ends: 320 [2023-12-16 19:12:50,550 INFO L226 Difference]: Without dead ends: 252 [2023-12-16 19:12:50,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-16 19:12:50,552 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 323 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:12:50,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 616 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:12:50,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-12-16 19:12:50,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 162. [2023-12-16 19:12:50,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.391304347826087) internal successors, (224), 161 states have internal predecessors, (224), 0 states have call successors, (0), 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:12:50,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 224 transitions. [2023-12-16 19:12:50,556 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 224 transitions. Word has length 45 [2023-12-16 19:12:50,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:12:50,556 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 224 transitions. [2023-12-16 19:12:50,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:50,557 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 224 transitions. [2023-12-16 19:12:50,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-16 19:12:50,557 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:12:50,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:12:50,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 19:12:50,557 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:12:50,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:12:50,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1238011949, now seen corresponding path program 1 times [2023-12-16 19:12:50,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:12:50,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197884649] [2023-12-16 19:12:50,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:12:50,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:12:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:12:50,884 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:12:50,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:12:50,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197884649] [2023-12-16 19:12:50,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197884649] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:12:50,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:12:50,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 19:12:50,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920559434] [2023-12-16 19:12:50,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:12:50,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 19:12:50,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:12:50,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 19:12:50,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:12:50,887 INFO L87 Difference]: Start difference. First operand 162 states and 224 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:51,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:12:51,118 INFO L93 Difference]: Finished difference Result 278 states and 382 transitions. [2023-12-16 19:12:51,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 19:12:51,119 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2023-12-16 19:12:51,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:12:51,120 INFO L225 Difference]: With dead ends: 278 [2023-12-16 19:12:51,120 INFO L226 Difference]: Without dead ends: 162 [2023-12-16 19:12:51,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-12-16 19:12:51,120 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 172 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:12:51,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 257 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:12:51,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-12-16 19:12:51,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 150. [2023-12-16 19:12:51,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.3691275167785235) internal successors, (204), 149 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:51,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 204 transitions. [2023-12-16 19:12:51,125 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 204 transitions. Word has length 45 [2023-12-16 19:12:51,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:12:51,125 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 204 transitions. [2023-12-16 19:12:51,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:12:51,125 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 204 transitions. [2023-12-16 19:12:51,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-16 19:12:51,125 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:12:51,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:12:51,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 19:12:51,126 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:12:51,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:12:51,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1241354111, now seen corresponding path program 1 times [2023-12-16 19:12:51,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:12:51,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836966697] [2023-12-16 19:12:51,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:12:51,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:12:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:12:51,542 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:12:51,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:12:51,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836966697] [2023-12-16 19:12:51,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836966697] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:12:51,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:12:51,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 19:12:51,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498273156] [2023-12-16 19:12:51,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:12:51,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 19:12:51,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:12:51,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 19:12:51,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-16 19:12:51,544 INFO L87 Difference]: Start difference. First operand 150 states and 204 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 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:12:51,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:12:51,949 INFO L93 Difference]: Finished difference Result 318 states and 432 transitions. [2023-12-16 19:12:51,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 19:12:51,950 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-12-16 19:12:51,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:12:51,950 INFO L225 Difference]: With dead ends: 318 [2023-12-16 19:12:51,951 INFO L226 Difference]: Without dead ends: 232 [2023-12-16 19:12:51,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2023-12-16 19:12:51,951 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 369 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 19:12:51,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 403 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 19:12:51,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-12-16 19:12:51,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 154. [2023-12-16 19:12:51,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 153 states have internal predecessors, (208), 0 states have call successors, (0), 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:12:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 208 transitions. [2023-12-16 19:12:51,956 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 208 transitions. Word has length 46 [2023-12-16 19:12:51,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:12:51,956 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 208 transitions. [2023-12-16 19:12:51,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 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:12:51,957 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 208 transitions. [2023-12-16 19:12:51,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-16 19:12:51,957 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:12:51,957 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:12:51,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-16 19:12:51,957 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:12:51,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:12:51,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1031360417, now seen corresponding path program 1 times [2023-12-16 19:12:51,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:12:51,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196256921] [2023-12-16 19:12:51,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:12:51,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:12:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:12:52,002 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 19:12:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:12:52,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 19:12:52,069 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 19:12:52,069 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 19:12:52,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-16 19:12:52,073 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:12:52,075 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 19:12:52,122 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 19:12:52,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:12:52 BoogieIcfgContainer [2023-12-16 19:12:52,138 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 19:12:52,138 INFO L158 Benchmark]: Toolchain (without parser) took 7753.98ms. Allocated memory was 185.6MB in the beginning and 415.2MB in the end (delta: 229.6MB). Free memory was 123.0MB in the beginning and 312.8MB in the end (delta: -189.8MB). Peak memory consumption was 40.8MB. Max. memory is 8.0GB. [2023-12-16 19:12:52,139 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory is still 135.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 19:12:52,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.85ms. Allocated memory is still 185.6MB. Free memory was 122.7MB in the beginning and 106.9MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 19:12:52,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.63ms. Allocated memory was 185.6MB in the beginning and 231.7MB in the end (delta: 46.1MB). Free memory was 106.9MB in the beginning and 193.7MB in the end (delta: -86.8MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2023-12-16 19:12:52,139 INFO L158 Benchmark]: Boogie Preprocessor took 137.38ms. Allocated memory is still 231.7MB. Free memory was 193.7MB in the beginning and 189.1MB in the end (delta: 4.6MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2023-12-16 19:12:52,140 INFO L158 Benchmark]: RCFGBuilder took 585.62ms. Allocated memory is still 231.7MB. Free memory was 189.1MB in the beginning and 145.6MB in the end (delta: 43.5MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. [2023-12-16 19:12:52,140 INFO L158 Benchmark]: TraceAbstraction took 6710.96ms. Allocated memory was 231.7MB in the beginning and 415.2MB in the end (delta: 183.5MB). Free memory was 144.9MB in the beginning and 312.8MB in the end (delta: -167.9MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 19:12:52,143 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.11ms. Allocated memory is still 185.6MB. Free memory is still 135.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.85ms. Allocated memory is still 185.6MB. Free memory was 122.7MB in the beginning and 106.9MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 98.63ms. Allocated memory was 185.6MB in the beginning and 231.7MB in the end (delta: 46.1MB). Free memory was 106.9MB in the beginning and 193.7MB in the end (delta: -86.8MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 137.38ms. Allocated memory is still 231.7MB. Free memory was 193.7MB in the beginning and 189.1MB in the end (delta: 4.6MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * RCFGBuilder took 585.62ms. Allocated memory is still 231.7MB. Free memory was 189.1MB in the beginning and 145.6MB in the end (delta: 43.5MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. * TraceAbstraction took 6710.96ms. Allocated memory was 231.7MB in the beginning and 415.2MB in the end (delta: 183.5MB). Free memory was 144.9MB in the beginning and 312.8MB in the end (delta: -167.9MB). Peak memory consumption was 15.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 bitwiseOr at line 123, overapproximation of bitwiseAnd at line 128. 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_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 3); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (3 - 1); [L32] const SORT_27 mask_SORT_27 = (SORT_27)-1 >> (sizeof(SORT_27) * 8 - 2); [L33] const SORT_27 msb_SORT_27 = (SORT_27)1 << (2 - 1); [L35] const SORT_1 var_11 = 0; [L36] const SORT_5 var_15 = 0; [L37] const SORT_5 var_21 = 2; [L38] const SORT_5 var_24 = 1; [L39] const SORT_1 var_41 = 1; [L41] SORT_1 input_2; [L42] SORT_1 input_3; [L43] SORT_1 input_4; [L44] SORT_5 input_6; [L45] SORT_5 input_7; [L46] SORT_1 input_8; [L47] SORT_5 input_9; [L48] SORT_5 input_10; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L50] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L51] SORT_5 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L52] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L53] SORT_5 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L55] SORT_1 init_13_arg_1 = var_11; [L56] state_12 = init_13_arg_1 [L57] SORT_5 init_17_arg_1 = var_15; [L58] state_16 = init_17_arg_1 [L59] SORT_1 init_19_arg_1 = var_11; [L60] state_18 = init_19_arg_1 [L61] SORT_5 init_31_arg_1 = var_15; [L62] state_30 = init_31_arg_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L65] input_2 = __VERIFIER_nondet_uchar() [L66] EXPR input_2 & mask_SORT_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L66] input_2 = input_2 & mask_SORT_1 [L67] input_3 = __VERIFIER_nondet_uchar() [L68] EXPR input_3 & mask_SORT_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L68] input_3 = input_3 & mask_SORT_1 [L69] input_4 = __VERIFIER_nondet_uchar() [L70] input_6 = __VERIFIER_nondet_uchar() [L71] input_7 = __VERIFIER_nondet_uchar() [L72] input_8 = __VERIFIER_nondet_uchar() [L73] input_9 = __VERIFIER_nondet_uchar() [L74] input_10 = __VERIFIER_nondet_uchar() [L77] SORT_1 var_14_arg_0 = state_12; [L78] SORT_1 var_14 = ~var_14_arg_0; [L79] SORT_1 var_20_arg_0 = state_18; [L80] SORT_5 var_20_arg_1 = state_16; [L81] SORT_5 var_20_arg_2 = input_7; [L82] SORT_5 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_24=1, var_41=1] [L83] EXPR var_20 & mask_SORT_5 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_24=1, var_41=1] [L83] var_20 = var_20 & mask_SORT_5 [L84] SORT_5 var_25_arg_0 = var_20; [L85] SORT_5 var_25_arg_1 = var_24; [L86] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L87] SORT_1 var_26_arg_0 = var_25; [L88] SORT_1 var_26 = ~var_26_arg_0; [L89] SORT_5 var_22_arg_0 = var_20; [L90] SORT_5 var_22_arg_1 = var_21; [L91] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L92] SORT_1 var_23_arg_0 = var_22; [L93] SORT_1 var_23 = ~var_23_arg_0; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=255, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_41=1] [L94] EXPR var_23 & mask_SORT_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=255, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_41=1] [L94] var_23 = var_23 & mask_SORT_1 [L95] SORT_1 var_28_arg_0 = var_26; [L96] SORT_1 var_28_arg_1 = var_23; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28_arg_0=255, var_28_arg_1=0, var_41=1] [L97] EXPR ((SORT_27)var_28_arg_0 << 1) | var_28_arg_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28_arg_0=255, var_28_arg_1=0, var_41=1] [L97] SORT_27 var_28 = ((SORT_27)var_28_arg_0 << 1) | var_28_arg_1; [L98] EXPR var_28 & mask_SORT_27 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28=254, var_28_arg_0=255, var_28_arg_1=0, var_41=1] [L98] var_28 = var_28 & mask_SORT_27 [L99] SORT_27 var_29_arg_0 = var_28; [L100] SORT_1 var_29 = var_29_arg_0 == mask_SORT_27; [L101] SORT_1 var_32_arg_0 = state_18; [L102] SORT_5 var_32_arg_1 = state_30; [L103] SORT_5 var_32_arg_2 = input_7; [L104] SORT_5 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28=3, var_28_arg_0=255, var_28_arg_1=0, var_29=1, var_29_arg_0=3, var_32=0, var_32_arg_0=0, var_32_arg_1=0, var_32_arg_2=0, var_41=1] [L105] EXPR var_32 & mask_SORT_5 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28=3, var_28_arg_0=255, var_28_arg_1=0, var_29=1, var_29_arg_0=3, var_32=0, var_32_arg_0=0, var_32_arg_1=0, var_32_arg_2=0, var_41=1] [L105] var_32 = var_32 & mask_SORT_5 [L106] SORT_5 var_33_arg_0 = var_32; [L107] SORT_5 var_33_arg_1 = var_21; [L108] SORT_1 var_33 = var_33_arg_0 == var_33_arg_1; [L109] SORT_1 var_34_arg_0 = var_33; [L110] SORT_1 var_34 = ~var_34_arg_0; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28=3, var_28_arg_0=255, var_28_arg_1=0, var_29=1, var_29_arg_0=3, var_32=0, var_32_arg_0=0, var_32_arg_1=0, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=2, var_34=255, var_34_arg_0=0, var_41=1] [L111] EXPR var_34 & mask_SORT_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28=3, var_28_arg_0=255, var_28_arg_1=0, var_29=1, var_29_arg_0=3, var_32=0, var_32_arg_0=0, var_32_arg_1=0, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=2, var_34=255, var_34_arg_0=0, var_41=1] [L111] var_34 = var_34 & mask_SORT_1 [L112] SORT_1 var_35_arg_0 = var_26; [L113] SORT_1 var_35_arg_1 = var_34; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28=3, var_28_arg_0=255, var_28_arg_1=0, var_29=1, var_29_arg_0=3, var_32=0, var_32_arg_0=0, var_32_arg_1=0, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=2, var_34=0, var_34_arg_0=0, var_35_arg_0=255, var_35_arg_1=0, var_41=1] [L114] EXPR ((SORT_27)var_35_arg_0 << 1) | var_35_arg_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28=3, var_28_arg_0=255, var_28_arg_1=0, var_29=1, var_29_arg_0=3, var_32=0, var_32_arg_0=0, var_32_arg_1=0, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=2, var_34=0, var_34_arg_0=0, var_35_arg_0=255, var_35_arg_1=0, var_41=1] [L114] SORT_27 var_35 = ((SORT_27)var_35_arg_0 << 1) | var_35_arg_1; [L115] EXPR var_35 & mask_SORT_27 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28=3, var_28_arg_0=255, var_28_arg_1=0, var_29=1, var_29_arg_0=3, var_32=0, var_32_arg_0=0, var_32_arg_1=0, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=2, var_34=0, var_34_arg_0=0, var_35=254, var_35_arg_0=255, var_35_arg_1=0, var_41=1] [L115] var_35 = var_35 & mask_SORT_27 [L116] SORT_27 var_36_arg_0 = var_35; [L117] SORT_1 var_36 = var_36_arg_0 == mask_SORT_27; [L118] SORT_1 var_37_arg_0 = var_29; [L119] SORT_1 var_37_arg_1 = var_36; [L120] SORT_1 var_37 = var_37_arg_0 == var_37_arg_1; [L121] SORT_1 var_38_arg_0 = var_14; [L122] SORT_1 var_38_arg_1 = var_37; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28=3, var_28_arg_0=255, var_28_arg_1=0, var_29=1, var_29_arg_0=3, var_32=0, var_32_arg_0=0, var_32_arg_1=0, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=2, var_34=0, var_34_arg_0=0, var_35=3, var_35_arg_0=255, var_35_arg_1=0, var_36=1, var_36_arg_0=3, var_37=1, var_37_arg_0=1, var_37_arg_1=1, var_38_arg_0=255, var_38_arg_1=1, var_41=1] [L123] EXPR var_38_arg_0 | var_38_arg_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28=3, var_28_arg_0=255, var_28_arg_1=0, var_29=1, var_29_arg_0=3, var_32=0, var_32_arg_0=0, var_32_arg_1=0, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=2, var_34=0, var_34_arg_0=0, var_35=3, var_35_arg_0=255, var_35_arg_1=0, var_36=1, var_36_arg_0=3, var_37=1, var_37_arg_0=1, var_37_arg_1=1, var_38_arg_0=255, var_38_arg_1=1, var_41=1] [L123] SORT_1 var_38 = var_38_arg_0 | var_38_arg_1; [L124] SORT_1 var_42_arg_0 = var_38; [L125] SORT_1 var_42 = ~var_42_arg_0; [L126] SORT_1 var_43_arg_0 = var_41; [L127] SORT_1 var_43_arg_1 = var_42; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28=3, var_28_arg_0=255, var_28_arg_1=0, var_29=1, var_29_arg_0=3, var_32=0, var_32_arg_0=0, var_32_arg_1=0, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=2, var_34=0, var_34_arg_0=0, var_35=3, var_35_arg_0=255, var_35_arg_1=0, var_36=1, var_36_arg_0=3, var_37=1, var_37_arg_0=1, var_37_arg_1=1, var_38=0, var_38_arg_0=255, var_38_arg_1=1, var_41=1, var_42=255, var_42_arg_0=0, var_43_arg_0=1, var_43_arg_1=255] [L128] EXPR var_43_arg_0 & var_43_arg_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28=3, var_28_arg_0=255, var_28_arg_1=0, var_29=1, var_29_arg_0=3, var_32=0, var_32_arg_0=0, var_32_arg_1=0, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=2, var_34=0, var_34_arg_0=0, var_35=3, var_35_arg_0=255, var_35_arg_1=0, var_36=1, var_36_arg_0=3, var_37=1, var_37_arg_0=1, var_37_arg_1=1, var_38=0, var_38_arg_0=255, var_38_arg_1=1, var_41=1, var_42=255, var_42_arg_0=0, var_43_arg_0=1, var_43_arg_1=255] [L128] SORT_1 var_43 = var_43_arg_0 & var_43_arg_1; [L129] EXPR var_43 & mask_SORT_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28=3, var_28_arg_0=255, var_28_arg_1=0, var_29=1, var_29_arg_0=3, var_32=0, var_32_arg_0=0, var_32_arg_1=0, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=2, var_34=0, var_34_arg_0=0, var_35=3, var_35_arg_0=255, var_35_arg_1=0, var_36=1, var_36_arg_0=3, var_37=1, var_37_arg_0=1, var_37_arg_1=1, var_38=0, var_38_arg_0=255, var_38_arg_1=1, var_41=1, var_42=255, var_42_arg_0=0, var_43=1, var_43_arg_0=1, var_43_arg_1=255] [L129] var_43 = var_43 & mask_SORT_1 [L130] SORT_1 bad_44_arg_0 = var_43; [L131] CALL __VERIFIER_assert(!(bad_44_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, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3856 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3856 mSDsluCounter, 6522 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4721 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1789 IncrementalHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 1801 mSDtfsCounter, 1789 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=15, InterpolantAutomatonStates: 124, 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, 17 MinimizatonAttempts, 591 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 774 NumberOfCodeBlocks, 774 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 710 ConstructedInterpolants, 0 QuantifiedInterpolants, 3255 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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:12:52,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...