/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.adding.4.prop1-func-interl.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 18:50:14,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 18:50:14,189 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 18:50:14,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 18:50:14,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 18:50:14,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 18:50:14,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 18:50:14,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 18:50:14,215 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 18:50:14,217 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 18:50:14,218 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 18:50:14,218 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 18:50:14,218 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 18:50:14,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 18:50:14,219 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 18:50:14,219 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 18:50:14,220 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 18:50:14,220 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 18:50:14,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 18:50:14,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 18:50:14,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 18:50:14,221 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 18:50:14,221 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 18:50:14,221 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 18:50:14,221 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 18:50:14,221 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 18:50:14,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 18:50:14,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 18:50:14,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 18:50:14,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 18:50:14,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 18:50:14,223 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 18:50:14,223 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 18:50:14,223 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 18:50:14,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 18:50:14,224 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 18:50:14,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 18:50:14,224 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 18:50:14,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 18:50:14,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 18:50:14,225 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 18:50:14,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 18:50:14,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 18:50:14,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 18:50:14,423 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 18:50:14,424 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 18:50:14,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.adding.4.prop1-func-interl.c [2023-12-16 18:50:15,358 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 18:50:15,510 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 18:50:15,511 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.adding.4.prop1-func-interl.c [2023-12-16 18:50:15,532 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5543fae93/cbe554eda058469fbec07edbd9bbb241/FLAG186e90d56 [2023-12-16 18:50:15,542 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5543fae93/cbe554eda058469fbec07edbd9bbb241 [2023-12-16 18:50:15,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 18:50:15,545 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 18:50:15,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 18:50:15,546 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 18:50:15,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 18:50:15,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:50:15" (1/1) ... [2023-12-16 18:50:15,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32190a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:15, skipping insertion in model container [2023-12-16 18:50:15,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:50:15" (1/1) ... [2023-12-16 18:50:15,580 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 18:50:15,688 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.adding.4.prop1-func-interl.c[1173,1186] [2023-12-16 18:50:15,800 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 18:50:15,810 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 18:50:15,817 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.adding.4.prop1-func-interl.c[1173,1186] [2023-12-16 18:50:15,885 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 18:50:15,894 INFO L206 MainTranslator]: Completed translation [2023-12-16 18:50:15,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:15 WrapperNode [2023-12-16 18:50:15,894 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 18:50:15,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 18:50:15,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 18:50:15,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 18:50:15,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:15" (1/1) ... [2023-12-16 18:50:15,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:15" (1/1) ... [2023-12-16 18:50:16,083 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1873 [2023-12-16 18:50:16,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 18:50:16,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 18:50:16,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 18:50:16,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 18:50:16,151 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:15" (1/1) ... [2023-12-16 18:50:16,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:15" (1/1) ... [2023-12-16 18:50:16,185 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:15" (1/1) ... [2023-12-16 18:50:16,253 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 18:50:16,254 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:15" (1/1) ... [2023-12-16 18:50:16,254 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:15" (1/1) ... [2023-12-16 18:50:16,313 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:15" (1/1) ... [2023-12-16 18:50:16,327 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:15" (1/1) ... [2023-12-16 18:50:16,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:15" (1/1) ... [2023-12-16 18:50:16,360 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:15" (1/1) ... [2023-12-16 18:50:16,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 18:50:16,401 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 18:50:16,401 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 18:50:16,402 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 18:50:16,402 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:15" (1/1) ... [2023-12-16 18:50:16,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 18:50:16,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 18:50:16,425 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 18:50:16,445 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 18:50:16,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 18:50:16,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 18:50:16,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 18:50:16,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 18:50:16,614 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 18:50:16,616 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 18:50:17,734 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 18:50:17,774 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 18:50:17,774 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 18:50:17,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:50:17 BoogieIcfgContainer [2023-12-16 18:50:17,775 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 18:50:17,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 18:50:17,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 18:50:17,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 18:50:17,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 06:50:15" (1/3) ... [2023-12-16 18:50:17,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5b0789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:50:17, skipping insertion in model container [2023-12-16 18:50:17,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:15" (2/3) ... [2023-12-16 18:50:17,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5b0789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:50:17, skipping insertion in model container [2023-12-16 18:50:17,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:50:17" (3/3) ... [2023-12-16 18:50:17,781 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.4.prop1-func-interl.c [2023-12-16 18:50:17,793 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 18:50:17,794 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 18:50:17,839 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 18:50:17,844 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;@45f2225a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 18:50:17,844 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 18:50:17,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 448 states, 446 states have (on average 1.6726457399103138) internal successors, (746), 447 states have internal predecessors, (746), 0 states have call successors, (0), 0 states 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 18:50:17,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-16 18:50:17,853 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:50:17,854 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:50:17,854 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:50:17,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:50:17,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1974890825, now seen corresponding path program 1 times [2023-12-16 18:50:17,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 18:50:17,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220938022] [2023-12-16 18:50:17,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:50:17,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 18:50:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:50:18,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 18:50:18,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 18:50:18,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220938022] [2023-12-16 18:50:18,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220938022] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:50:18,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:50:18,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 18:50:18,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225842507] [2023-12-16 18:50:18,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:50:18,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 18:50:18,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 18:50:18,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 18:50:18,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 18:50:18,333 INFO L87 Difference]: Start difference. First operand has 448 states, 446 states have (on average 1.6726457399103138) internal successors, (746), 447 states have internal predecessors, (746), 0 states have call successors, (0), 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 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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 18:50:18,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:50:18,440 INFO L93 Difference]: Finished difference Result 882 states and 1473 transitions. [2023-12-16 18:50:18,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 18:50:18,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2023-12-16 18:50:18,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:50:18,450 INFO L225 Difference]: With dead ends: 882 [2023-12-16 18:50:18,450 INFO L226 Difference]: Without dead ends: 465 [2023-12-16 18:50:18,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 18:50:18,456 INFO L413 NwaCegarLoop]: 764 mSDtfsCounter, 1397 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:50:18,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1397 Valid, 844 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:50:18,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2023-12-16 18:50:18,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 446. [2023-12-16 18:50:18,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.6651685393258426) internal successors, (741), 445 states have internal predecessors, (741), 0 states have call successors, (0), 0 states 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 18:50:18,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 741 transitions. [2023-12-16 18:50:18,507 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 741 transitions. Word has length 58 [2023-12-16 18:50:18,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:50:18,507 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 741 transitions. [2023-12-16 18:50:18,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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 18:50:18,507 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 741 transitions. [2023-12-16 18:50:18,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-16 18:50:18,509 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:50:18,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:50:18,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 18:50:18,509 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:50:18,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:50:18,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1884258687, now seen corresponding path program 1 times [2023-12-16 18:50:18,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 18:50:18,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885551493] [2023-12-16 18:50:18,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:50:18,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 18:50:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:50:18,734 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 18:50:18,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 18:50:18,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885551493] [2023-12-16 18:50:18,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885551493] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:50:18,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:50:18,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:50:18,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210970071] [2023-12-16 18:50:18,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:50:18,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 18:50:18,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 18:50:18,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 18:50:18,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 18:50:18,742 INFO L87 Difference]: Start difference. First operand 446 states and 741 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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 18:50:18,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:50:18,766 INFO L93 Difference]: Finished difference Result 450 states and 745 transitions. [2023-12-16 18:50:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 18:50:18,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2023-12-16 18:50:18,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:50:18,770 INFO L225 Difference]: With dead ends: 450 [2023-12-16 18:50:18,770 INFO L226 Difference]: Without dead ends: 448 [2023-12-16 18:50:18,770 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 18:50:18,771 INFO L413 NwaCegarLoop]: 738 mSDtfsCounter, 1 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2209 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 18:50:18,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2209 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:50:18,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2023-12-16 18:50:18,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2023-12-16 18:50:18,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 1.662192393736018) internal successors, (743), 447 states have internal predecessors, (743), 0 states have call successors, (0), 0 states 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 18:50:18,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 743 transitions. [2023-12-16 18:50:18,794 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 743 transitions. Word has length 59 [2023-12-16 18:50:18,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:50:18,794 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 743 transitions. [2023-12-16 18:50:18,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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 18:50:18,794 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 743 transitions. [2023-12-16 18:50:18,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-16 18:50:18,798 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:50:18,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:50:18,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 18:50:18,799 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:50:18,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:50:18,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1719248149, now seen corresponding path program 1 times [2023-12-16 18:50:18,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 18:50:18,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300899464] [2023-12-16 18:50:18,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:50:18,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 18:50:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:50:18,921 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 18:50:18,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 18:50:18,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300899464] [2023-12-16 18:50:18,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300899464] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:50:18,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:50:18,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:50:18,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516327983] [2023-12-16 18:50:18,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:50:18,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 18:50:18,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 18:50:18,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 18:50:18,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 18:50:18,926 INFO L87 Difference]: Start difference. First operand 448 states and 743 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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 18:50:18,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:50:18,951 INFO L93 Difference]: Finished difference Result 868 states and 1439 transitions. [2023-12-16 18:50:18,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 18:50:18,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2023-12-16 18:50:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:50:18,954 INFO L225 Difference]: With dead ends: 868 [2023-12-16 18:50:18,954 INFO L226 Difference]: Without dead ends: 451 [2023-12-16 18:50:18,957 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 18:50:18,958 INFO L413 NwaCegarLoop]: 738 mSDtfsCounter, 1 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2207 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 18:50:18,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2207 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:50:18,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2023-12-16 18:50:18,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 450. [2023-12-16 18:50:18,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 1.6592427616926504) internal successors, (745), 449 states have internal predecessors, (745), 0 states have call successors, (0), 0 states 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 18:50:18,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 745 transitions. [2023-12-16 18:50:18,966 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 745 transitions. Word has length 60 [2023-12-16 18:50:18,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:50:18,967 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 745 transitions. [2023-12-16 18:50:18,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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 18:50:18,968 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 745 transitions. [2023-12-16 18:50:18,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-16 18:50:18,971 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:50:18,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:50:18,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 18:50:18,975 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:50:18,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:50:18,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1546652955, now seen corresponding path program 1 times [2023-12-16 18:50:18,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 18:50:18,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898723702] [2023-12-16 18:50:18,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:50:18,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 18:50:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:50:19,088 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 18:50:19,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 18:50:19,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898723702] [2023-12-16 18:50:19,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898723702] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:50:19,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:50:19,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:50:19,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531157151] [2023-12-16 18:50:19,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:50:19,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 18:50:19,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 18:50:19,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 18:50:19,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 18:50:19,090 INFO L87 Difference]: Start difference. First operand 450 states and 745 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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 18:50:19,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:50:19,126 INFO L93 Difference]: Finished difference Result 1278 states and 2118 transitions. [2023-12-16 18:50:19,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 18:50:19,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2023-12-16 18:50:19,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:50:19,129 INFO L225 Difference]: With dead ends: 1278 [2023-12-16 18:50:19,129 INFO L226 Difference]: Without dead ends: 859 [2023-12-16 18:50:19,130 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 18:50:19,134 INFO L413 NwaCegarLoop]: 819 mSDtfsCounter, 676 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 2365 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:50:19,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 2365 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:50:19,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2023-12-16 18:50:19,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 452. [2023-12-16 18:50:19,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 1.6563192904656319) internal successors, (747), 451 states have internal predecessors, (747), 0 states have call successors, (0), 0 states 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 18:50:19,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 747 transitions. [2023-12-16 18:50:19,145 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 747 transitions. Word has length 61 [2023-12-16 18:50:19,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:50:19,146 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 747 transitions. [2023-12-16 18:50:19,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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 18:50:19,146 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 747 transitions. [2023-12-16 18:50:19,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-16 18:50:19,147 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:50:19,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:50:19,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 18:50:19,148 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:50:19,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:50:19,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1993458821, now seen corresponding path program 1 times [2023-12-16 18:50:19,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 18:50:19,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914724301] [2023-12-16 18:50:19,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:50:19,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 18:50:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:50:19,305 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 18:50:19,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 18:50:19,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914724301] [2023-12-16 18:50:19,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914724301] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:50:19,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:50:19,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:50:19,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63251584] [2023-12-16 18:50:19,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:50:19,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:50:19,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 18:50:19,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:50:19,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:50:19,308 INFO L87 Difference]: Start difference. First operand 452 states and 747 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:50:19,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:50:19,771 INFO L93 Difference]: Finished difference Result 1292 states and 2137 transitions. [2023-12-16 18:50:19,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:50:19,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2023-12-16 18:50:19,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:50:19,775 INFO L225 Difference]: With dead ends: 1292 [2023-12-16 18:50:19,775 INFO L226 Difference]: Without dead ends: 871 [2023-12-16 18:50:19,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 18:50:19,776 INFO L413 NwaCegarLoop]: 553 mSDtfsCounter, 2068 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2068 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 18:50:19,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2068 Valid, 1653 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 18:50:19,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2023-12-16 18:50:19,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 503. [2023-12-16 18:50:19,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 502 states have (on average 1.653386454183267) internal successors, (830), 502 states have internal predecessors, (830), 0 states have call successors, (0), 0 states 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 18:50:19,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 830 transitions. [2023-12-16 18:50:19,785 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 830 transitions. Word has length 62 [2023-12-16 18:50:19,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:50:19,785 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 830 transitions. [2023-12-16 18:50:19,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:50:19,786 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 830 transitions. [2023-12-16 18:50:19,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-16 18:50:19,786 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:50:19,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:50:19,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 18:50:19,786 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:50:19,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:50:19,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1908481465, now seen corresponding path program 1 times [2023-12-16 18:50:19,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 18:50:19,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948770044] [2023-12-16 18:50:19,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:50:19,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 18:50:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:50:19,957 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 18:50:19,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 18:50:19,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948770044] [2023-12-16 18:50:19,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948770044] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:50:19,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:50:19,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 18:50:19,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782047786] [2023-12-16 18:50:19,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:50:19,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:50:19,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 18:50:19,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:50:19,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:50:19,959 INFO L87 Difference]: Start difference. First operand 503 states and 830 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:50:20,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:50:20,026 INFO L93 Difference]: Finished difference Result 1402 states and 2313 transitions. [2023-12-16 18:50:20,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 18:50:20,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2023-12-16 18:50:20,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:50:20,029 INFO L225 Difference]: With dead ends: 1402 [2023-12-16 18:50:20,029 INFO L226 Difference]: Without dead ends: 955 [2023-12-16 18:50:20,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 18:50:20,031 INFO L413 NwaCegarLoop]: 766 mSDtfsCounter, 2059 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2059 SdHoareTripleChecker+Valid, 2375 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:50:20,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2059 Valid, 2375 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:50:20,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2023-12-16 18:50:20,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 507. [2023-12-16 18:50:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 506 states have (on average 1.6482213438735178) internal successors, (834), 506 states have internal predecessors, (834), 0 states have call successors, (0), 0 states 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 18:50:20,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 834 transitions. [2023-12-16 18:50:20,045 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 834 transitions. Word has length 62 [2023-12-16 18:50:20,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:50:20,046 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 834 transitions. [2023-12-16 18:50:20,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:50:20,047 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 834 transitions. [2023-12-16 18:50:20,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-16 18:50:20,047 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:50:20,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:50:20,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 18:50:20,047 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:50:20,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:50:20,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1201586478, now seen corresponding path program 1 times [2023-12-16 18:50:20,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 18:50:20,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418923914] [2023-12-16 18:50:20,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:50:20,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 18:50:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:50:20,292 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 18:50:20,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 18:50:20,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418923914] [2023-12-16 18:50:20,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418923914] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:50:20,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:50:20,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 18:50:20,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217191146] [2023-12-16 18:50:20,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:50:20,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 18:50:20,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 18:50:20,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 18:50:20,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 18:50:20,294 INFO L87 Difference]: Start difference. First operand 507 states and 834 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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 18:50:20,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:50:20,439 INFO L93 Difference]: Finished difference Result 1421 states and 2340 transitions. [2023-12-16 18:50:20,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 18:50:20,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2023-12-16 18:50:20,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:50:20,442 INFO L225 Difference]: With dead ends: 1421 [2023-12-16 18:50:20,442 INFO L226 Difference]: Without dead ends: 975 [2023-12-16 18:50:20,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 18:50:20,443 INFO L413 NwaCegarLoop]: 755 mSDtfsCounter, 2060 mSDsluCounter, 2204 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2060 SdHoareTripleChecker+Valid, 2959 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 18:50:20,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2060 Valid, 2959 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 18:50:20,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2023-12-16 18:50:20,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 511. [2023-12-16 18:50:20,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 1.6431372549019607) internal successors, (838), 510 states have internal predecessors, (838), 0 states have call successors, (0), 0 states 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 18:50:20,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 838 transitions. [2023-12-16 18:50:20,453 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 838 transitions. Word has length 63 [2023-12-16 18:50:20,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:50:20,453 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 838 transitions. [2023-12-16 18:50:20,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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 18:50:20,454 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 838 transitions. [2023-12-16 18:50:20,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-16 18:50:20,454 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:50:20,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:50:20,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 18:50:20,454 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:50:20,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:50:20,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1342135088, now seen corresponding path program 1 times [2023-12-16 18:50:20,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 18:50:20,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083117717] [2023-12-16 18:50:20,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:50:20,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 18:50:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:50:20,559 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 18:50:20,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 18:50:20,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083117717] [2023-12-16 18:50:20,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083117717] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:50:20,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:50:20,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 18:50:20,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41321811] [2023-12-16 18:50:20,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:50:20,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 18:50:20,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 18:50:20,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 18:50:20,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 18:50:20,561 INFO L87 Difference]: Start difference. First operand 511 states and 838 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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 18:50:20,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:50:20,585 INFO L93 Difference]: Finished difference Result 962 states and 1580 transitions. [2023-12-16 18:50:20,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 18:50:20,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2023-12-16 18:50:20,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:50:20,587 INFO L225 Difference]: With dead ends: 962 [2023-12-16 18:50:20,587 INFO L226 Difference]: Without dead ends: 511 [2023-12-16 18:50:20,588 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 18:50:20,589 INFO L413 NwaCegarLoop]: 769 mSDtfsCounter, 1391 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:50:20,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1391 Valid, 855 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:50:20,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2023-12-16 18:50:20,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2023-12-16 18:50:20,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 1.6392156862745098) internal successors, (836), 510 states have internal predecessors, (836), 0 states have call successors, (0), 0 states 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 18:50:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 836 transitions. [2023-12-16 18:50:20,599 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 836 transitions. Word has length 63 [2023-12-16 18:50:20,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:50:20,599 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 836 transitions. [2023-12-16 18:50:20,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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 18:50:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 836 transitions. [2023-12-16 18:50:20,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-16 18:50:20,599 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:50:20,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:50:20,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 18:50:20,600 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:50:20,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:50:20,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1513329592, now seen corresponding path program 1 times [2023-12-16 18:50:20,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 18:50:20,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691138479] [2023-12-16 18:50:20,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:50:20,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 18:50:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:50:20,724 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 18:50:20,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 18:50:20,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691138479] [2023-12-16 18:50:20,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691138479] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:50:20,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:50:20,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:50:20,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059882701] [2023-12-16 18:50:20,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:50:20,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:50:20,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 18:50:20,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:50:20,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:50:20,726 INFO L87 Difference]: Start difference. First operand 511 states and 836 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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 18:50:20,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:50:20,777 INFO L93 Difference]: Finished difference Result 1350 states and 2217 transitions. [2023-12-16 18:50:20,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 18:50:20,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2023-12-16 18:50:20,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:50:20,780 INFO L225 Difference]: With dead ends: 1350 [2023-12-16 18:50:20,780 INFO L226 Difference]: Without dead ends: 893 [2023-12-16 18:50:20,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:50:20,782 INFO L413 NwaCegarLoop]: 767 mSDtfsCounter, 2782 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2782 SdHoareTripleChecker+Valid, 2235 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 18:50:20,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2782 Valid, 2235 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:50:20,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2023-12-16 18:50:20,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 506. [2023-12-16 18:50:20,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 1.6376237623762375) internal successors, (827), 505 states have internal predecessors, (827), 0 states have call successors, (0), 0 states 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 18:50:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 827 transitions. [2023-12-16 18:50:20,792 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 827 transitions. Word has length 63 [2023-12-16 18:50:20,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:50:20,793 INFO L495 AbstractCegarLoop]: Abstraction has 506 states and 827 transitions. [2023-12-16 18:50:20,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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 18:50:20,793 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 827 transitions. [2023-12-16 18:50:20,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-16 18:50:20,793 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:50:20,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:50:20,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 18:50:20,794 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:50:20,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:50:20,794 INFO L85 PathProgramCache]: Analyzing trace with hash 770118977, now seen corresponding path program 1 times [2023-12-16 18:50:20,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 18:50:20,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113991628] [2023-12-16 18:50:20,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:50:20,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 18:50:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:50:20,913 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 18:50:20,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 18:50:20,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113991628] [2023-12-16 18:50:20,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113991628] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:50:20,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:50:20,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 18:50:20,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889209435] [2023-12-16 18:50:20,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:50:20,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 18:50:20,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 18:50:20,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 18:50:20,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 18:50:20,915 INFO L87 Difference]: Start difference. First operand 506 states and 827 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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 18:50:21,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:50:21,017 INFO L93 Difference]: Finished difference Result 1380 states and 2259 transitions. [2023-12-16 18:50:21,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 18:50:21,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2023-12-16 18:50:21,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:50:21,020 INFO L225 Difference]: With dead ends: 1380 [2023-12-16 18:50:21,020 INFO L226 Difference]: Without dead ends: 937 [2023-12-16 18:50:21,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 18:50:21,021 INFO L413 NwaCegarLoop]: 1341 mSDtfsCounter, 1376 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 18:50:21,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 2034 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 18:50:21,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2023-12-16 18:50:21,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 509. [2023-12-16 18:50:21,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.624015748031496) internal successors, (825), 508 states have internal predecessors, (825), 0 states have call successors, (0), 0 states 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 18:50:21,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 825 transitions. [2023-12-16 18:50:21,032 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 825 transitions. Word has length 64 [2023-12-16 18:50:21,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:50:21,032 INFO L495 AbstractCegarLoop]: Abstraction has 509 states and 825 transitions. [2023-12-16 18:50:21,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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 18:50:21,033 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 825 transitions. [2023-12-16 18:50:21,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-16 18:50:21,033 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:50:21,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:50:21,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 18:50:21,033 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:50:21,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:50:21,034 INFO L85 PathProgramCache]: Analyzing trace with hash 800873730, now seen corresponding path program 1 times [2023-12-16 18:50:21,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 18:50:21,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423845507] [2023-12-16 18:50:21,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:50:21,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 18:50:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:50:21,485 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 18:50:21,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 18:50:21,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423845507] [2023-12-16 18:50:21,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423845507] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:50:21,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:50:21,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 18:50:21,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166849123] [2023-12-16 18:50:21,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:50:21,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 18:50:21,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 18:50:21,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 18:50:21,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-16 18:50:21,487 INFO L87 Difference]: Start difference. First operand 509 states and 825 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 18:50:22,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:50:22,144 INFO L93 Difference]: Finished difference Result 2650 states and 4325 transitions. [2023-12-16 18:50:22,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 18:50:22,145 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2023-12-16 18:50:22,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:50:22,151 INFO L225 Difference]: With dead ends: 2650 [2023-12-16 18:50:22,152 INFO L226 Difference]: Without dead ends: 2208 [2023-12-16 18:50:22,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2023-12-16 18:50:22,155 INFO L413 NwaCegarLoop]: 2057 mSDtfsCounter, 4716 mSDsluCounter, 9640 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4716 SdHoareTripleChecker+Valid, 11697 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 18:50:22,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4716 Valid, 11697 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 18:50:22,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2023-12-16 18:50:22,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 523. [2023-12-16 18:50:22,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 1.6130268199233717) internal successors, (842), 522 states have internal predecessors, (842), 0 states have call successors, (0), 0 states 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 18:50:22,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 842 transitions. [2023-12-16 18:50:22,173 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 842 transitions. Word has length 65 [2023-12-16 18:50:22,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:50:22,173 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 842 transitions. [2023-12-16 18:50:22,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 18:50:22,173 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 842 transitions. [2023-12-16 18:50:22,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-16 18:50:22,174 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:50:22,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:50:22,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 18:50:22,175 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:50:22,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:50:22,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1223575556, now seen corresponding path program 1 times [2023-12-16 18:50:22,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 18:50:22,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869721865] [2023-12-16 18:50:22,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:50:22,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 18:50:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:50:22,436 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 18:50:22,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 18:50:22,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869721865] [2023-12-16 18:50:22,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869721865] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:50:22,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:50:22,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 18:50:22,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706807881] [2023-12-16 18:50:22,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:50:22,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 18:50:22,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 18:50:22,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 18:50:22,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 18:50:22,437 INFO L87 Difference]: Start difference. First operand 523 states and 842 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 18:50:22,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:50:22,524 INFO L93 Difference]: Finished difference Result 1394 states and 2260 transitions. [2023-12-16 18:50:22,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 18:50:22,524 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2023-12-16 18:50:22,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:50:22,527 INFO L225 Difference]: With dead ends: 1394 [2023-12-16 18:50:22,527 INFO L226 Difference]: Without dead ends: 957 [2023-12-16 18:50:22,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-16 18:50:22,529 INFO L413 NwaCegarLoop]: 804 mSDtfsCounter, 2638 mSDsluCounter, 3055 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2638 SdHoareTripleChecker+Valid, 3859 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:50:22,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2638 Valid, 3859 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:50:22,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2023-12-16 18:50:22,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 529. [2023-12-16 18:50:22,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.6098484848484849) internal successors, (850), 528 states have internal predecessors, (850), 0 states have call successors, (0), 0 states 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 18:50:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 850 transitions. [2023-12-16 18:50:22,543 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 850 transitions. Word has length 65 [2023-12-16 18:50:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:50:22,543 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 850 transitions. [2023-12-16 18:50:22,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 18:50:22,543 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 850 transitions. [2023-12-16 18:50:22,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-16 18:50:22,544 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:50:22,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:50:22,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 18:50:22,544 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:50:22,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:50:22,544 INFO L85 PathProgramCache]: Analyzing trace with hash -306144504, now seen corresponding path program 1 times [2023-12-16 18:50:22,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 18:50:22,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741270748] [2023-12-16 18:50:22,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:50:22,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 18:50:22,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:50:22,900 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 18:50:22,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 18:50:22,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741270748] [2023-12-16 18:50:22,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741270748] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:50:22,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:50:22,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 18:50:22,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249910328] [2023-12-16 18:50:22,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:50:22,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 18:50:22,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 18:50:22,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 18:50:22,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-16 18:50:22,902 INFO L87 Difference]: Start difference. First operand 529 states and 850 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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 18:50:23,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:50:23,118 INFO L93 Difference]: Finished difference Result 1007 states and 1622 transitions. [2023-12-16 18:50:23,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 18:50:23,118 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2023-12-16 18:50:23,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:50:23,120 INFO L225 Difference]: With dead ends: 1007 [2023-12-16 18:50:23,120 INFO L226 Difference]: Without dead ends: 552 [2023-12-16 18:50:23,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-16 18:50:23,121 INFO L413 NwaCegarLoop]: 732 mSDtfsCounter, 1403 mSDsluCounter, 2180 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1403 SdHoareTripleChecker+Valid, 2912 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 18:50:23,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1403 Valid, 2912 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 18:50:23,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2023-12-16 18:50:23,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 543. [2023-12-16 18:50:23,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 542 states have (on average 1.6014760147601477) internal successors, (868), 542 states have internal predecessors, (868), 0 states have call successors, (0), 0 states 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 18:50:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 868 transitions. [2023-12-16 18:50:23,131 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 868 transitions. Word has length 66 [2023-12-16 18:50:23,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:50:23,131 INFO L495 AbstractCegarLoop]: Abstraction has 543 states and 868 transitions. [2023-12-16 18:50:23,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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 18:50:23,131 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 868 transitions. [2023-12-16 18:50:23,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-16 18:50:23,132 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:50:23,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:50:23,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 18:50:23,132 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:50:23,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:50:23,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1995088246, now seen corresponding path program 1 times [2023-12-16 18:50:23,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 18:50:23,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561571353] [2023-12-16 18:50:23,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:50:23,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 18:50:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:50:23,259 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 18:50:23,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 18:50:23,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561571353] [2023-12-16 18:50:23,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561571353] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:50:23,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:50:23,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:50:23,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53140803] [2023-12-16 18:50:23,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:50:23,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 18:50:23,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 18:50:23,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 18:50:23,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 18:50:23,260 INFO L87 Difference]: Start difference. First operand 543 states and 868 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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 18:50:23,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:50:23,342 INFO L93 Difference]: Finished difference Result 1426 states and 2298 transitions. [2023-12-16 18:50:23,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 18:50:23,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2023-12-16 18:50:23,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:50:23,345 INFO L225 Difference]: With dead ends: 1426 [2023-12-16 18:50:23,345 INFO L226 Difference]: Without dead ends: 965 [2023-12-16 18:50:23,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 18:50:23,346 INFO L413 NwaCegarLoop]: 1340 mSDtfsCounter, 1418 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1418 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 18:50:23,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1418 Valid, 2038 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 18:50:23,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2023-12-16 18:50:23,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 539. [2023-12-16 18:50:23,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 1.6022304832713754) internal successors, (862), 538 states have internal predecessors, (862), 0 states have call successors, (0), 0 states 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 18:50:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 862 transitions. [2023-12-16 18:50:23,358 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 862 transitions. Word has length 66 [2023-12-16 18:50:23,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:50:23,358 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 862 transitions. [2023-12-16 18:50:23,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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 18:50:23,359 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 862 transitions. [2023-12-16 18:50:23,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-16 18:50:23,359 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:50:23,359 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:50:23,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 18:50:23,359 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:50:23,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:50:23,360 INFO L85 PathProgramCache]: Analyzing trace with hash -2009424954, now seen corresponding path program 1 times [2023-12-16 18:50:23,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 18:50:23,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734079238] [2023-12-16 18:50:23,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:50:23,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 18:50:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:50:23,549 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 18:50:23,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 18:50:23,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734079238] [2023-12-16 18:50:23,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734079238] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:50:23,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:50:23,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 18:50:23,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501636107] [2023-12-16 18:50:23,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:50:23,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:50:23,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 18:50:23,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:50:23,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:50:23,550 INFO L87 Difference]: Start difference. First operand 539 states and 862 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:50:23,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:50:23,746 INFO L93 Difference]: Finished difference Result 1862 states and 3012 transitions. [2023-12-16 18:50:23,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 18:50:23,747 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2023-12-16 18:50:23,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:50:23,752 INFO L225 Difference]: With dead ends: 1862 [2023-12-16 18:50:23,752 INFO L226 Difference]: Without dead ends: 1408 [2023-12-16 18:50:23,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-12-16 18:50:23,754 INFO L413 NwaCegarLoop]: 1403 mSDtfsCounter, 1394 mSDsluCounter, 7086 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1394 SdHoareTripleChecker+Valid, 8489 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 18:50:23,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1394 Valid, 8489 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 18:50:23,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2023-12-16 18:50:23,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 547. [2023-12-16 18:50:23,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.5970695970695972) internal successors, (872), 546 states have internal predecessors, (872), 0 states have call successors, (0), 0 states 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 18:50:23,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 872 transitions. [2023-12-16 18:50:23,768 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 872 transitions. Word has length 67 [2023-12-16 18:50:23,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:50:23,769 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 872 transitions. [2023-12-16 18:50:23,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:50:23,769 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 872 transitions. [2023-12-16 18:50:23,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-16 18:50:23,769 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:50:23,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:50:23,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 18:50:23,769 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:50:23,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:50:23,770 INFO L85 PathProgramCache]: Analyzing trace with hash 697194440, now seen corresponding path program 1 times [2023-12-16 18:50:23,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 18:50:23,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933532359] [2023-12-16 18:50:23,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:50:23,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 18:50:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:50:23,986 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 18:50:23,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 18:50:23,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933532359] [2023-12-16 18:50:23,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933532359] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:50:23,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:50:23,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 18:50:23,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540396543] [2023-12-16 18:50:23,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:50:23,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 18:50:23,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 18:50:23,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 18:50:23,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 18:50:23,989 INFO L87 Difference]: Start difference. First operand 547 states and 872 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:50:24,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:50:24,106 INFO L93 Difference]: Finished difference Result 1003 states and 1612 transitions. [2023-12-16 18:50:24,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:50:24,107 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2023-12-16 18:50:24,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:50:24,108 INFO L225 Difference]: With dead ends: 1003 [2023-12-16 18:50:24,109 INFO L226 Difference]: Without dead ends: 533 [2023-12-16 18:50:24,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-16 18:50:24,110 INFO L413 NwaCegarLoop]: 700 mSDtfsCounter, 713 mSDsluCounter, 2076 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 2776 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 18:50:24,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 2776 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 18:50:24,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2023-12-16 18:50:24,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 529. [2023-12-16 18:50:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.6041666666666667) internal successors, (847), 528 states have internal predecessors, (847), 0 states have call successors, (0), 0 states 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 18:50:24,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 847 transitions. [2023-12-16 18:50:24,119 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 847 transitions. Word has length 67 [2023-12-16 18:50:24,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:50:24,119 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 847 transitions. [2023-12-16 18:50:24,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:50:24,120 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 847 transitions. [2023-12-16 18:50:24,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-16 18:50:24,120 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:50:24,120 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:50:24,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 18:50:24,120 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:50:24,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:50:24,121 INFO L85 PathProgramCache]: Analyzing trace with hash 480104008, now seen corresponding path program 1 times [2023-12-16 18:50:24,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 18:50:24,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513636697] [2023-12-16 18:50:24,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:50:24,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 18:50:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:50:24,234 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 18:50:24,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 18:50:24,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513636697] [2023-12-16 18:50:24,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513636697] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:50:24,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:50:24,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 18:50:24,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50477649] [2023-12-16 18:50:24,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:50:24,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 18:50:24,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 18:50:24,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 18:50:24,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 18:50:24,236 INFO L87 Difference]: Start difference. First operand 529 states and 847 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:50:24,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:50:24,287 INFO L93 Difference]: Finished difference Result 988 states and 1590 transitions. [2023-12-16 18:50:24,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 18:50:24,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2023-12-16 18:50:24,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:50:24,289 INFO L225 Difference]: With dead ends: 988 [2023-12-16 18:50:24,290 INFO L226 Difference]: Without dead ends: 541 [2023-12-16 18:50:24,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 18:50:24,291 INFO L413 NwaCegarLoop]: 716 mSDtfsCounter, 697 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:50:24,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 1424 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 18:50:24,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2023-12-16 18:50:24,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 531. [2023-12-16 18:50:24,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 1.6018867924528302) internal successors, (849), 530 states have internal predecessors, (849), 0 states have call successors, (0), 0 states 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 18:50:24,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 849 transitions. [2023-12-16 18:50:24,300 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 849 transitions. Word has length 67 [2023-12-16 18:50:24,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:50:24,301 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 849 transitions. [2023-12-16 18:50:24,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:50:24,301 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 849 transitions. [2023-12-16 18:50:24,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-16 18:50:24,301 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:50:24,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:50:24,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-16 18:50:24,301 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:50:24,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:50:24,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1108243894, now seen corresponding path program 1 times [2023-12-16 18:50:24,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 18:50:24,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186009699] [2023-12-16 18:50:24,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:50:24,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 18:50:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:50:24,519 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 18:50:24,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 18:50:24,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186009699] [2023-12-16 18:50:24,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186009699] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:50:24,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:50:24,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 18:50:24,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269600662] [2023-12-16 18:50:24,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:50:24,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 18:50:24,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 18:50:24,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 18:50:24,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 18:50:24,520 INFO L87 Difference]: Start difference. First operand 531 states and 849 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:50:24,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:50:24,763 INFO L93 Difference]: Finished difference Result 1404 states and 2265 transitions. [2023-12-16 18:50:24,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 18:50:24,763 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2023-12-16 18:50:24,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:50:24,766 INFO L225 Difference]: With dead ends: 1404 [2023-12-16 18:50:24,766 INFO L226 Difference]: Without dead ends: 965 [2023-12-16 18:50:24,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-12-16 18:50:24,767 INFO L413 NwaCegarLoop]: 1348 mSDtfsCounter, 2027 mSDsluCounter, 4081 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2027 SdHoareTripleChecker+Valid, 5429 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 18:50:24,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2027 Valid, 5429 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 18:50:24,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2023-12-16 18:50:24,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 531. [2023-12-16 18:50:24,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 1.6018867924528302) internal successors, (849), 530 states have internal predecessors, (849), 0 states have call successors, (0), 0 states 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 18:50:24,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 849 transitions. [2023-12-16 18:50:24,779 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 849 transitions. Word has length 67 [2023-12-16 18:50:24,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:50:24,779 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 849 transitions. [2023-12-16 18:50:24,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:50:24,779 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 849 transitions. [2023-12-16 18:50:24,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-16 18:50:24,779 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:50:24,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:50:24,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-16 18:50:24,780 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 18:50:24,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:50:24,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1695049908, now seen corresponding path program 1 times [2023-12-16 18:50:24,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 18:50:24,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087548611] [2023-12-16 18:50:24,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:50:24,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 18:50:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 18:50:24,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 18:50:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 18:50:24,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 18:50:24,870 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 18:50:24,871 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 18:50:24,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-16 18:50:24,874 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:50:24,876 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 18:50:24,919 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 18:50:24,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 06:50:24 BoogieIcfgContainer [2023-12-16 18:50:24,931 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 18:50:24,931 INFO L158 Benchmark]: Toolchain (without parser) took 9386.43ms. Allocated memory was 367.0MB in the beginning and 832.6MB in the end (delta: 465.6MB). Free memory was 314.2MB in the beginning and 726.5MB in the end (delta: -412.2MB). Peak memory consumption was 53.7MB. Max. memory is 8.0GB. [2023-12-16 18:50:24,931 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 201.3MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 18:50:24,932 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.96ms. Allocated memory is still 367.0MB. Free memory was 314.2MB in the beginning and 286.8MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2023-12-16 18:50:24,932 INFO L158 Benchmark]: Boogie Procedure Inliner took 188.73ms. Allocated memory is still 367.0MB. Free memory was 286.8MB in the beginning and 302.9MB in the end (delta: -16.1MB). Peak memory consumption was 36.9MB. Max. memory is 8.0GB. [2023-12-16 18:50:24,932 INFO L158 Benchmark]: Boogie Preprocessor took 315.70ms. Allocated memory is still 367.0MB. Free memory was 302.9MB in the beginning and 291.8MB in the end (delta: 11.1MB). Peak memory consumption was 18.4MB. Max. memory is 8.0GB. [2023-12-16 18:50:24,932 INFO L158 Benchmark]: RCFGBuilder took 1374.14ms. Allocated memory was 367.0MB in the beginning and 648.0MB in the end (delta: 281.0MB). Free memory was 291.8MB in the beginning and 508.3MB in the end (delta: -216.5MB). Peak memory consumption was 89.7MB. Max. memory is 8.0GB. [2023-12-16 18:50:24,932 INFO L158 Benchmark]: TraceAbstraction took 7153.98ms. Allocated memory was 648.0MB in the beginning and 832.6MB in the end (delta: 184.5MB). Free memory was 507.8MB in the beginning and 726.5MB in the end (delta: -218.6MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 18:50:24,933 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.10ms. Allocated memory is still 201.3MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 348.96ms. Allocated memory is still 367.0MB. Free memory was 314.2MB in the beginning and 286.8MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 188.73ms. Allocated memory is still 367.0MB. Free memory was 286.8MB in the beginning and 302.9MB in the end (delta: -16.1MB). Peak memory consumption was 36.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 315.70ms. Allocated memory is still 367.0MB. Free memory was 302.9MB in the beginning and 291.8MB in the end (delta: 11.1MB). Peak memory consumption was 18.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1374.14ms. Allocated memory was 367.0MB in the beginning and 648.0MB in the end (delta: 281.0MB). Free memory was 291.8MB in the beginning and 508.3MB in the end (delta: -216.5MB). Peak memory consumption was 89.7MB. Max. memory is 8.0GB. * TraceAbstraction took 7153.98ms. Allocated memory was 648.0MB in the beginning and 832.6MB in the end (delta: 184.5MB). Free memory was 507.8MB in the beginning and 726.5MB in the end (delta: -218.6MB). There was no memory consumed. 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 shiftRight at line 109, overapproximation of bitwiseAnd at line 116. 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_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 5); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (5 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 16); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (16 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_3 var_5 = 0; [L39] const SORT_1 var_12 = 0; [L40] const SORT_4 var_27 = 749; [L41] const SORT_3 var_28 = 1; [L42] const SORT_3 var_30 = 0; [L43] const SORT_4 var_32 = 16; [L44] const SORT_4 var_79 = 400; [L46] SORT_1 input_37; [L47] SORT_1 input_38; [L48] SORT_1 input_43; [L49] SORT_1 input_48; [L50] SORT_1 input_52; [L51] SORT_1 input_57; [L53] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, var_12=0, var_27=749, var_28=1, var_30=0, var_32=16, var_5=0, var_79=400] [L53] SORT_3 state_6 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L54] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_6=0, var_12=0, var_27=749, var_28=1, var_30=0, var_32=16, var_5=0, var_79=400] [L54] SORT_3 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L55] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_30=0, var_32=16, var_5=0, var_79=400] [L55] SORT_3 state_10 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_30=0, var_32=16, var_5=0, var_79=400] [L56] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_30=0, var_32=16, var_5=0, var_79=400] [L57] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_30=0, var_32=16, var_5=0, var_79=400] [L58] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_30=0, var_32=16, var_5=0, var_79=400] [L59] SORT_1 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_30=0, var_32=16, var_5=0, var_79=400] [L60] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_30=0, var_32=16, var_5=0, var_79=400] [L61] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_30=0, var_32=16, var_5=0, var_79=400] [L62] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L64] SORT_3 init_7_arg_1 = var_5; [L65] state_6 = init_7_arg_1 [L66] SORT_3 init_9_arg_1 = var_5; [L67] state_8 = init_9_arg_1 [L68] SORT_3 init_11_arg_1 = var_5; [L69] state_10 = init_11_arg_1 [L70] SORT_1 init_14_arg_1 = var_12; [L71] state_13 = init_14_arg_1 [L72] SORT_1 init_16_arg_1 = var_12; [L73] state_15 = init_16_arg_1 [L74] SORT_1 init_18_arg_1 = var_12; [L75] state_17 = init_18_arg_1 [L76] SORT_1 init_20_arg_1 = var_12; [L77] state_19 = init_20_arg_1 [L78] SORT_1 init_22_arg_1 = var_12; [L79] state_21 = init_22_arg_1 [L80] SORT_1 init_24_arg_1 = var_12; [L81] state_23 = init_24_arg_1 [L82] SORT_1 init_26_arg_1 = var_12; [L83] state_25 = init_26_arg_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_30=0, var_32=16, var_5=0, var_79=400] [L86] input_37 = __VERIFIER_nondet_uchar() [L87] EXPR input_37 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_30=0, var_32=16, var_5=0, var_79=400] [L87] input_37 = input_37 & mask_SORT_1 [L88] input_38 = __VERIFIER_nondet_uchar() [L89] EXPR input_38 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_30=0, var_32=16, var_5=0, var_79=400] [L89] input_38 = input_38 & mask_SORT_1 [L90] input_43 = __VERIFIER_nondet_uchar() [L91] EXPR input_43 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_30=0, var_32=16, var_5=0, var_79=400] [L91] input_43 = input_43 & mask_SORT_1 [L92] input_48 = __VERIFIER_nondet_uchar() [L93] EXPR input_48 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_30=0, var_32=16, var_5=0, var_79=400] [L93] input_48 = input_48 & mask_SORT_1 [L94] input_52 = __VERIFIER_nondet_uchar() [L95] EXPR input_52 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_30=0, var_32=16, var_5=0, var_79=400] [L95] input_52 = input_52 & mask_SORT_1 [L96] input_57 = __VERIFIER_nondet_uchar() [L97] EXPR input_57 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_30=0, var_32=16, var_5=0, var_79=400] [L97] input_57 = input_57 & mask_SORT_1 [L100] SORT_3 var_29_arg_0 = var_28; [L101] SORT_3 var_29_arg_1 = state_6; VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_32=16, var_5=0, var_79=400] [L102] EXPR var_29_arg_0 ^ var_29_arg_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_32=16, var_5=0, var_79=400] [L102] SORT_3 var_29 = var_29_arg_0 ^ var_29_arg_1; [L103] SORT_3 var_31_arg_0 = var_29; [L104] SORT_3 var_31_arg_1 = var_30; VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_5=0, var_79=400] [L105] EXPR ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_5=0, var_79=400] [L105] SORT_4 var_31 = ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1; [L106] SORT_4 var_33_arg_0 = var_31; VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0=65536, var_5=0, var_79=400] [L107] EXPR var_33_arg_0 & msb_SORT_4 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0=65536, var_5=0, var_79=400] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0=65536, var_5=0, var_79=400] [L107] EXPR var_33_arg_0 & mask_SORT_4 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0=65536, var_5=0, var_79=400] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0=65536, var_5=0, var_79=400] [L107] var_33_arg_0 = (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) [L108] SORT_4 var_33_arg_1 = var_32; VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0=750, var_33_arg_1=16, var_5=0, var_79=400] [L109] EXPR (int)var_33_arg_0 >> var_33_arg_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33_arg_0=750, var_33_arg_1=16, var_5=0, var_79=400] [L109] SORT_4 var_33 = (int)var_33_arg_0 >> var_33_arg_1; [L110] EXPR var_33_arg_0 & msb_SORT_4 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=749, var_33_arg_0=750, var_33_arg_1=16, var_5=0, var_79=400] [L110] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=749, var_33_arg_0=750, var_33_arg_1=16, var_5=0, var_79=400] [L110] var_33 = (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 [L111] EXPR var_33 & mask_SORT_4 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=749, var_33_arg_0=750, var_33_arg_1=16, var_5=0, var_79=400] [L111] var_33 = var_33 & mask_SORT_4 [L112] SORT_4 var_34_arg_0 = var_27; [L113] SORT_4 var_34_arg_1 = var_33; [L114] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L115] SORT_1 var_35_arg_0 = ~state_25; VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=749, var_33_arg_0=750, var_33_arg_1=16, var_34=1, var_34_arg_0=749, var_34_arg_1=749, var_35_arg_0=255, var_5=0, var_79=400] [L116] EXPR var_35_arg_0 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=749, var_33_arg_0=750, var_33_arg_1=16, var_34=1, var_34_arg_0=749, var_34_arg_1=749, var_35_arg_0=255, var_5=0, var_79=400] [L116] var_35_arg_0 = var_35_arg_0 & mask_SORT_1 [L117] SORT_1 var_35_arg_1 = var_34; VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=749, var_33_arg_0=750, var_33_arg_1=16, var_34=1, var_34_arg_0=749, var_34_arg_1=749, var_35_arg_0=1, var_35_arg_1=1, var_5=0, var_79=400] [L118] EXPR var_35_arg_0 & var_35_arg_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=749, var_33_arg_0=750, var_33_arg_1=16, var_34=1, var_34_arg_0=749, var_34_arg_1=749, var_35_arg_0=1, var_35_arg_1=1, var_5=0, var_79=400] [L118] SORT_1 var_35 = var_35_arg_0 & var_35_arg_1; [L119] EXPR var_35 & mask_SORT_1 VAL [init_11_arg_1=0, init_14_arg_1=0, init_16_arg_1=0, init_18_arg_1=0, init_20_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_7_arg_1=0, init_9_arg_1=0, input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_2=31, mask_SORT_3=65535, mask_SORT_4=4294967295, msb_SORT_1=1, msb_SORT_2=16, msb_SORT_3=32768, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_12=0, var_27=749, var_28=1, var_29=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_31=65536, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_33=749, var_33_arg_0=750, var_33_arg_1=16, var_34=1, var_34_arg_0=749, var_34_arg_1=749, var_35=1, var_35_arg_0=1, var_35_arg_1=1, var_5=0, var_79=400] [L119] var_35 = var_35 & mask_SORT_1 [L120] SORT_1 bad_36_arg_0 = var_35; [L121] CALL __VERIFIER_assert(!(bad_36_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, 448 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28817 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28817 mSDsluCounter, 58360 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41250 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2242 IncrementalHoareTripleChecker+Invalid, 2273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 17110 mSDtfsCounter, 2242 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=547occurred in iteration=15, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 6379 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1212 NumberOfCodeBlocks, 1212 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1127 ConstructedInterpolants, 0 QuantifiedInterpolants, 3982 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 18:50:24,951 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...