/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.swap_three.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 19:55:17,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 19:55:17,845 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2023-12-16 19:55:17,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 19:55:17,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 19:55:17,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 19:55:17,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 19:55:17,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 19:55:17,876 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 19:55:17,876 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 19:55:17,877 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 19:55:17,877 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 19:55:17,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 19:55:17,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 19:55:17,878 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 19:55:17,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 19:55:17,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 19:55:17,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 19:55:17,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 19:55:17,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 19:55:17,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 19:55:17,881 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 19:55:17,881 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 19:55:17,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 19:55:17,882 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 19:55:17,882 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 19:55:17,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 19:55:17,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 19:55:17,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 19:55:17,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:55:17,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 19:55:17,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 19:55:17,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 19:55:17,885 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 19:55:17,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 19:55:17,885 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 19:55:17,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 19:55:17,885 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 19:55:17,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 19:55:17,885 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 19:55:17,885 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-16 19:55:18,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 19:55:18,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 19:55:18,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 19:55:18,161 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 19:55:18,161 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 19:55:18,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.swap_three.c [2023-12-16 19:55:19,337 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 19:55:19,515 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 19:55:19,516 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.swap_three.c [2023-12-16 19:55:19,523 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8cac8e87/fd5b59b350da444da0e4039f21412d3c/FLAG43814d5e6 [2023-12-16 19:55:19,537 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8cac8e87/fd5b59b350da444da0e4039f21412d3c [2023-12-16 19:55:19,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 19:55:19,541 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 19:55:19,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 19:55:19,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 19:55:19,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 19:55:19,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:55:19" (1/1) ... [2023-12-16 19:55:19,548 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54dd2f6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:19, skipping insertion in model container [2023-12-16 19:55:19,548 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:55:19" (1/1) ... [2023-12-16 19:55:19,572 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 19:55:19,728 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.swap_three.c[1250,1263] [2023-12-16 19:55:19,762 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:55:19,772 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 19:55:19,781 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.swap_three.c[1250,1263] [2023-12-16 19:55:19,806 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:55:19,825 INFO L206 MainTranslator]: Completed translation [2023-12-16 19:55:19,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:19 WrapperNode [2023-12-16 19:55:19,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 19:55:19,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 19:55:19,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 19:55:19,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 19:55:19,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:19" (1/1) ... [2023-12-16 19:55:19,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:19" (1/1) ... [2023-12-16 19:55:19,909 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 177 [2023-12-16 19:55:19,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 19:55:19,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 19:55:19,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 19:55:19,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 19:55:19,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:19" (1/1) ... [2023-12-16 19:55:19,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:19" (1/1) ... [2023-12-16 19:55:19,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:19" (1/1) ... [2023-12-16 19:55:19,946 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 19:55:19,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:19" (1/1) ... [2023-12-16 19:55:19,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:19" (1/1) ... [2023-12-16 19:55:19,953 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:19" (1/1) ... [2023-12-16 19:55:19,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:19" (1/1) ... [2023-12-16 19:55:19,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:19" (1/1) ... [2023-12-16 19:55:19,960 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:19" (1/1) ... [2023-12-16 19:55:19,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 19:55:19,964 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 19:55:19,964 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 19:55:19,964 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 19:55:19,964 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:19" (1/1) ... [2023-12-16 19:55:19,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:55:19,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:55:20,002 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 19:55:20,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 19:55:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 19:55:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 19:55:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 19:55:20,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 19:55:20,144 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 19:55:20,147 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 19:55:20,428 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 19:55:20,452 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 19:55:20,452 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 19:55:20,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:55:20 BoogieIcfgContainer [2023-12-16 19:55:20,453 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 19:55:20,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 19:55:20,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 19:55:20,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 19:55:20,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:55:19" (1/3) ... [2023-12-16 19:55:20,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539ccea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:55:20, skipping insertion in model container [2023-12-16 19:55:20,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:19" (2/3) ... [2023-12-16 19:55:20,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539ccea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:55:20, skipping insertion in model container [2023-12-16 19:55:20,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:55:20" (3/3) ... [2023-12-16 19:55:20,461 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.swap_three.c [2023-12-16 19:55:20,477 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 19:55:20,477 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 19:55:20,521 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 19:55:20,527 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;@643032cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 19:55:20,528 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 19:55:20,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 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 19:55:20,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 19:55:20,536 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:55:20,536 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] [2023-12-16 19:55:20,537 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:55:20,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:55:20,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1401949342, now seen corresponding path program 1 times [2023-12-16 19:55:20,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:55:20,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659379062] [2023-12-16 19:55:20,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:55:20,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:55:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:55:21,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:55:21,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:55:21,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659379062] [2023-12-16 19:55:21,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659379062] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:55:21,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:55:21,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:55:21,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910772625] [2023-12-16 19:55:21,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:55:21,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:55:21,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:55:21,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:55:21,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:55:21,140 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 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) Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:21,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:55:21,193 INFO L93 Difference]: Finished difference Result 66 states and 106 transitions. [2023-12-16 19:55:21,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:55:21,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-16 19:55:21,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:55:21,202 INFO L225 Difference]: With dead ends: 66 [2023-12-16 19:55:21,202 INFO L226 Difference]: Without dead ends: 38 [2023-12-16 19:55:21,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:55:21,211 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 1 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:55:21,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 154 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:55:21,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-16 19:55:21,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-16 19:55:21,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 37 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 19:55:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 58 transitions. [2023-12-16 19:55:21,241 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 58 transitions. Word has length 24 [2023-12-16 19:55:21,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:55:21,241 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 58 transitions. [2023-12-16 19:55:21,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:21,242 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 58 transitions. [2023-12-16 19:55:21,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-16 19:55:21,242 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:55:21,243 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] [2023-12-16 19:55:21,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 19:55:21,243 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:55:21,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:55:21,243 INFO L85 PathProgramCache]: Analyzing trace with hash 512541292, now seen corresponding path program 1 times [2023-12-16 19:55:21,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:55:21,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467653556] [2023-12-16 19:55:21,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:55:21,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:55:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:55:21,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:55:21,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:55:21,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467653556] [2023-12-16 19:55:21,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467653556] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:55:21,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:55:21,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:55:21,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745490450] [2023-12-16 19:55:21,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:55:21,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:55:21,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:55:21,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:55:21,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:55:21,445 INFO L87 Difference]: Start difference. First operand 38 states and 58 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:21,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:55:21,476 INFO L93 Difference]: Finished difference Result 69 states and 104 transitions. [2023-12-16 19:55:21,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:55:21,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2023-12-16 19:55:21,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:55:21,478 INFO L225 Difference]: With dead ends: 69 [2023-12-16 19:55:21,478 INFO L226 Difference]: Without dead ends: 41 [2023-12-16 19:55:21,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:55:21,480 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 1 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:55:21,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 152 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:55:21,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-16 19:55:21,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2023-12-16 19:55:21,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 39 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 19:55:21,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2023-12-16 19:55:21,492 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 60 transitions. Word has length 25 [2023-12-16 19:55:21,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:55:21,493 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 60 transitions. [2023-12-16 19:55:21,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 60 transitions. [2023-12-16 19:55:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 19:55:21,494 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:55:21,494 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] [2023-12-16 19:55:21,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 19:55:21,495 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:55:21,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:55:21,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1503308938, now seen corresponding path program 1 times [2023-12-16 19:55:21,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:55:21,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35688210] [2023-12-16 19:55:21,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:55:21,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:55:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:55:21,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:55:21,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:55:21,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35688210] [2023-12-16 19:55:21,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35688210] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:55:21,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:55:21,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:55:21,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858046487] [2023-12-16 19:55:21,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:55:21,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:55:21,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:55:21,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:55:21,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:55:21,790 INFO L87 Difference]: Start difference. First operand 40 states and 60 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:21,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:55:21,936 INFO L93 Difference]: Finished difference Result 100 states and 148 transitions. [2023-12-16 19:55:21,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 19:55:21,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2023-12-16 19:55:21,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:55:21,937 INFO L225 Difference]: With dead ends: 100 [2023-12-16 19:55:21,937 INFO L226 Difference]: Without dead ends: 70 [2023-12-16 19:55:21,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:55:21,938 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 127 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:55:21,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 77 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:55:21,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-16 19:55:21,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 43. [2023-12-16 19:55:21,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.5) internal successors, (63), 42 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 19:55:21,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2023-12-16 19:55:21,945 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 26 [2023-12-16 19:55:21,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:55:21,946 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 63 transitions. [2023-12-16 19:55:21,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:21,946 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2023-12-16 19:55:21,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-16 19:55:21,947 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:55:21,947 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] [2023-12-16 19:55:21,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 19:55:21,947 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:55:21,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:55:21,948 INFO L85 PathProgramCache]: Analyzing trace with hash -91478744, now seen corresponding path program 1 times [2023-12-16 19:55:21,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:55:21,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104885074] [2023-12-16 19:55:21,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:55:21,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:55:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:55:22,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:55:22,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:55:22,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104885074] [2023-12-16 19:55:22,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104885074] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:55:22,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:55:22,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:55:22,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483123636] [2023-12-16 19:55:22,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:55:22,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:55:22,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:55:22,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:55:22,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:55:22,069 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:22,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:55:22,150 INFO L93 Difference]: Finished difference Result 100 states and 146 transitions. [2023-12-16 19:55:22,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:55:22,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2023-12-16 19:55:22,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:55:22,151 INFO L225 Difference]: With dead ends: 100 [2023-12-16 19:55:22,151 INFO L226 Difference]: Without dead ends: 70 [2023-12-16 19:55:22,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-16 19:55:22,152 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 156 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:55:22,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 116 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:55:22,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-16 19:55:22,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 45. [2023-12-16 19:55:22,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 44 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 19:55:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2023-12-16 19:55:22,158 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 27 [2023-12-16 19:55:22,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:55:22,158 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. [2023-12-16 19:55:22,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:22,159 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2023-12-16 19:55:22,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 19:55:22,160 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:55:22,160 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] [2023-12-16 19:55:22,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 19:55:22,160 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:55:22,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:55:22,161 INFO L85 PathProgramCache]: Analyzing trace with hash 339293650, now seen corresponding path program 1 times [2023-12-16 19:55:22,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:55:22,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660010584] [2023-12-16 19:55:22,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:55:22,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:55:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:55:22,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:55:22,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:55:22,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660010584] [2023-12-16 19:55:22,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660010584] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:55:22,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:55:22,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:55:22,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165183339] [2023-12-16 19:55:22,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:55:22,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:55:22,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:55:22,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:55:22,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:55:22,314 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:22,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:55:22,404 INFO L93 Difference]: Finished difference Result 100 states and 145 transitions. [2023-12-16 19:55:22,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:55:22,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2023-12-16 19:55:22,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:55:22,407 INFO L225 Difference]: With dead ends: 100 [2023-12-16 19:55:22,407 INFO L226 Difference]: Without dead ends: 70 [2023-12-16 19:55:22,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-16 19:55:22,409 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 143 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:55:22,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 117 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:55:22,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-16 19:55:22,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 51. [2023-12-16 19:55:22,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.48) internal successors, (74), 50 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2023-12-16 19:55:22,422 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 28 [2023-12-16 19:55:22,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:55:22,422 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 74 transitions. [2023-12-16 19:55:22,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:22,422 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 74 transitions. [2023-12-16 19:55:22,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 19:55:22,423 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:55:22,423 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] [2023-12-16 19:55:22,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 19:55:22,424 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:55:22,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:55:22,424 INFO L85 PathProgramCache]: Analyzing trace with hash -494426468, now seen corresponding path program 1 times [2023-12-16 19:55:22,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:55:22,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069927712] [2023-12-16 19:55:22,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:55:22,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:55:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:55:22,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:55:22,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:55:22,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069927712] [2023-12-16 19:55:22,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069927712] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:55:22,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:55:22,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:55:22,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968598366] [2023-12-16 19:55:22,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:55:22,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:55:22,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:55:22,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:55:22,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:55:22,567 INFO L87 Difference]: Start difference. First operand 51 states and 74 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:22,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:55:22,687 INFO L93 Difference]: Finished difference Result 105 states and 151 transitions. [2023-12-16 19:55:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 19:55:22,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2023-12-16 19:55:22,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:55:22,688 INFO L225 Difference]: With dead ends: 105 [2023-12-16 19:55:22,689 INFO L226 Difference]: Without dead ends: 70 [2023-12-16 19:55:22,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:55:22,690 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 117 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:55:22,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 76 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:55:22,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-16 19:55:22,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 51. [2023-12-16 19:55:22,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.46) internal successors, (73), 50 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:22,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2023-12-16 19:55:22,709 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 29 [2023-12-16 19:55:22,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:55:22,710 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2023-12-16 19:55:22,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:22,710 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2023-12-16 19:55:22,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 19:55:22,710 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:55:22,711 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] [2023-12-16 19:55:22,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 19:55:22,711 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:55:22,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:55:22,711 INFO L85 PathProgramCache]: Analyzing trace with hash -2082774370, now seen corresponding path program 1 times [2023-12-16 19:55:22,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:55:22,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006671133] [2023-12-16 19:55:22,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:55:22,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:55:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:55:22,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:55:22,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:55:22,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006671133] [2023-12-16 19:55:22,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006671133] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:55:22,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:55:22,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:55:22,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855564719] [2023-12-16 19:55:22,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:55:22,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:55:22,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:55:22,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:55:22,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:55:22,889 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:22,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:55:22,994 INFO L93 Difference]: Finished difference Result 100 states and 143 transitions. [2023-12-16 19:55:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 19:55:22,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2023-12-16 19:55:22,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:55:22,996 INFO L225 Difference]: With dead ends: 100 [2023-12-16 19:55:22,996 INFO L226 Difference]: Without dead ends: 70 [2023-12-16 19:55:22,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:55:22,999 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 110 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:55:22,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 76 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:55:23,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-16 19:55:23,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2023-12-16 19:55:23,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 51 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2023-12-16 19:55:23,007 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 29 [2023-12-16 19:55:23,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:55:23,008 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2023-12-16 19:55:23,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:23,008 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2023-12-16 19:55:23,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 19:55:23,008 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:55:23,009 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] [2023-12-16 19:55:23,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 19:55:23,009 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:55:23,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:55:23,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1824608932, now seen corresponding path program 1 times [2023-12-16 19:55:23,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:55:23,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140718711] [2023-12-16 19:55:23,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:55:23,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:55:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:55:23,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:55:23,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:55:23,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140718711] [2023-12-16 19:55:23,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140718711] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:55:23,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:55:23,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:55:23,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452519832] [2023-12-16 19:55:23,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:55:23,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:55:23,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:55:23,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:55:23,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:55:23,244 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:23,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:55:23,329 INFO L93 Difference]: Finished difference Result 113 states and 163 transitions. [2023-12-16 19:55:23,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 19:55:23,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2023-12-16 19:55:23,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:55:23,330 INFO L225 Difference]: With dead ends: 113 [2023-12-16 19:55:23,330 INFO L226 Difference]: Without dead ends: 83 [2023-12-16 19:55:23,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-12-16 19:55:23,332 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 120 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:55:23,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 216 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:55:23,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-16 19:55:23,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 55. [2023-12-16 19:55:23,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:23,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2023-12-16 19:55:23,341 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 29 [2023-12-16 19:55:23,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:55:23,342 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2023-12-16 19:55:23,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:23,342 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2023-12-16 19:55:23,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 19:55:23,343 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:55:23,344 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] [2023-12-16 19:55:23,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 19:55:23,344 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:55:23,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:55:23,344 INFO L85 PathProgramCache]: Analyzing trace with hash -49601570, now seen corresponding path program 1 times [2023-12-16 19:55:23,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:55:23,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745476568] [2023-12-16 19:55:23,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:55:23,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:55:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:55:23,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:55:23,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:55:23,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745476568] [2023-12-16 19:55:23,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745476568] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:55:23,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:55:23,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:55:23,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848881503] [2023-12-16 19:55:23,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:55:23,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 19:55:23,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:55:23,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 19:55:23,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:55:23,662 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:23,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:55:23,740 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2023-12-16 19:55:23,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 19:55:23,741 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2023-12-16 19:55:23,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:55:23,741 INFO L225 Difference]: With dead ends: 93 [2023-12-16 19:55:23,741 INFO L226 Difference]: Without dead ends: 60 [2023-12-16 19:55:23,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-16 19:55:23,742 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 75 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:55:23,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 227 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:55:23,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-16 19:55:23,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2023-12-16 19:55:23,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:23,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 76 transitions. [2023-12-16 19:55:23,746 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 76 transitions. Word has length 29 [2023-12-16 19:55:23,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:55:23,747 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 76 transitions. [2023-12-16 19:55:23,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:23,747 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2023-12-16 19:55:23,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 19:55:23,748 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:55:23,748 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] [2023-12-16 19:55:23,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 19:55:23,748 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:55:23,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:55:23,749 INFO L85 PathProgramCache]: Analyzing trace with hash -49661152, now seen corresponding path program 1 times [2023-12-16 19:55:23,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:55:23,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106113554] [2023-12-16 19:55:23,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:55:23,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:55:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:55:23,771 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 19:55:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:55:23,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 19:55:23,807 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 19:55:23,808 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 19:55:23,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 19:55:23,813 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:55:23,816 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 19:55:23,843 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 19:55:23,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:55:23 BoogieIcfgContainer [2023-12-16 19:55:23,853 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 19:55:23,853 INFO L158 Benchmark]: Toolchain (without parser) took 4312.03ms. Allocated memory was 291.5MB in the beginning and 350.2MB in the end (delta: 58.7MB). Free memory was 241.2MB in the beginning and 284.5MB in the end (delta: -43.3MB). Peak memory consumption was 16.5MB. Max. memory is 8.0GB. [2023-12-16 19:55:23,853 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory is still 132.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 19:55:23,854 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.67ms. Allocated memory is still 291.5MB. Free memory was 241.2MB in the beginning and 228.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 19:55:23,854 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.56ms. Allocated memory is still 291.5MB. Free memory was 228.6MB in the beginning and 225.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 19:55:23,854 INFO L158 Benchmark]: Boogie Preprocessor took 52.08ms. Allocated memory is still 291.5MB. Free memory was 225.5MB in the beginning and 223.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 19:55:23,855 INFO L158 Benchmark]: RCFGBuilder took 489.43ms. Allocated memory is still 291.5MB. Free memory was 222.9MB in the beginning and 201.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-16 19:55:23,855 INFO L158 Benchmark]: TraceAbstraction took 3397.35ms. Allocated memory was 291.5MB in the beginning and 350.2MB in the end (delta: 58.7MB). Free memory was 201.4MB in the beginning and 284.5MB in the end (delta: -83.1MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 19:55:23,856 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.12ms. Allocated memory is still 179.3MB. Free memory is still 132.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 283.67ms. Allocated memory is still 291.5MB. Free memory was 241.2MB in the beginning and 228.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 83.56ms. Allocated memory is still 291.5MB. Free memory was 228.6MB in the beginning and 225.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.08ms. Allocated memory is still 291.5MB. Free memory was 225.5MB in the beginning and 223.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 489.43ms. Allocated memory is still 291.5MB. Free memory was 222.9MB in the beginning and 201.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 3397.35ms. Allocated memory was 291.5MB in the beginning and 350.2MB in the end (delta: 58.7MB). Free memory was 201.4MB in the beginning and 284.5MB in the end (delta: -83.1MB). 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 bitwiseAnd at line 90. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 20); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (20 - 1); [L32] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 32); [L33] const SORT_8 msb_SORT_8 = (SORT_8)1 << (32 - 1); [L35] const SORT_4 var_5 = 1; [L36] const SORT_8 var_10 = 1; [L37] const SORT_8 var_13 = 5; [L38] const SORT_8 var_17 = 7; [L39] const SORT_1 var_22 = 1; [L40] const SORT_4 var_26 = 5; [L41] const SORT_4 var_29 = 7; [L43] SORT_1 input_2; [L44] SORT_1 input_3; [L46] EXPR __VERIFIER_nondet_uint() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, var_10=1, var_13=5, var_17=7, var_22=1, var_26=5, var_29=7, var_5=1] [L46] SORT_4 state_6 = __VERIFIER_nondet_uint() & mask_SORT_4; [L47] EXPR __VERIFIER_nondet_uint() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_6=0, var_10=1, var_13=5, var_17=7, var_22=1, var_26=5, var_29=7, var_5=1] [L47] SORT_4 state_27 = __VERIFIER_nondet_uint() & mask_SORT_4; [L48] EXPR __VERIFIER_nondet_uint() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_27=0, state_6=0, var_10=1, var_13=5, var_17=7, var_22=1, var_26=5, var_29=7, var_5=1] [L48] SORT_4 state_30 = __VERIFIER_nondet_uint() & mask_SORT_4; [L50] SORT_4 init_7_arg_1 = var_5; [L51] state_6 = init_7_arg_1 [L52] SORT_4 init_28_arg_1 = var_26; [L53] state_27 = init_28_arg_1 [L54] SORT_4 init_31_arg_1 = var_29; [L55] state_30 = init_31_arg_1 VAL [init_28_arg_1=5, init_31_arg_1=7, init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_17=7, var_22=1, var_26=5, var_29=7, var_5=1] [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_9_arg_0 = state_6; VAL [init_28_arg_1=5, init_31_arg_1=7, init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_17=7, var_22=1, var_26=5, var_29=7, var_5=1, var_9_arg_0=1] [L63] EXPR var_9_arg_0 & mask_SORT_4 VAL [init_28_arg_1=5, init_31_arg_1=7, init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_17=7, var_22=1, var_26=5, var_29=7, var_5=1, var_9_arg_0=1] [L63] var_9_arg_0 = var_9_arg_0 & mask_SORT_4 [L64] SORT_8 var_9 = var_9_arg_0; [L65] SORT_8 var_11_arg_0 = var_9; [L66] SORT_8 var_11_arg_1 = var_10; [L67] SORT_1 var_11 = var_11_arg_0 == var_11_arg_1; [L68] SORT_4 var_12_arg_0 = state_6; VAL [init_28_arg_1=5, init_31_arg_1=7, init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_27=5, state_30=7, state_6=1, var_10=1, var_11=0, var_11_arg_0=0, var_11_arg_1=1, var_12_arg_0=1, var_13=5, var_17=7, var_22=1, var_26=5, var_29=7, var_5=1, var_9=0, var_9_arg_0=0] [L69] EXPR var_12_arg_0 & mask_SORT_4 VAL [init_28_arg_1=5, init_31_arg_1=7, init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_27=5, state_30=7, state_6=1, var_10=1, var_11=0, var_11_arg_0=0, var_11_arg_1=1, var_12_arg_0=1, var_13=5, var_17=7, var_22=1, var_26=5, var_29=7, var_5=1, var_9=0, var_9_arg_0=0] [L69] var_12_arg_0 = var_12_arg_0 & mask_SORT_4 [L70] SORT_8 var_12 = var_12_arg_0; [L71] SORT_8 var_14_arg_0 = var_12; [L72] SORT_8 var_14_arg_1 = var_13; [L73] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L74] SORT_1 var_15_arg_0 = var_11; [L75] SORT_1 var_15_arg_1 = var_14; VAL [init_28_arg_1=5, init_31_arg_1=7, init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_27=5, state_30=7, state_6=1, var_10=1, var_11=0, var_11_arg_0=0, var_11_arg_1=1, var_12=0, var_12_arg_0=0, var_13=5, var_14=0, var_14_arg_0=0, var_14_arg_1=5, var_15_arg_0=0, var_15_arg_1=0, var_17=7, var_22=1, var_26=5, var_29=7, var_5=1, var_9=0, var_9_arg_0=0] [L76] EXPR var_15_arg_0 | var_15_arg_1 VAL [init_28_arg_1=5, init_31_arg_1=7, init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_27=5, state_30=7, state_6=1, var_10=1, var_11=0, var_11_arg_0=0, var_11_arg_1=1, var_12=0, var_12_arg_0=0, var_13=5, var_14=0, var_14_arg_0=0, var_14_arg_1=5, var_15_arg_0=0, var_15_arg_1=0, var_17=7, var_22=1, var_26=5, var_29=7, var_5=1, var_9=0, var_9_arg_0=0] [L76] SORT_1 var_15 = var_15_arg_0 | var_15_arg_1; [L77] SORT_4 var_16_arg_0 = state_6; VAL [init_28_arg_1=5, init_31_arg_1=7, init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_27=5, state_30=7, state_6=1, var_10=1, var_11=0, var_11_arg_0=0, var_11_arg_1=1, var_12=0, var_12_arg_0=0, var_13=5, var_14=0, var_14_arg_0=0, var_14_arg_1=5, var_15=0, var_15_arg_0=0, var_15_arg_1=0, var_16_arg_0=1, var_17=7, var_22=1, var_26=5, var_29=7, var_5=1, var_9=0, var_9_arg_0=0] [L78] EXPR var_16_arg_0 & mask_SORT_4 VAL [init_28_arg_1=5, init_31_arg_1=7, init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_27=5, state_30=7, state_6=1, var_10=1, var_11=0, var_11_arg_0=0, var_11_arg_1=1, var_12=0, var_12_arg_0=0, var_13=5, var_14=0, var_14_arg_0=0, var_14_arg_1=5, var_15=0, var_15_arg_0=0, var_15_arg_1=0, var_16_arg_0=1, var_17=7, var_22=1, var_26=5, var_29=7, var_5=1, var_9=0, var_9_arg_0=0] [L78] var_16_arg_0 = var_16_arg_0 & mask_SORT_4 [L79] SORT_8 var_16 = var_16_arg_0; [L80] SORT_8 var_18_arg_0 = var_16; [L81] SORT_8 var_18_arg_1 = var_17; [L82] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L83] SORT_1 var_19_arg_0 = var_15; [L84] SORT_1 var_19_arg_1 = var_18; VAL [init_28_arg_1=5, init_31_arg_1=7, init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_27=5, state_30=7, state_6=1, var_10=1, var_11=0, var_11_arg_0=0, var_11_arg_1=1, var_12=0, var_12_arg_0=0, var_13=5, var_14=0, var_14_arg_0=0, var_14_arg_1=5, var_15=0, var_15_arg_0=0, var_15_arg_1=0, var_16=0, var_16_arg_0=0, var_17=7, var_18=0, var_18_arg_0=0, var_18_arg_1=7, var_19_arg_0=0, var_19_arg_1=0, var_22=1, var_26=5, var_29=7, var_5=1, var_9=0, var_9_arg_0=0] [L85] EXPR var_19_arg_0 | var_19_arg_1 VAL [init_28_arg_1=5, init_31_arg_1=7, init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_27=5, state_30=7, state_6=1, var_10=1, var_11=0, var_11_arg_0=0, var_11_arg_1=1, var_12=0, var_12_arg_0=0, var_13=5, var_14=0, var_14_arg_0=0, var_14_arg_1=5, var_15=0, var_15_arg_0=0, var_15_arg_1=0, var_16=0, var_16_arg_0=0, var_17=7, var_18=0, var_18_arg_0=0, var_18_arg_1=7, var_19_arg_0=0, var_19_arg_1=0, var_22=1, var_26=5, var_29=7, var_5=1, var_9=0, var_9_arg_0=0] [L85] SORT_1 var_19 = var_19_arg_0 | var_19_arg_1; [L86] SORT_1 var_23_arg_0 = var_19; [L87] SORT_1 var_23 = ~var_23_arg_0; [L88] SORT_1 var_24_arg_0 = var_22; [L89] SORT_1 var_24_arg_1 = var_23; VAL [init_28_arg_1=5, init_31_arg_1=7, init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_27=5, state_30=7, state_6=1, var_10=1, var_11=0, var_11_arg_0=0, var_11_arg_1=1, var_12=0, var_12_arg_0=0, var_13=5, var_14=0, var_14_arg_0=0, var_14_arg_1=5, var_15=0, var_15_arg_0=0, var_15_arg_1=0, var_16=0, var_16_arg_0=0, var_17=7, var_18=0, var_18_arg_0=0, var_18_arg_1=7, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_22=1, var_23=255, var_23_arg_0=0, var_24_arg_0=1, var_24_arg_1=255, var_26=5, var_29=7, var_5=1, var_9=0, var_9_arg_0=0] [L90] EXPR var_24_arg_0 & var_24_arg_1 VAL [init_28_arg_1=5, init_31_arg_1=7, init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_27=5, state_30=7, state_6=1, var_10=1, var_11=0, var_11_arg_0=0, var_11_arg_1=1, var_12=0, var_12_arg_0=0, var_13=5, var_14=0, var_14_arg_0=0, var_14_arg_1=5, var_15=0, var_15_arg_0=0, var_15_arg_1=0, var_16=0, var_16_arg_0=0, var_17=7, var_18=0, var_18_arg_0=0, var_18_arg_1=7, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_22=1, var_23=255, var_23_arg_0=0, var_24_arg_0=1, var_24_arg_1=255, var_26=5, var_29=7, var_5=1, var_9=0, var_9_arg_0=0] [L90] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L91] EXPR var_24 & mask_SORT_1 VAL [init_28_arg_1=5, init_31_arg_1=7, init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_27=5, state_30=7, state_6=1, var_10=1, var_11=0, var_11_arg_0=0, var_11_arg_1=1, var_12=0, var_12_arg_0=0, var_13=5, var_14=0, var_14_arg_0=0, var_14_arg_1=5, var_15=0, var_15_arg_0=0, var_15_arg_1=0, var_16=0, var_16_arg_0=0, var_17=7, var_18=0, var_18_arg_0=0, var_18_arg_1=7, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_22=1, var_23=255, var_23_arg_0=0, var_24=1, var_24_arg_0=1, var_24_arg_1=255, var_26=5, var_29=7, var_5=1, var_9=0, var_9_arg_0=0] [L91] var_24 = var_24 & mask_SORT_1 [L92] SORT_1 bad_25_arg_0 = var_24; [L93] CALL __VERIFIER_assert(!(bad_25_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, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 850 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 850 mSDsluCounter, 1211 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 814 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 471 IncrementalHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 397 mSDtfsCounter, 471 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=8, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 142 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 275 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 237 ConstructedInterpolants, 0 QuantifiedInterpolants, 937 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-16 19:55:23,873 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...