/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-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/bitvector/num_conversion_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 17:28:43,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 17:28:43,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 17:28:43,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 17:28:43,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 17:28:43,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 17:28:43,281 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 17:28:43,282 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 17:28:43,282 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 17:28:43,285 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 17:28:43,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 17:28:43,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 17:28:43,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 17:28:43,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 17:28:43,287 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 17:28:43,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 17:28:43,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 17:28:43,287 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 17:28:43,287 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 17:28:43,288 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 17:28:43,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 17:28:43,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 17:28:43,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 17:28:43,288 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 17:28:43,288 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 17:28:43,289 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 17:28:43,289 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 17:28:43,289 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 17:28:43,289 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 17:28:43,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 17:28:43,290 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 17:28:43,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 17:28:43,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 17:28:43,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 17:28:43,291 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 17:28:43,291 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 17:28:43,291 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 17:28:43,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 17:28:43,291 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 17:28:43,291 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 17:28:43,291 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 17:28:43,291 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 17:28:43,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 17:28:43,291 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-15 17:28:43,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 17:28:43,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 17:28:43,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 17:28:43,490 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 17:28:43,490 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 17:28:43,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/num_conversion_1.c [2023-12-15 17:28:44,570 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 17:28:44,703 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 17:28:44,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/num_conversion_1.c [2023-12-15 17:28:44,709 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4909dd2c/c1bf945469334297b25d02d850d32255/FLAG0e98f418d [2023-12-15 17:28:44,718 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4909dd2c/c1bf945469334297b25d02d850d32255 [2023-12-15 17:28:44,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 17:28:44,721 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 17:28:44,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 17:28:44,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 17:28:44,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 17:28:44,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:28:44" (1/1) ... [2023-12-15 17:28:44,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c94fc56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:28:44, skipping insertion in model container [2023-12-15 17:28:44,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:28:44" (1/1) ... [2023-12-15 17:28:44,740 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 17:28:44,853 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/num_conversion_1.c[673,686] [2023-12-15 17:28:44,865 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 17:28:44,877 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 17:28:44,884 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/num_conversion_1.c[673,686] [2023-12-15 17:28:44,890 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 17:28:44,903 INFO L206 MainTranslator]: Completed translation [2023-12-15 17:28:44,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:28:44 WrapperNode [2023-12-15 17:28:44,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 17:28:44,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 17:28:44,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 17:28:44,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 17:28:44,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:28:44" (1/1) ... [2023-12-15 17:28:44,913 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:28:44" (1/1) ... [2023-12-15 17:28:44,928 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2023-12-15 17:28:44,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 17:28:44,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 17:28:44,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 17:28:44,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 17:28:44,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:28:44" (1/1) ... [2023-12-15 17:28:44,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:28:44" (1/1) ... [2023-12-15 17:28:44,937 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:28:44" (1/1) ... [2023-12-15 17:28:44,945 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-15 17:28:44,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:28:44" (1/1) ... [2023-12-15 17:28:44,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:28:44" (1/1) ... [2023-12-15 17:28:44,948 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:28:44" (1/1) ... [2023-12-15 17:28:44,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:28:44" (1/1) ... [2023-12-15 17:28:44,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:28:44" (1/1) ... [2023-12-15 17:28:44,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:28:44" (1/1) ... [2023-12-15 17:28:44,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 17:28:44,957 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 17:28:44,957 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 17:28:44,957 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 17:28:44,958 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:28:44" (1/1) ... [2023-12-15 17:28:44,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 17:28:44,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:28:44,993 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-15 17:28:44,996 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-15 17:28:45,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 17:28:45,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 17:28:45,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 17:28:45,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 17:28:45,071 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 17:28:45,072 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 17:28:45,226 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 17:28:45,239 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 17:28:45,239 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 17:28:45,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:28:45 BoogieIcfgContainer [2023-12-15 17:28:45,240 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 17:28:45,241 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 17:28:45,241 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 17:28:45,244 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 17:28:45,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 05:28:44" (1/3) ... [2023-12-15 17:28:45,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b47fd1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 05:28:45, skipping insertion in model container [2023-12-15 17:28:45,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:28:44" (2/3) ... [2023-12-15 17:28:45,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b47fd1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 05:28:45, skipping insertion in model container [2023-12-15 17:28:45,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:28:45" (3/3) ... [2023-12-15 17:28:45,247 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2023-12-15 17:28:45,259 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 17:28:45,259 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 17:28:45,300 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 17:28:45,306 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;@698e55ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 17:28:45,307 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 17:28:45,310 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 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-15 17:28:45,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-15 17:28:45,316 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:28:45,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-15 17:28:45,318 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:28:45,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:28:45,323 INFO L85 PathProgramCache]: Analyzing trace with hash 82472508, now seen corresponding path program 1 times [2023-12-15 17:28:45,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:28:45,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447857640] [2023-12-15 17:28:45,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:28:45,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:28:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:28:45,440 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-15 17:28:45,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:28:45,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447857640] [2023-12-15 17:28:45,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447857640] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:28:45,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 17:28:45,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 17:28:45,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174249825] [2023-12-15 17:28:45,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:28:45,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 17:28:45,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:28:45,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 17:28:45,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 17:28:45,464 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-15 17:28:45,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:28:45,486 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2023-12-15 17:28:45,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 17:28:45,488 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2023-12-15 17:28:45,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:28:45,492 INFO L225 Difference]: With dead ends: 21 [2023-12-15 17:28:45,492 INFO L226 Difference]: Without dead ends: 13 [2023-12-15 17:28:45,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 17:28:45,496 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 17:28:45,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 17:28:45,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-15 17:28:45,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-12-15 17:28:45,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 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-15 17:28:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2023-12-15 17:28:45,516 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 5 [2023-12-15 17:28:45,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:28:45,516 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2023-12-15 17:28:45,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-15 17:28:45,516 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2023-12-15 17:28:45,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-15 17:28:45,516 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:28:45,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-15 17:28:45,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 17:28:45,517 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:28:45,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:28:45,517 INFO L85 PathProgramCache]: Analyzing trace with hash 81578778, now seen corresponding path program 1 times [2023-12-15 17:28:45,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:28:45,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058698388] [2023-12-15 17:28:45,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:28:45,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:28:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:28:45,567 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-15 17:28:45,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:28:45,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058698388] [2023-12-15 17:28:45,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058698388] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:28:45,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 17:28:45,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 17:28:45,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318524706] [2023-12-15 17:28:45,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:28:45,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 17:28:45,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:28:45,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 17:28:45,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 17:28:45,573 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-15 17:28:45,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:28:45,596 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2023-12-15 17:28:45,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 17:28:45,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2023-12-15 17:28:45,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:28:45,597 INFO L225 Difference]: With dead ends: 33 [2023-12-15 17:28:45,597 INFO L226 Difference]: Without dead ends: 21 [2023-12-15 17:28:45,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 17:28:45,599 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 17:28:45,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 24 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 17:28:45,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-15 17:28:45,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2023-12-15 17:28:45,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 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-15 17:28:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2023-12-15 17:28:45,604 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 5 [2023-12-15 17:28:45,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:28:45,604 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2023-12-15 17:28:45,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-15 17:28:45,605 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2023-12-15 17:28:45,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-15 17:28:45,605 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:28:45,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:28:45,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 17:28:45,605 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:28:45,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:28:45,606 INFO L85 PathProgramCache]: Analyzing trace with hash -964022906, now seen corresponding path program 1 times [2023-12-15 17:28:45,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:28:45,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606232293] [2023-12-15 17:28:45,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:28:45,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:28:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:28:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 17:28:45,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:28:45,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606232293] [2023-12-15 17:28:45,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606232293] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:28:45,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 17:28:45,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 17:28:45,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863973700] [2023-12-15 17:28:45,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:28:45,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 17:28:45,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:28:45,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 17:28:45,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 17:28:45,695 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-15 17:28:45,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:28:45,709 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2023-12-15 17:28:45,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 17:28:45,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-12-15 17:28:45,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:28:45,710 INFO L225 Difference]: With dead ends: 30 [2023-12-15 17:28:45,710 INFO L226 Difference]: Without dead ends: 18 [2023-12-15 17:28:45,710 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-15 17:28:45,711 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 17:28:45,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 37 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 17:28:45,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-15 17:28:45,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2023-12-15 17:28:45,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 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-15 17:28:45,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-12-15 17:28:45,714 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 12 [2023-12-15 17:28:45,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:28:45,714 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-12-15 17:28:45,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-15 17:28:45,714 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-12-15 17:28:45,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-15 17:28:45,715 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:28:45,715 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:28:45,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 17:28:45,715 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:28:45,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:28:45,716 INFO L85 PathProgramCache]: Analyzing trace with hash -906764604, now seen corresponding path program 1 times [2023-12-15 17:28:45,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:28:45,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010568564] [2023-12-15 17:28:45,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:28:45,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:28:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:28:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 17:28:45,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:28:45,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010568564] [2023-12-15 17:28:45,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010568564] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:28:45,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 17:28:45,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 17:28:45,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52030071] [2023-12-15 17:28:45,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:28:45,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 17:28:45,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:28:45,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 17:28:45,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 17:28:45,900 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-15 17:28:45,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:28:45,930 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2023-12-15 17:28:45,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 17:28:45,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-12-15 17:28:45,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:28:45,931 INFO L225 Difference]: With dead ends: 37 [2023-12-15 17:28:45,931 INFO L226 Difference]: Without dead ends: 23 [2023-12-15 17:28:45,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 17:28:45,932 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 25 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 17:28:45,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 24 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 17:28:45,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-15 17:28:45,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2023-12-15 17:28:45,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 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-15 17:28:45,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-12-15 17:28:45,936 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 12 [2023-12-15 17:28:45,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:28:45,936 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-12-15 17:28:45,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-15 17:28:45,936 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-12-15 17:28:45,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-15 17:28:45,937 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:28:45,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:28:45,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 17:28:45,937 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:28:45,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:28:45,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1082659288, now seen corresponding path program 1 times [2023-12-15 17:28:45,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:28:45,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016478594] [2023-12-15 17:28:45,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:28:45,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:28:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:28:45,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 17:28:45,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:28:45,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016478594] [2023-12-15 17:28:45,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016478594] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:28:45,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820258726] [2023-12-15 17:28:45,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:28:45,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:28:45,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:28:45,992 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 17:28:46,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 17:28:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:28:46,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-15 17:28:46,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:28:46,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 17:28:46,118 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 17:28:46,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820258726] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:28:46,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 17:28:46,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2023-12-15 17:28:46,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717906558] [2023-12-15 17:28:46,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:28:46,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 17:28:46,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:28:46,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 17:28:46,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-15 17:28:46,121 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-15 17:28:46,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:28:46,151 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2023-12-15 17:28:46,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 17:28:46,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2023-12-15 17:28:46,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:28:46,153 INFO L225 Difference]: With dead ends: 50 [2023-12-15 17:28:46,153 INFO L226 Difference]: Without dead ends: 33 [2023-12-15 17:28:46,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-15 17:28:46,158 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 17:28:46,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 40 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 17:28:46,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-15 17:28:46,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2023-12-15 17:28:46,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:28:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-12-15 17:28:46,170 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 13 [2023-12-15 17:28:46,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:28:46,170 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-12-15 17:28:46,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-15 17:28:46,171 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-12-15 17:28:46,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-15 17:28:46,171 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:28:46,171 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:28:46,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-15 17:28:46,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:28:46,379 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:28:46,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:28:46,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1526641204, now seen corresponding path program 1 times [2023-12-15 17:28:46,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:28:46,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433522250] [2023-12-15 17:28:46,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:28:46,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:28:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:28:46,474 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 17:28:46,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:28:46,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433522250] [2023-12-15 17:28:46,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433522250] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:28:46,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805284359] [2023-12-15 17:28:46,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:28:46,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:28:46,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:28:46,476 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 17:28:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:28:46,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 17:28:46,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-15 17:28:46,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:28:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 17:28:46,567 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 17:28:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 17:28:46,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805284359] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 17:28:46,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 17:28:46,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 15 [2023-12-15 17:28:46,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231089871] [2023-12-15 17:28:46,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 17:28:46,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-15 17:28:46,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:28:46,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-15 17:28:46,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2023-12-15 17:28:46,673 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 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-15 17:28:46,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:28:46,804 INFO L93 Difference]: Finished difference Result 92 states and 122 transitions. [2023-12-15 17:28:46,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 17:28:46,805 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 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 20 [2023-12-15 17:28:46,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:28:46,807 INFO L225 Difference]: With dead ends: 92 [2023-12-15 17:28:46,807 INFO L226 Difference]: Without dead ends: 70 [2023-12-15 17:28:46,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=208, Unknown=0, NotChecked=0, Total=342 [2023-12-15 17:28:46,812 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 127 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 17:28:46,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 129 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 17:28:46,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-15 17:28:46,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2023-12-15 17:28:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 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-15 17:28:46,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2023-12-15 17:28:46,826 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 20 [2023-12-15 17:28:46,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:28:46,826 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2023-12-15 17:28:46,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 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-15 17:28:46,827 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2023-12-15 17:28:46,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-15 17:28:46,828 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:28:46,828 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:28:46,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 17:28:47,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-15 17:28:47,034 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:28:47,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:28:47,034 INFO L85 PathProgramCache]: Analyzing trace with hash -991806156, now seen corresponding path program 2 times [2023-12-15 17:28:47,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:28:47,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508221421] [2023-12-15 17:28:47,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:28:47,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:28:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:28:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 17:28:47,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:28:47,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508221421] [2023-12-15 17:28:47,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508221421] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:28:47,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798845078] [2023-12-15 17:28:47,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 17:28:47,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:28:47,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:28:47,326 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 17:28:47,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-15 17:28:47,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-15 17:28:47,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 17:28:47,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-15 17:28:47,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:28:47,799 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 17:28:47,799 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 17:28:48,403 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 11 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 17:28:48,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798845078] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 17:28:48,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 17:28:48,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 16] total 33 [2023-12-15 17:28:48,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516877656] [2023-12-15 17:28:48,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 17:28:48,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-15 17:28:48,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:28:48,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-15 17:28:48,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=776, Unknown=0, NotChecked=0, Total=1056 [2023-12-15 17:28:48,406 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand has 33 states, 33 states have (on average 4.242424242424242) internal successors, (140), 33 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:28:55,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:28:55,300 INFO L93 Difference]: Finished difference Result 555 states and 750 transitions. [2023-12-15 17:28:55,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-12-15 17:28:55,300 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.242424242424242) internal successors, (140), 33 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2023-12-15 17:28:55,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:28:55,303 INFO L225 Difference]: With dead ends: 555 [2023-12-15 17:28:55,303 INFO L226 Difference]: Without dead ends: 492 [2023-12-15 17:28:55,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3056 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=2050, Invalid=5782, Unknown=0, NotChecked=0, Total=7832 [2023-12-15 17:28:55,306 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 476 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-15 17:28:55,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 276 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-15 17:28:55,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2023-12-15 17:28:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 335. [2023-12-15 17:28:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.3652694610778444) internal successors, (456), 334 states have internal predecessors, (456), 0 states have call successors, (0), 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-15 17:28:55,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 456 transitions. [2023-12-15 17:28:55,325 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 456 transitions. Word has length 48 [2023-12-15 17:28:55,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:28:55,325 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 456 transitions. [2023-12-15 17:28:55,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.242424242424242) internal successors, (140), 33 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:28:55,325 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 456 transitions. [2023-12-15 17:28:55,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-15 17:28:55,326 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:28:55,327 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:28:55,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 17:28:55,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:28:55,531 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:28:55,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:28:55,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1369346740, now seen corresponding path program 3 times [2023-12-15 17:28:55,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:28:55,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983890112] [2023-12-15 17:28:55,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:28:55,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:28:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 17:28:55,593 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 17:28:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 17:28:55,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 17:28:55,640 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 17:28:55,641 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 17:28:55,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 17:28:55,644 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-12-15 17:28:55,646 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 17:28:55,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 05:28:55 BoogieIcfgContainer [2023-12-15 17:28:55,685 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 17:28:55,685 INFO L158 Benchmark]: Toolchain (without parser) took 10964.01ms. Allocated memory was 360.7MB in the beginning and 433.1MB in the end (delta: 72.4MB). Free memory was 306.0MB in the beginning and 385.7MB in the end (delta: -79.7MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 17:28:55,685 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 204.5MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 17:28:55,685 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.30ms. Allocated memory is still 360.7MB. Free memory was 306.0MB in the beginning and 295.0MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-15 17:28:55,685 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.54ms. Allocated memory is still 360.7MB. Free memory was 295.0MB in the beginning and 293.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 17:28:55,686 INFO L158 Benchmark]: Boogie Preprocessor took 22.88ms. Allocated memory is still 360.7MB. Free memory was 293.4MB in the beginning and 291.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-15 17:28:55,686 INFO L158 Benchmark]: RCFGBuilder took 283.24ms. Allocated memory is still 360.7MB. Free memory was 291.3MB in the beginning and 278.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 17:28:55,686 INFO L158 Benchmark]: TraceAbstraction took 10443.33ms. Allocated memory was 360.7MB in the beginning and 433.1MB in the end (delta: 72.4MB). Free memory was 278.2MB in the beginning and 385.7MB in the end (delta: -107.5MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 17:28:55,687 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.09ms. Allocated memory is still 204.5MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 181.30ms. Allocated memory is still 360.7MB. Free memory was 306.0MB in the beginning and 295.0MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.54ms. Allocated memory is still 360.7MB. Free memory was 295.0MB in the beginning and 293.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.88ms. Allocated memory is still 360.7MB. Free memory was 293.4MB in the beginning and 291.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 283.24ms. Allocated memory is still 360.7MB. Free memory was 291.3MB in the beginning and 278.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 10443.33ms. Allocated memory was 360.7MB in the beginning and 433.1MB in the end (delta: 72.4MB). Free memory was 278.2MB in the beginning and 385.7MB in the end (delta: -107.5MB). 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: 16]: 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 shiftLeft at line 32, overapproximation of bitwiseAnd at line 33. Possible FailurePath: [L24] unsigned char x; [L25] unsigned char y; [L26] unsigned char c; [L28] x = 37 [L29] y = 0 [L30] c = 0 VAL [c=0, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 VAL [c=0, x=37, y=0] [L32] EXPR ((unsigned char)1) << c VAL [c=0, x=37, y=0] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=0, i=1, x=37, y=0] [L33] unsigned char bit = x & i; [L34] COND TRUE, EXPR bit != (unsigned char)0 [L35] EXPR y = y + i VAL [bit=1, c=0, i=1, x=37, y=1] [L37] EXPR c = c + ((unsigned char)1) [L31-L38] { unsigned char i = ((unsigned char)1) << c; unsigned char bit = x & i; if (bit != (unsigned char)0) { y = y + i; } c = c + ((unsigned char)1); } VAL [c=1, x=37, y=1] [L31] COND TRUE c < (unsigned char)8 VAL [c=1, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [c=1, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=1, i=0, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE, EXPR !(bit != (unsigned char)0) VAL [bit=0, c=1, i=0, x=37, y=1] [L37] EXPR c = c + ((unsigned char)1) [L31-L38] { unsigned char i = ((unsigned char)1) << c; unsigned char bit = x & i; if (bit != (unsigned char)0) { y = y + i; } c = c + ((unsigned char)1); } VAL [c=2, x=37, y=1] [L31] COND TRUE c < (unsigned char)8 VAL [c=2, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [c=2, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=2, i=0, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE, EXPR !(bit != (unsigned char)0) VAL [bit=0, c=2, i=0, x=37, y=1] [L37] EXPR c = c + ((unsigned char)1) [L31-L38] { unsigned char i = ((unsigned char)1) << c; unsigned char bit = x & i; if (bit != (unsigned char)0) { y = y + i; } c = c + ((unsigned char)1); } VAL [c=3, x=37, y=1] [L31] COND TRUE c < (unsigned char)8 VAL [c=3, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [c=3, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=3, i=0, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE, EXPR !(bit != (unsigned char)0) VAL [bit=0, c=3, i=0, x=37, y=1] [L37] EXPR c = c + ((unsigned char)1) [L31-L38] { unsigned char i = ((unsigned char)1) << c; unsigned char bit = x & i; if (bit != (unsigned char)0) { y = y + i; } c = c + ((unsigned char)1); } VAL [c=4, x=37, y=1] [L31] COND TRUE c < (unsigned char)8 VAL [c=4, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [c=4, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=4, i=0, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE, EXPR !(bit != (unsigned char)0) VAL [bit=0, c=4, i=0, x=37, y=1] [L37] EXPR c = c + ((unsigned char)1) [L31-L38] { unsigned char i = ((unsigned char)1) << c; unsigned char bit = x & i; if (bit != (unsigned char)0) { y = y + i; } c = c + ((unsigned char)1); } VAL [c=5, x=37, y=1] [L31] COND TRUE c < (unsigned char)8 VAL [c=5, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [c=5, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=5, i=0, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE, EXPR !(bit != (unsigned char)0) VAL [bit=0, c=5, i=0, x=37, y=1] [L37] EXPR c = c + ((unsigned char)1) [L31-L38] { unsigned char i = ((unsigned char)1) << c; unsigned char bit = x & i; if (bit != (unsigned char)0) { y = y + i; } c = c + ((unsigned char)1); } VAL [c=6, x=37, y=1] [L31] COND TRUE c < (unsigned char)8 VAL [c=6, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [c=6, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=6, i=0, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE, EXPR !(bit != (unsigned char)0) VAL [bit=0, c=6, i=0, x=37, y=1] [L37] EXPR c = c + ((unsigned char)1) [L31-L38] { unsigned char i = ((unsigned char)1) << c; unsigned char bit = x & i; if (bit != (unsigned char)0) { y = y + i; } c = c + ((unsigned char)1); } VAL [c=7, x=37, y=1] [L31] COND TRUE c < (unsigned char)8 VAL [c=7, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [c=7, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=7, i=0, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE, EXPR !(bit != (unsigned char)0) VAL [bit=0, c=7, i=0, x=37, y=1] [L37] EXPR c = c + ((unsigned char)1) [L31-L38] { unsigned char i = ((unsigned char)1) << c; unsigned char bit = x & i; if (bit != (unsigned char)0) { y = y + i; } c = c + ((unsigned char)1); } VAL [c=8, x=37, y=1] [L31] COND FALSE !(c < (unsigned char)8) VAL [c=8, x=37, y=1] [L39] CALL __VERIFIER_assert(x == y) [L15] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 8, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 651 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 651 mSDsluCounter, 547 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 430 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 887 IncrementalHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 117 mSDtfsCounter, 887 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3149 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=7, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 181 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 2340 SizeOfPredicates, 3 NumberOfNonLiveVariables, 252 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 20/364 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-15 17:28:55,709 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...