/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.cal55.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 19:12:58,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 19:12:58,976 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:58,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 19:12:58,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 19:12:58,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 19:12:58,998 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 19:12:58,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 19:12:58,999 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 19:12:59,000 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 19:12:59,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 19:12:59,000 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 19:12:59,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 19:12:59,001 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 19:12:59,001 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 19:12:59,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 19:12:59,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 19:12:59,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 19:12:59,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 19:12:59,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 19:12:59,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 19:12:59,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 19:12:59,004 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 19:12:59,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 19:12:59,004 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 19:12:59,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 19:12:59,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 19:12:59,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 19:12:59,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 19:12:59,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:12:59,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 19:12:59,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 19:12:59,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 19:12:59,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 19:12:59,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 19:12:59,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 19:12:59,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 19:12:59,007 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 19:12:59,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 19:12:59,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 19:12:59,007 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:59,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 19:12:59,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 19:12:59,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 19:12:59,218 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 19:12:59,218 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 19:12:59,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cal55.c [2023-12-16 19:13:00,433 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 19:13:00,640 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 19:13:00,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cal55.c [2023-12-16 19:13:00,648 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3ce0a6e2/ac740936a32c49b3a57a9ff417a2c290/FLAGe636f3414 [2023-12-16 19:13:00,660 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3ce0a6e2/ac740936a32c49b3a57a9ff417a2c290 [2023-12-16 19:13:00,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 19:13:00,663 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 19:13:00,664 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 19:13:00,664 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 19:13:00,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 19:13:00,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:13:00" (1/1) ... [2023-12-16 19:13:00,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71558836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:00, skipping insertion in model container [2023-12-16 19:13:00,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:13:00" (1/1) ... [2023-12-16 19:13:00,694 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 19:13:00,855 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.cal55.c[1245,1258] [2023-12-16 19:13:00,926 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:13:00,936 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 19:13:00,945 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.cal55.c[1245,1258] [2023-12-16 19:13:00,983 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:13:00,998 INFO L206 MainTranslator]: Completed translation [2023-12-16 19:13:00,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:00 WrapperNode [2023-12-16 19:13:00,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 19:13:01,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 19:13:01,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 19:13:01,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 19:13:01,005 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:13:00" (1/1) ... [2023-12-16 19:13:01,018 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:13:00" (1/1) ... [2023-12-16 19:13:01,081 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 386 [2023-12-16 19:13:01,081 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 19:13:01,082 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 19:13:01,082 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 19:13:01,082 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 19:13:01,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:00" (1/1) ... [2023-12-16 19:13:01,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:00" (1/1) ... [2023-12-16 19:13:01,117 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:00" (1/1) ... [2023-12-16 19:13:01,150 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:13:01,150 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:00" (1/1) ... [2023-12-16 19:13:01,151 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:00" (1/1) ... [2023-12-16 19:13:01,169 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:00" (1/1) ... [2023-12-16 19:13:01,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:00" (1/1) ... [2023-12-16 19:13:01,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:00" (1/1) ... [2023-12-16 19:13:01,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:00" (1/1) ... [2023-12-16 19:13:01,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 19:13:01,190 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 19:13:01,191 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 19:13:01,191 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 19:13:01,192 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:00" (1/1) ... [2023-12-16 19:13:01,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:13:01,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:13:01,228 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:13:01,230 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:13:01,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 19:13:01,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 19:13:01,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 19:13:01,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 19:13:01,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 19:13:01,342 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 19:13:01,344 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 19:13:01,878 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 19:13:01,910 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 19:13:01,910 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 19:13:01,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:13:01 BoogieIcfgContainer [2023-12-16 19:13:01,911 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 19:13:01,913 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 19:13:01,913 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 19:13:01,916 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 19:13:01,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:13:00" (1/3) ... [2023-12-16 19:13:01,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b04ac77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:13:01, skipping insertion in model container [2023-12-16 19:13:01,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:13:00" (2/3) ... [2023-12-16 19:13:01,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b04ac77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:13:01, skipping insertion in model container [2023-12-16 19:13:01,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:13:01" (3/3) ... [2023-12-16 19:13:01,918 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal55.c [2023-12-16 19:13:01,934 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 19:13:01,934 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 19:13:01,974 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 19:13:01,981 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;@484b7f99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 19:13:01,981 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 19:13:01,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 61 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:13:01,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-16 19:13:01,993 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:01,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:13:01,995 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:02,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:02,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1513167013, now seen corresponding path program 1 times [2023-12-16 19:13:02,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:02,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543757238] [2023-12-16 19:13:02,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:02,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:02,635 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:13:02,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:02,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543757238] [2023-12-16 19:13:02,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543757238] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:02,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:02,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:13:02,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408985165] [2023-12-16 19:13:02,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:02,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:13:02,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:02,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:13:02,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:13:02,668 INFO L87 Difference]: Start difference. First operand has 62 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 61 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:13:02,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:02,726 INFO L93 Difference]: Finished difference Result 111 states and 181 transitions. [2023-12-16 19:13:02,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:13:02,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-16 19:13:02,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:02,737 INFO L225 Difference]: With dead ends: 111 [2023-12-16 19:13:02,738 INFO L226 Difference]: Without dead ends: 62 [2023-12-16 19:13:02,741 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:13:02,744 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 1 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:02,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 274 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:13:02,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-16 19:13:02,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-12-16 19:13:02,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:13:02,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 98 transitions. [2023-12-16 19:13:02,782 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 98 transitions. Word has length 34 [2023-12-16 19:13:02,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:02,783 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 98 transitions. [2023-12-16 19:13:02,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:13:02,783 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 98 transitions. [2023-12-16 19:13:02,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-16 19:13:02,784 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:02,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:13:02,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 19:13:02,785 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:02,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:02,786 INFO L85 PathProgramCache]: Analyzing trace with hash -334737725, now seen corresponding path program 1 times [2023-12-16 19:13:02,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:02,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36659220] [2023-12-16 19:13:02,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:02,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:13:02,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:02,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36659220] [2023-12-16 19:13:02,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36659220] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:02,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:02,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:13:02,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251848819] [2023-12-16 19:13:02,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:02,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:13:02,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:02,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:13:02,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:13:02,979 INFO L87 Difference]: Start difference. First operand 62 states and 98 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:13:03,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:03,013 INFO L93 Difference]: Finished difference Result 114 states and 179 transitions. [2023-12-16 19:13:03,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:13:03,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-16 19:13:03,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:03,017 INFO L225 Difference]: With dead ends: 114 [2023-12-16 19:13:03,017 INFO L226 Difference]: Without dead ends: 65 [2023-12-16 19:13:03,018 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:13:03,019 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 1 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:03,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 272 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:13:03,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-16 19:13:03,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2023-12-16 19:13:03,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.5873015873015872) internal successors, (100), 63 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:13:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 100 transitions. [2023-12-16 19:13:03,025 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 100 transitions. Word has length 35 [2023-12-16 19:13:03,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:03,025 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 100 transitions. [2023-12-16 19:13:03,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:13:03,025 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 100 transitions. [2023-12-16 19:13:03,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 19:13:03,026 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:03,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:13:03,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 19:13:03,027 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:03,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:03,027 INFO L85 PathProgramCache]: Analyzing trace with hash -222359807, now seen corresponding path program 1 times [2023-12-16 19:13:03,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:03,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283138297] [2023-12-16 19:13:03,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:03,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:03,514 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:13:03,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:03,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283138297] [2023-12-16 19:13:03,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283138297] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:03,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:03,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:13:03,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110584884] [2023-12-16 19:13:03,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:03,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:13:03,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:03,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:13:03,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:13:03,524 INFO L87 Difference]: Start difference. First operand 64 states and 100 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:13:03,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:03,699 INFO L93 Difference]: Finished difference Result 191 states and 299 transitions. [2023-12-16 19:13:03,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 19:13:03,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-12-16 19:13:03,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:03,705 INFO L225 Difference]: With dead ends: 191 [2023-12-16 19:13:03,706 INFO L226 Difference]: Without dead ends: 140 [2023-12-16 19:13:03,707 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:13:03,709 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 407 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 392 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.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:03,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 392 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:13:03,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-12-16 19:13:03,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 90. [2023-12-16 19:13:03,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.595505617977528) internal successors, (142), 89 states have internal predecessors, (142), 0 states have call successors, (0), 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:13:03,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 142 transitions. [2023-12-16 19:13:03,718 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 142 transitions. Word has length 36 [2023-12-16 19:13:03,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:03,718 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 142 transitions. [2023-12-16 19:13:03,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:13:03,718 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 142 transitions. [2023-12-16 19:13:03,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-16 19:13:03,719 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:03,719 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] [2023-12-16 19:13:03,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 19:13:03,720 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:03,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:03,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1586074219, now seen corresponding path program 1 times [2023-12-16 19:13:03,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:03,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123052656] [2023-12-16 19:13:03,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:03,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:04,037 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:13:04,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:04,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123052656] [2023-12-16 19:13:04,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123052656] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:04,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:04,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 19:13:04,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962148339] [2023-12-16 19:13:04,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:04,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 19:13:04,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:04,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 19:13:04,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:13:04,040 INFO L87 Difference]: Start difference. First operand 90 states and 142 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:13:04,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:04,268 INFO L93 Difference]: Finished difference Result 235 states and 367 transitions. [2023-12-16 19:13:04,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 19:13:04,269 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-12-16 19:13:04,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:04,270 INFO L225 Difference]: With dead ends: 235 [2023-12-16 19:13:04,270 INFO L226 Difference]: Without dead ends: 184 [2023-12-16 19:13:04,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2023-12-16 19:13:04,272 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 655 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 641 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:13:04,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 641 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:13:04,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-12-16 19:13:04,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 93. [2023-12-16 19:13:04,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.5869565217391304) internal successors, (146), 92 states have internal predecessors, (146), 0 states have call successors, (0), 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:13:04,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 146 transitions. [2023-12-16 19:13:04,281 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 146 transitions. Word has length 37 [2023-12-16 19:13:04,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:04,281 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 146 transitions. [2023-12-16 19:13:04,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:13:04,281 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 146 transitions. [2023-12-16 19:13:04,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-16 19:13:04,282 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:04,282 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] [2023-12-16 19:13:04,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 19:13:04,282 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:04,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:04,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1193047209, now seen corresponding path program 1 times [2023-12-16 19:13:04,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:04,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302802583] [2023-12-16 19:13:04,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:04,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:04,479 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:13:04,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:04,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302802583] [2023-12-16 19:13:04,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302802583] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:04,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:04,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 19:13:04,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120396477] [2023-12-16 19:13:04,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:04,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 19:13:04,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:04,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 19:13:04,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 19:13:04,482 INFO L87 Difference]: Start difference. First operand 93 states and 146 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:13:04,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:04,496 INFO L93 Difference]: Finished difference Result 161 states and 251 transitions. [2023-12-16 19:13:04,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 19:13:04,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-12-16 19:13:04,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:04,501 INFO L225 Difference]: With dead ends: 161 [2023-12-16 19:13:04,501 INFO L226 Difference]: Without dead ends: 93 [2023-12-16 19:13:04,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 19:13:04,504 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 73 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:04,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 141 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:13:04,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-16 19:13:04,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-12-16 19:13:04,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.565217391304348) internal successors, (144), 92 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:13:04,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 144 transitions. [2023-12-16 19:13:04,527 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 144 transitions. Word has length 37 [2023-12-16 19:13:04,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:04,528 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 144 transitions. [2023-12-16 19:13:04,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:13:04,528 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 144 transitions. [2023-12-16 19:13:04,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 19:13:04,529 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:04,529 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:13:04,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 19:13:04,529 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:04,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:04,532 INFO L85 PathProgramCache]: Analyzing trace with hash 891809921, now seen corresponding path program 1 times [2023-12-16 19:13:04,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:04,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505962556] [2023-12-16 19:13:04,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:04,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:04,924 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:13:04,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:04,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505962556] [2023-12-16 19:13:04,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505962556] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:04,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:04,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:13:04,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339900891] [2023-12-16 19:13:04,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:04,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 19:13:04,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:04,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 19:13:04,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:13:04,927 INFO L87 Difference]: Start difference. First operand 93 states and 144 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 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:13:05,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:05,069 INFO L93 Difference]: Finished difference Result 239 states and 365 transitions. [2023-12-16 19:13:05,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 19:13:05,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 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:13:05,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:05,071 INFO L225 Difference]: With dead ends: 239 [2023-12-16 19:13:05,071 INFO L226 Difference]: Without dead ends: 174 [2023-12-16 19:13:05,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-12-16 19:13:05,073 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 219 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:05,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 445 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:13:05,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-12-16 19:13:05,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 105. [2023-12-16 19:13:05,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.5192307692307692) internal successors, (158), 104 states have internal predecessors, (158), 0 states have call successors, (0), 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:13:05,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 158 transitions. [2023-12-16 19:13:05,098 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 158 transitions. Word has length 38 [2023-12-16 19:13:05,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:05,101 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 158 transitions. [2023-12-16 19:13:05,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 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:13:05,101 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 158 transitions. [2023-12-16 19:13:05,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 19:13:05,104 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:05,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] [2023-12-16 19:13:05,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 19:13:05,105 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:05,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:05,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1314511747, now seen corresponding path program 1 times [2023-12-16 19:13:05,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:05,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341648270] [2023-12-16 19:13:05,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:05,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:05,328 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:13:05,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:05,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341648270] [2023-12-16 19:13:05,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341648270] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:05,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:05,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:13:05,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996420887] [2023-12-16 19:13:05,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:05,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:13:05,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:05,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:13:05,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:13:05,331 INFO L87 Difference]: Start difference. First operand 105 states and 158 transitions. Second operand has 5 states, 5 states have (on average 7.6) 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:13:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:05,377 INFO L93 Difference]: Finished difference Result 240 states and 361 transitions. [2023-12-16 19:13:05,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:13:05,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) 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:13:05,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:05,378 INFO L225 Difference]: With dead ends: 240 [2023-12-16 19:13:05,378 INFO L226 Difference]: Without dead ends: 166 [2023-12-16 19:13:05,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:13:05,379 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 205 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:05,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 293 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:13:05,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-12-16 19:13:05,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 105. [2023-12-16 19:13:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.5) internal successors, (156), 104 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:13:05,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 156 transitions. [2023-12-16 19:13:05,384 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 156 transitions. Word has length 38 [2023-12-16 19:13:05,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:05,385 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 156 transitions. [2023-12-16 19:13:05,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) 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:13:05,385 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 156 transitions. [2023-12-16 19:13:05,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-16 19:13:05,386 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:05,386 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:13:05,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 19:13:05,386 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:05,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:05,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1404447889, now seen corresponding path program 1 times [2023-12-16 19:13:05,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:05,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145701480] [2023-12-16 19:13:05,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:05,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:05,721 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:13:05,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:05,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145701480] [2023-12-16 19:13:05,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145701480] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:05,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:05,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:13:05,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299902539] [2023-12-16 19:13:05,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:05,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 19:13:05,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:05,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 19:13:05,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:13:05,724 INFO L87 Difference]: Start difference. First operand 105 states and 156 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 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:13:05,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:05,821 INFO L93 Difference]: Finished difference Result 249 states and 368 transitions. [2023-12-16 19:13:05,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 19:13:05,822 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 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:13:05,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:05,823 INFO L225 Difference]: With dead ends: 249 [2023-12-16 19:13:05,823 INFO L226 Difference]: Without dead ends: 184 [2023-12-16 19:13:05,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-16 19:13:05,824 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 308 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:05,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 491 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:13:05,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-12-16 19:13:05,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 115. [2023-12-16 19:13:05,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.4912280701754386) internal successors, (170), 114 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:13:05,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 170 transitions. [2023-12-16 19:13:05,829 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 170 transitions. Word has length 39 [2023-12-16 19:13:05,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:05,829 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 170 transitions. [2023-12-16 19:13:05,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 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:13:05,829 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 170 transitions. [2023-12-16 19:13:05,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-16 19:13:05,833 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:05,833 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:13:05,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 19:13:05,834 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:05,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:05,834 INFO L85 PathProgramCache]: Analyzing trace with hash 223455951, now seen corresponding path program 1 times [2023-12-16 19:13:05,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:05,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077390912] [2023-12-16 19:13:05,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:05,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:06,049 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:13:06,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:06,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077390912] [2023-12-16 19:13:06,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077390912] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:06,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:06,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:13:06,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732369170] [2023-12-16 19:13:06,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:06,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:13:06,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:06,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:13:06,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:13:06,051 INFO L87 Difference]: Start difference. First operand 115 states and 170 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 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:13:06,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:06,128 INFO L93 Difference]: Finished difference Result 199 states and 294 transitions. [2023-12-16 19:13:06,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:13:06,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 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:13:06,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:06,130 INFO L225 Difference]: With dead ends: 199 [2023-12-16 19:13:06,130 INFO L226 Difference]: Without dead ends: 123 [2023-12-16 19:13:06,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:13:06,134 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 98 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:06,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 320 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:13:06,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-16 19:13:06,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2023-12-16 19:13:06,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 120 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:13:06,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 176 transitions. [2023-12-16 19:13:06,141 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 176 transitions. Word has length 39 [2023-12-16 19:13:06,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:06,142 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 176 transitions. [2023-12-16 19:13:06,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 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:13:06,142 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 176 transitions. [2023-12-16 19:13:06,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-16 19:13:06,143 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:06,143 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:13:06,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 19:13:06,143 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:06,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:06,144 INFO L85 PathProgramCache]: Analyzing trace with hash 646157777, now seen corresponding path program 1 times [2023-12-16 19:13:06,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:06,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631394304] [2023-12-16 19:13:06,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:06,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:06,415 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:13:06,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:06,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631394304] [2023-12-16 19:13:06,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631394304] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:06,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:06,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:13:06,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962063829] [2023-12-16 19:13:06,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:06,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:13:06,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:06,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:13:06,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:13:06,417 INFO L87 Difference]: Start difference. First operand 121 states and 176 transitions. Second operand has 5 states, 5 states have (on average 7.8) 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:13:06,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:06,510 INFO L93 Difference]: Finished difference Result 277 states and 403 transitions. [2023-12-16 19:13:06,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:13:06,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) 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:13:06,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:06,512 INFO L225 Difference]: With dead ends: 277 [2023-12-16 19:13:06,512 INFO L226 Difference]: Without dead ends: 195 [2023-12-16 19:13:06,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:13:06,513 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 149 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:06,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 343 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:13:06,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-12-16 19:13:06,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 127. [2023-12-16 19:13:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.4444444444444444) internal successors, (182), 126 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:13:06,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 182 transitions. [2023-12-16 19:13:06,518 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 182 transitions. Word has length 39 [2023-12-16 19:13:06,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:06,518 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 182 transitions. [2023-12-16 19:13:06,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) 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:13:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 182 transitions. [2023-12-16 19:13:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-16 19:13:06,519 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:06,519 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:13:06,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 19:13:06,519 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:06,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:06,520 INFO L85 PathProgramCache]: Analyzing trace with hash 512144271, now seen corresponding path program 1 times [2023-12-16 19:13:06,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:06,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046147081] [2023-12-16 19:13:06,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:06,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:06,907 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:13:06,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:06,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046147081] [2023-12-16 19:13:06,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046147081] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:06,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:06,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:13:06,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202647409] [2023-12-16 19:13:06,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:06,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:13:06,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:06,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:13:06,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:13:06,909 INFO L87 Difference]: Start difference. First operand 127 states and 182 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 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:13:07,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:07,046 INFO L93 Difference]: Finished difference Result 211 states and 302 transitions. [2023-12-16 19:13:07,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:13:07,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 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:13:07,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:07,047 INFO L225 Difference]: With dead ends: 211 [2023-12-16 19:13:07,047 INFO L226 Difference]: Without dead ends: 129 [2023-12-16 19:13:07,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-16 19:13:07,048 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 149 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:07,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 315 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:13:07,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-16 19:13:07,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2023-12-16 19:13:07,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.4333333333333333) internal successors, (172), 120 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:13:07,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 172 transitions. [2023-12-16 19:13:07,055 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 172 transitions. Word has length 39 [2023-12-16 19:13:07,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:07,055 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 172 transitions. [2023-12-16 19:13:07,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 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:13:07,055 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 172 transitions. [2023-12-16 19:13:07,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-16 19:13:07,056 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:07,056 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:13:07,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 19:13:07,056 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:07,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:07,057 INFO L85 PathProgramCache]: Analyzing trace with hash 533816907, now seen corresponding path program 1 times [2023-12-16 19:13:07,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:07,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050936543] [2023-12-16 19:13:07,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:07,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:07,448 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:13:07,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:07,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050936543] [2023-12-16 19:13:07,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050936543] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:07,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:07,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 19:13:07,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362075714] [2023-12-16 19:13:07,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:07,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 19:13:07,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:07,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 19:13:07,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-16 19:13:07,450 INFO L87 Difference]: Start difference. First operand 121 states and 172 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 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:13:07,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:07,670 INFO L93 Difference]: Finished difference Result 271 states and 384 transitions. [2023-12-16 19:13:07,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 19:13:07,670 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 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:13:07,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:07,671 INFO L225 Difference]: With dead ends: 271 [2023-12-16 19:13:07,671 INFO L226 Difference]: Without dead ends: 201 [2023-12-16 19:13:07,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-12-16 19:13:07,673 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 365 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:07,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 645 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:13:07,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-12-16 19:13:07,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 127. [2023-12-16 19:13:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.4285714285714286) internal successors, (180), 126 states have internal predecessors, (180), 0 states have call successors, (0), 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:13:07,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 180 transitions. [2023-12-16 19:13:07,679 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 180 transitions. Word has length 40 [2023-12-16 19:13:07,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:07,679 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 180 transitions. [2023-12-16 19:13:07,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 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:13:07,679 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 180 transitions. [2023-12-16 19:13:07,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-16 19:13:07,680 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:07,680 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:13:07,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 19:13:07,680 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:07,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:07,681 INFO L85 PathProgramCache]: Analyzing trace with hash -746046771, now seen corresponding path program 1 times [2023-12-16 19:13:07,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:07,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675258535] [2023-12-16 19:13:07,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:07,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:07,894 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:13:07,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:07,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675258535] [2023-12-16 19:13:07,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675258535] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:07,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:07,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:13:07,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284615766] [2023-12-16 19:13:07,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:07,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:13:07,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:07,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:13:07,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:13:07,896 INFO L87 Difference]: Start difference. First operand 127 states and 180 transitions. Second operand has 5 states, 5 states have (on average 8.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:13:07,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:07,942 INFO L93 Difference]: Finished difference Result 291 states and 409 transitions. [2023-12-16 19:13:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:13:07,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.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:13:07,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:07,944 INFO L225 Difference]: With dead ends: 291 [2023-12-16 19:13:07,944 INFO L226 Difference]: Without dead ends: 215 [2023-12-16 19:13:07,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:13:07,945 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 183 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:07,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 306 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:13:07,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-12-16 19:13:07,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 139. [2023-12-16 19:13:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.4057971014492754) internal successors, (194), 138 states have internal predecessors, (194), 0 states have call successors, (0), 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:13:07,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 194 transitions. [2023-12-16 19:13:07,952 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 194 transitions. Word has length 40 [2023-12-16 19:13:07,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:07,952 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 194 transitions. [2023-12-16 19:13:07,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.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:13:07,952 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 194 transitions. [2023-12-16 19:13:07,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-16 19:13:07,952 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:07,952 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:13:07,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 19:13:07,953 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:07,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:07,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2134655997, now seen corresponding path program 1 times [2023-12-16 19:13:07,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:07,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332559839] [2023-12-16 19:13:07,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:07,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:08,170 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:13:08,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:08,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332559839] [2023-12-16 19:13:08,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332559839] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:08,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:08,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:13:08,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951434603] [2023-12-16 19:13:08,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:08,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:13:08,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:08,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:13:08,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:13:08,173 INFO L87 Difference]: Start difference. First operand 139 states and 194 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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:13:08,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:08,205 INFO L93 Difference]: Finished difference Result 221 states and 308 transitions. [2023-12-16 19:13:08,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:13:08,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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:13:08,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:08,206 INFO L225 Difference]: With dead ends: 221 [2023-12-16 19:13:08,206 INFO L226 Difference]: Without dead ends: 139 [2023-12-16 19:13:08,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:13:08,207 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 139 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:08,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 222 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:13:08,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-12-16 19:13:08,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2023-12-16 19:13:08,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:13:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 190 transitions. [2023-12-16 19:13:08,214 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 190 transitions. Word has length 40 [2023-12-16 19:13:08,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:08,214 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 190 transitions. [2023-12-16 19:13:08,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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:13:08,214 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 190 transitions. [2023-12-16 19:13:08,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-16 19:13:08,215 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:08,215 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:13:08,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 19:13:08,215 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:08,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:08,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1924439625, now seen corresponding path program 1 times [2023-12-16 19:13:08,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:08,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411400326] [2023-12-16 19:13:08,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:08,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:08,387 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:13:08,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:08,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411400326] [2023-12-16 19:13:08,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411400326] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:08,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:08,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:13:08,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084706391] [2023-12-16 19:13:08,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:08,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:13:08,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:08,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:13:08,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:13:08,389 INFO L87 Difference]: Start difference. First operand 139 states and 190 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 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:13:08,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:08,422 INFO L93 Difference]: Finished difference Result 226 states and 309 transitions. [2023-12-16 19:13:08,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 19:13:08,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 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:13:08,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:08,423 INFO L225 Difference]: With dead ends: 226 [2023-12-16 19:13:08,423 INFO L226 Difference]: Without dead ends: 147 [2023-12-16 19:13:08,425 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:13:08,426 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 69 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:08,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 244 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:13:08,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-12-16 19:13:08,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2023-12-16 19:13:08,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.375) internal successors, (198), 144 states have internal predecessors, (198), 0 states have call successors, (0), 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:13:08,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 198 transitions. [2023-12-16 19:13:08,431 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 198 transitions. Word has length 41 [2023-12-16 19:13:08,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:08,431 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 198 transitions. [2023-12-16 19:13:08,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 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:13:08,432 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 198 transitions. [2023-12-16 19:13:08,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-16 19:13:08,432 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:08,432 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:13:08,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 19:13:08,432 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:08,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:08,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1783721657, now seen corresponding path program 1 times [2023-12-16 19:13:08,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:08,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588062651] [2023-12-16 19:13:08,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:08,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:13:08,472 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 19:13:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:13:08,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 19:13:08,551 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 19:13:08,552 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 19:13:08,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 19:13:08,556 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:13:08,560 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 19:13:08,614 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 19:13:08,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:13:08 BoogieIcfgContainer [2023-12-16 19:13:08,635 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 19:13:08,635 INFO L158 Benchmark]: Toolchain (without parser) took 7972.02ms. Allocated memory was 323.0MB in the beginning and 443.5MB in the end (delta: 120.6MB). Free memory was 270.7MB in the beginning and 272.1MB in the end (delta: -1.4MB). Peak memory consumption was 120.7MB. Max. memory is 8.0GB. [2023-12-16 19:13:08,635 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 190.8MB. Free memory is still 134.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 19:13:08,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.93ms. Allocated memory is still 323.0MB. Free memory was 270.3MB in the beginning and 254.9MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 19:13:08,636 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.35ms. Allocated memory is still 323.0MB. Free memory was 254.9MB in the beginning and 246.8MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-12-16 19:13:08,636 INFO L158 Benchmark]: Boogie Preprocessor took 107.57ms. Allocated memory is still 323.0MB. Free memory was 246.8MB in the beginning and 241.7MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 19:13:08,637 INFO L158 Benchmark]: RCFGBuilder took 720.35ms. Allocated memory is still 323.0MB. Free memory was 241.3MB in the beginning and 254.7MB in the end (delta: -13.4MB). Peak memory consumption was 19.1MB. Max. memory is 8.0GB. [2023-12-16 19:13:08,637 INFO L158 Benchmark]: TraceAbstraction took 6721.88ms. Allocated memory was 323.0MB in the beginning and 443.5MB in the end (delta: 120.6MB). Free memory was 254.2MB in the beginning and 272.1MB in the end (delta: -17.9MB). Peak memory consumption was 102.6MB. Max. memory is 8.0GB. [2023-12-16 19:13:08,642 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 190.8MB. Free memory is still 134.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 334.93ms. Allocated memory is still 323.0MB. Free memory was 270.3MB in the beginning and 254.9MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 81.35ms. Allocated memory is still 323.0MB. Free memory was 254.9MB in the beginning and 246.8MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 107.57ms. Allocated memory is still 323.0MB. Free memory was 246.8MB in the beginning and 241.7MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 720.35ms. Allocated memory is still 323.0MB. Free memory was 241.3MB in the beginning and 254.7MB in the end (delta: -13.4MB). Peak memory consumption was 19.1MB. Max. memory is 8.0GB. * TraceAbstraction took 6721.88ms. Allocated memory was 323.0MB in the beginning and 443.5MB in the end (delta: 120.6MB). Free memory was 254.2MB in the beginning and 272.1MB in the end (delta: -17.9MB). Peak memory consumption was 102.6MB. 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 117, overapproximation of bitwiseAnd at line 122. 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_26 mask_SORT_26 = (SORT_26)-1 >> (sizeof(SORT_26) * 8 - 2); [L33] const SORT_26 msb_SORT_26 = (SORT_26)1 << (2 - 1); [L35] const SORT_1 var_11 = 0; [L36] const SORT_5 var_15 = 0; [L37] const SORT_5 var_21 = 5; [L38] const SORT_5 var_23 = 4; [L39] const SORT_1 var_39 = 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_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, var_11=0, var_15=0, var_21=5, var_23=4, var_39=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_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, var_11=0, var_15=0, var_21=5, var_23=4, var_39=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_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, var_11=0, var_15=0, var_21=5, var_23=4, var_39=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_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, var_11=0, var_15=0, var_21=5, var_23=4, var_39=1] [L53] SORT_5 state_29 = __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_30_arg_1 = var_15; [L62] state_29 = init_30_arg_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_15=0, var_21=5, var_23=4, var_39=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_30_arg_1=0, input_2=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_15=0, var_21=5, var_23=4, var_39=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_30_arg_1=0, input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_15=0, var_21=5, var_23=4, var_39=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_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=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=5, var_23=4, var_39=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_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=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=5, var_23=4, var_39=1] [L83] var_20 = var_20 & mask_SORT_5 [L84] SORT_5 var_24_arg_0 = var_20; [L85] SORT_5 var_24_arg_1 = var_23; [L86] SORT_1 var_24 = var_24_arg_0 == var_24_arg_1; [L87] SORT_1 var_25_arg_0 = var_24; [L88] SORT_1 var_25 = ~var_25_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_27_arg_0 = var_25; [L93] SORT_1 var_27_arg_1 = var_22; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=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=5, var_22=0, var_22_arg_0=0, var_22_arg_1=5, var_23=4, var_24=0, var_24_arg_0=0, var_24_arg_1=4, var_25=255, var_25_arg_0=0, var_27_arg_0=255, var_27_arg_1=0, var_39=1] [L94] EXPR ((SORT_26)var_27_arg_0 << 1) | var_27_arg_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=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=5, var_22=0, var_22_arg_0=0, var_22_arg_1=5, var_23=4, var_24=0, var_24_arg_0=0, var_24_arg_1=4, var_25=255, var_25_arg_0=0, var_27_arg_0=255, var_27_arg_1=0, var_39=1] [L94] SORT_26 var_27 = ((SORT_26)var_27_arg_0 << 1) | var_27_arg_1; [L95] EXPR var_27 & mask_SORT_26 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=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=5, var_22=0, var_22_arg_0=0, var_22_arg_1=5, var_23=4, var_24=0, var_24_arg_0=0, var_24_arg_1=4, var_25=255, var_25_arg_0=0, var_27=254, var_27_arg_0=255, var_27_arg_1=0, var_39=1] [L95] var_27 = var_27 & mask_SORT_26 [L96] SORT_26 var_28_arg_0 = var_27; [L97] SORT_1 var_28 = var_28_arg_0 == mask_SORT_26; [L98] SORT_1 var_31_arg_0 = state_18; [L99] SORT_5 var_31_arg_1 = state_29; [L100] SORT_5 var_31_arg_2 = input_7; [L101] SORT_5 var_31 = var_31_arg_0 ? var_31_arg_1 : var_31_arg_2; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=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=5, var_22=0, var_22_arg_0=0, var_22_arg_1=5, var_23=4, var_24=0, var_24_arg_0=0, var_24_arg_1=4, var_25=255, var_25_arg_0=0, var_27=3, var_27_arg_0=255, var_27_arg_1=0, var_28=1, var_28_arg_0=3, var_31=0, var_31_arg_0=0, var_31_arg_1=0, var_31_arg_2=0, var_39=1] [L102] EXPR var_31 & mask_SORT_5 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=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=5, var_22=0, var_22_arg_0=0, var_22_arg_1=5, var_23=4, var_24=0, var_24_arg_0=0, var_24_arg_1=4, var_25=255, var_25_arg_0=0, var_27=3, var_27_arg_0=255, var_27_arg_1=0, var_28=1, var_28_arg_0=3, var_31=0, var_31_arg_0=0, var_31_arg_1=0, var_31_arg_2=0, var_39=1] [L102] var_31 = var_31 & mask_SORT_5 [L103] SORT_5 var_32_arg_0 = var_31; [L104] SORT_5 var_32_arg_1 = var_21; [L105] SORT_1 var_32 = var_32_arg_0 == var_32_arg_1; [L106] SORT_1 var_33_arg_0 = var_25; [L107] SORT_1 var_33_arg_1 = var_32; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=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=5, var_22=0, var_22_arg_0=0, var_22_arg_1=5, var_23=4, var_24=0, var_24_arg_0=0, var_24_arg_1=4, var_25=255, var_25_arg_0=0, var_27=3, var_27_arg_0=255, var_27_arg_1=0, var_28=1, var_28_arg_0=3, var_31=0, var_31_arg_0=0, var_31_arg_1=0, var_31_arg_2=0, var_32=0, var_32_arg_0=0, var_32_arg_1=5, var_33_arg_0=255, var_33_arg_1=0, var_39=1] [L108] EXPR ((SORT_26)var_33_arg_0 << 1) | var_33_arg_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=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=5, var_22=0, var_22_arg_0=0, var_22_arg_1=5, var_23=4, var_24=0, var_24_arg_0=0, var_24_arg_1=4, var_25=255, var_25_arg_0=0, var_27=3, var_27_arg_0=255, var_27_arg_1=0, var_28=1, var_28_arg_0=3, var_31=0, var_31_arg_0=0, var_31_arg_1=0, var_31_arg_2=0, var_32=0, var_32_arg_0=0, var_32_arg_1=5, var_33_arg_0=255, var_33_arg_1=0, var_39=1] [L108] SORT_26 var_33 = ((SORT_26)var_33_arg_0 << 1) | var_33_arg_1; [L109] EXPR var_33 & mask_SORT_26 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=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=5, var_22=0, var_22_arg_0=0, var_22_arg_1=5, var_23=4, var_24=0, var_24_arg_0=0, var_24_arg_1=4, var_25=255, var_25_arg_0=0, var_27=3, var_27_arg_0=255, var_27_arg_1=0, var_28=1, var_28_arg_0=3, var_31=0, var_31_arg_0=0, var_31_arg_1=0, var_31_arg_2=0, var_32=0, var_32_arg_0=0, var_32_arg_1=5, var_33=254, var_33_arg_0=255, var_33_arg_1=0, var_39=1] [L109] var_33 = var_33 & mask_SORT_26 [L110] SORT_26 var_34_arg_0 = var_33; [L111] SORT_1 var_34 = var_34_arg_0 == mask_SORT_26; [L112] SORT_1 var_35_arg_0 = var_28; [L113] SORT_1 var_35_arg_1 = var_34; [L114] SORT_1 var_35 = var_35_arg_0 == var_35_arg_1; [L115] SORT_1 var_36_arg_0 = var_14; [L116] SORT_1 var_36_arg_1 = var_35; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=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=5, var_22=0, var_22_arg_0=0, var_22_arg_1=5, var_23=4, var_24=0, var_24_arg_0=0, var_24_arg_1=4, var_25=255, var_25_arg_0=0, var_27=3, var_27_arg_0=255, var_27_arg_1=0, var_28=1, var_28_arg_0=3, var_31=0, var_31_arg_0=0, var_31_arg_1=0, var_31_arg_2=0, var_32=0, var_32_arg_0=0, var_32_arg_1=5, var_33=3, var_33_arg_0=255, var_33_arg_1=0, var_34=1, var_34_arg_0=3, var_35=1, var_35_arg_0=1, var_35_arg_1=1, var_36_arg_0=255, var_36_arg_1=1, var_39=1] [L117] EXPR var_36_arg_0 | var_36_arg_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=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=5, var_22=0, var_22_arg_0=0, var_22_arg_1=5, var_23=4, var_24=0, var_24_arg_0=0, var_24_arg_1=4, var_25=255, var_25_arg_0=0, var_27=3, var_27_arg_0=255, var_27_arg_1=0, var_28=1, var_28_arg_0=3, var_31=0, var_31_arg_0=0, var_31_arg_1=0, var_31_arg_2=0, var_32=0, var_32_arg_0=0, var_32_arg_1=5, var_33=3, var_33_arg_0=255, var_33_arg_1=0, var_34=1, var_34_arg_0=3, var_35=1, var_35_arg_0=1, var_35_arg_1=1, var_36_arg_0=255, var_36_arg_1=1, var_39=1] [L117] SORT_1 var_36 = var_36_arg_0 | var_36_arg_1; [L118] SORT_1 var_40_arg_0 = var_36; [L119] SORT_1 var_40 = ~var_40_arg_0; [L120] SORT_1 var_41_arg_0 = var_39; [L121] SORT_1 var_41_arg_1 = var_40; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=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=5, var_22=0, var_22_arg_0=0, var_22_arg_1=5, var_23=4, var_24=0, var_24_arg_0=0, var_24_arg_1=4, var_25=255, var_25_arg_0=0, var_27=3, var_27_arg_0=255, var_27_arg_1=0, var_28=1, var_28_arg_0=3, var_31=0, var_31_arg_0=0, var_31_arg_1=0, var_31_arg_2=0, var_32=0, var_32_arg_0=0, var_32_arg_1=5, var_33=3, var_33_arg_0=255, var_33_arg_1=0, var_34=1, var_34_arg_0=3, var_35=1, var_35_arg_0=1, var_35_arg_1=1, var_36=0, var_36_arg_0=255, var_36_arg_1=1, var_39=1, var_40=255, var_40_arg_0=0, var_41_arg_0=1, var_41_arg_1=255] [L122] EXPR var_41_arg_0 & var_41_arg_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=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=5, var_22=0, var_22_arg_0=0, var_22_arg_1=5, var_23=4, var_24=0, var_24_arg_0=0, var_24_arg_1=4, var_25=255, var_25_arg_0=0, var_27=3, var_27_arg_0=255, var_27_arg_1=0, var_28=1, var_28_arg_0=3, var_31=0, var_31_arg_0=0, var_31_arg_1=0, var_31_arg_2=0, var_32=0, var_32_arg_0=0, var_32_arg_1=5, var_33=3, var_33_arg_0=255, var_33_arg_1=0, var_34=1, var_34_arg_0=3, var_35=1, var_35_arg_0=1, var_35_arg_1=1, var_36=0, var_36_arg_0=255, var_36_arg_1=1, var_39=1, var_40=255, var_40_arg_0=0, var_41_arg_0=1, var_41_arg_1=255] [L122] SORT_1 var_41 = var_41_arg_0 & var_41_arg_1; [L123] EXPR var_41 & mask_SORT_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=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=5, var_22=0, var_22_arg_0=0, var_22_arg_1=5, var_23=4, var_24=0, var_24_arg_0=0, var_24_arg_1=4, var_25=255, var_25_arg_0=0, var_27=3, var_27_arg_0=255, var_27_arg_1=0, var_28=1, var_28_arg_0=3, var_31=0, var_31_arg_0=0, var_31_arg_1=0, var_31_arg_2=0, var_32=0, var_32_arg_0=0, var_32_arg_1=5, var_33=3, var_33_arg_0=255, var_33_arg_1=0, var_34=1, var_34_arg_0=3, var_35=1, var_35_arg_0=1, var_35_arg_1=1, var_36=0, var_36_arg_0=255, var_36_arg_1=1, var_39=1, var_40=255, var_40_arg_0=0, var_41=1, var_41_arg_0=1, var_41_arg_1=255] [L123] var_41 = var_41 & mask_SORT_1 [L124] SORT_1 bad_42_arg_0 = var_41; [L125] CALL __VERIFIER_assert(!(bad_42_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3021 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3021 mSDsluCounter, 5344 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3720 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 708 IncrementalHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 1624 mSDtfsCounter, 708 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=15, InterpolantAutomatonStates: 98, 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, 15 MinimizatonAttempts, 571 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 613 NumberOfCodeBlocks, 613 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 557 ConstructedInterpolants, 0 QuantifiedInterpolants, 2155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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:13:08,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...