/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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 11:38:44,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 11:38:44,886 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-19 11:38:44,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 11:38:44,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 11:38:44,916 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 11:38:44,917 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 11:38:44,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 11:38:44,918 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 11:38:44,921 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 11:38:44,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 11:38:44,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 11:38:44,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 11:38:44,923 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 11:38:44,923 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 11:38:44,923 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 11:38:44,923 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 11:38:44,923 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 11:38:44,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 11:38:44,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 11:38:44,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 11:38:44,925 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 11:38:44,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 11:38:44,925 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 11:38:44,925 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 11:38:44,925 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 11:38:44,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 11:38:44,926 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 11:38:44,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 11:38:44,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 11:38:44,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 11:38:44,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 11:38:44,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 11:38:44,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 11:38:44,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 11:38:44,928 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 11:38:44,928 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 11:38:44,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 11:38:44,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 11:38:44,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 11:38:44,928 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 11:38:44,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 11:38:44,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 11:38:44,929 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-19 11:38:45,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 11:38:45,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 11:38:45,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 11:38:45,151 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 11:38:45,151 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 11:38:45,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i [2023-12-19 11:38:46,218 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 11:38:46,390 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 11:38:46,390 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i [2023-12-19 11:38:46,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afaf89b6c/f93193e9b2a24870a2463ce1bbe632a6/FLAG4bf2595e3 [2023-12-19 11:38:46,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afaf89b6c/f93193e9b2a24870a2463ce1bbe632a6 [2023-12-19 11:38:46,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 11:38:46,413 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 11:38:46,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 11:38:46,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 11:38:46,418 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 11:38:46,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 11:38:46" (1/1) ... [2023-12-19 11:38:46,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f9c9ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:38:46, skipping insertion in model container [2023-12-19 11:38:46,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 11:38:46" (1/1) ... [2023-12-19 11:38:46,446 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 11:38:46,544 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i[915,928] [2023-12-19 11:38:46,584 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 11:38:46,596 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 11:38:46,604 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i[915,928] [2023-12-19 11:38:46,618 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 11:38:46,644 INFO L206 MainTranslator]: Completed translation [2023-12-19 11:38:46,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:38:46 WrapperNode [2023-12-19 11:38:46,646 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 11:38:46,647 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 11:38:46,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 11:38:46,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 11:38:46,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:38:46" (1/1) ... [2023-12-19 11:38:46,659 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:38:46" (1/1) ... [2023-12-19 11:38:46,680 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2023-12-19 11:38:46,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 11:38:46,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 11:38:46,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 11:38:46,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 11:38:46,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:38:46" (1/1) ... [2023-12-19 11:38:46,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:38:46" (1/1) ... [2023-12-19 11:38:46,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:38:46" (1/1) ... [2023-12-19 11:38:46,714 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-19 11:38:46,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:38:46" (1/1) ... [2023-12-19 11:38:46,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:38:46" (1/1) ... [2023-12-19 11:38:46,718 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:38:46" (1/1) ... [2023-12-19 11:38:46,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:38:46" (1/1) ... [2023-12-19 11:38:46,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:38:46" (1/1) ... [2023-12-19 11:38:46,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:38:46" (1/1) ... [2023-12-19 11:38:46,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 11:38:46,734 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 11:38:46,735 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 11:38:46,735 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 11:38:46,735 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:38:46" (1/1) ... [2023-12-19 11:38:46,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 11:38:46,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 11:38:46,794 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-19 11:38:46,814 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-19 11:38:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 11:38:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 11:38:46,821 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 11:38:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 11:38:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 11:38:46,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 11:38:46,880 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 11:38:46,882 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 11:38:47,073 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 11:38:47,093 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 11:38:47,093 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 11:38:47,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 11:38:47 BoogieIcfgContainer [2023-12-19 11:38:47,094 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 11:38:47,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 11:38:47,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 11:38:47,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 11:38:47,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 11:38:46" (1/3) ... [2023-12-19 11:38:47,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b2e4c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 11:38:47, skipping insertion in model container [2023-12-19 11:38:47,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:38:46" (2/3) ... [2023-12-19 11:38:47,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b2e4c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 11:38:47, skipping insertion in model container [2023-12-19 11:38:47,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 11:38:47" (3/3) ... [2023-12-19 11:38:47,099 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-22.i [2023-12-19 11:38:47,111 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 11:38:47,111 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 11:38:47,144 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 11:38:47,149 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;@36cf2411, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 11:38:47,149 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 11:38:47,152 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 31 states have internal predecessors, (46), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-19 11:38:47,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-19 11:38:47,159 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:38:47,159 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:38:47,160 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:38:47,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:38:47,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1708927778, now seen corresponding path program 1 times [2023-12-19 11:38:47,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:38:47,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193155705] [2023-12-19 11:38:47,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:38:47,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:38:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:47,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:38:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:47,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:38:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:47,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:38:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:47,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:38:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:47,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:38:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:47,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:38:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:47,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 11:38:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:47,352 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-19 11:38:47,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:38:47,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193155705] [2023-12-19 11:38:47,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193155705] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:38:47,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:38:47,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 11:38:47,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148473967] [2023-12-19 11:38:47,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:38:47,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 11:38:47,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:38:47,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 11:38:47,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 11:38:47,377 INFO L87 Difference]: Start difference. First operand has 40 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 31 states have internal predecessors, (46), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-19 11:38:47,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:38:47,415 INFO L93 Difference]: Finished difference Result 79 states and 126 transitions. [2023-12-19 11:38:47,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 11:38:47,421 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2023-12-19 11:38:47,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:38:47,425 INFO L225 Difference]: With dead ends: 79 [2023-12-19 11:38:47,425 INFO L226 Difference]: Without dead ends: 38 [2023-12-19 11:38:47,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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-19 11:38:47,430 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 11:38:47,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:38:47,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-19 11:38:47,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-19 11:38:47,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-19 11:38:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2023-12-19 11:38:47,456 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 54 [2023-12-19 11:38:47,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:38:47,457 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2023-12-19 11:38:47,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-19 11:38:47,457 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2023-12-19 11:38:47,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-19 11:38:47,458 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:38:47,459 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:38:47,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 11:38:47,459 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:38:47,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:38:47,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1072522266, now seen corresponding path program 1 times [2023-12-19 11:38:47,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:38:47,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215851273] [2023-12-19 11:38:47,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:38:47,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:38:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:48,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:38:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:48,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:38:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:48,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:38:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:48,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:38:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:48,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:38:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:48,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:38:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:48,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 11:38:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-19 11:38:48,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:38:48,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215851273] [2023-12-19 11:38:48,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215851273] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:38:48,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:38:48,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 11:38:48,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901461614] [2023-12-19 11:38:48,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:38:48,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 11:38:48,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:38:48,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 11:38:48,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-19 11:38:48,142 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 11:38:48,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:38:48,311 INFO L93 Difference]: Finished difference Result 132 states and 180 transitions. [2023-12-19 11:38:48,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 11:38:48,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 54 [2023-12-19 11:38:48,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:38:48,316 INFO L225 Difference]: With dead ends: 132 [2023-12-19 11:38:48,316 INFO L226 Difference]: Without dead ends: 95 [2023-12-19 11:38:48,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-19 11:38:48,318 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 84 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 11:38:48,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 157 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 11:38:48,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-19 11:38:48,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 67. [2023-12-19 11:38:48,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-19 11:38:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 92 transitions. [2023-12-19 11:38:48,337 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 92 transitions. Word has length 54 [2023-12-19 11:38:48,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:38:48,337 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 92 transitions. [2023-12-19 11:38:48,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 11:38:48,338 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2023-12-19 11:38:48,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-19 11:38:48,338 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:38:48,339 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:38:48,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 11:38:48,339 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:38:48,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:38:48,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1201644873, now seen corresponding path program 1 times [2023-12-19 11:38:48,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:38:48,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850763020] [2023-12-19 11:38:48,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:38:48,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:38:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:48,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:38:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:48,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:38:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:48,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:38:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:48,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:38:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:48,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:38:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:48,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:38:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:48,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 11:38:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:48,628 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-19 11:38:48,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:38:48,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850763020] [2023-12-19 11:38:48,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850763020] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:38:48,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:38:48,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 11:38:48,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142121001] [2023-12-19 11:38:48,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:38:48,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 11:38:48,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:38:48,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 11:38:48,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-19 11:38:48,633 INFO L87 Difference]: Start difference. First operand 67 states and 92 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 11:38:48,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:38:48,824 INFO L93 Difference]: Finished difference Result 200 states and 269 transitions. [2023-12-19 11:38:48,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 11:38:48,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2023-12-19 11:38:48,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:38:48,828 INFO L225 Difference]: With dead ends: 200 [2023-12-19 11:38:48,828 INFO L226 Difference]: Without dead ends: 163 [2023-12-19 11:38:48,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-19 11:38:48,832 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 83 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 11:38:48,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 184 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 11:38:48,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-12-19 11:38:48,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 110. [2023-12-19 11:38:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-19 11:38:48,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 152 transitions. [2023-12-19 11:38:48,853 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 152 transitions. Word has length 55 [2023-12-19 11:38:48,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:38:48,855 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 152 transitions. [2023-12-19 11:38:48,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 11:38:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 152 transitions. [2023-12-19 11:38:48,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-19 11:38:48,861 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:38:48,862 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:38:48,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 11:38:48,862 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:38:48,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:38:48,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1459810311, now seen corresponding path program 1 times [2023-12-19 11:38:48,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:38:48,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603488683] [2023-12-19 11:38:48,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:38:48,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:38:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:48,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:38:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:48,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:38:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:48,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:38:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:48,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:38:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:48,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:38:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:48,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:38:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:48,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 11:38:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:48,927 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-19 11:38:48,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:38:48,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603488683] [2023-12-19 11:38:48,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603488683] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:38:48,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:38:48,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 11:38:48,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784583856] [2023-12-19 11:38:48,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:38:48,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 11:38:48,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:38:48,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 11:38:48,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 11:38:48,929 INFO L87 Difference]: Start difference. First operand 110 states and 152 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 11:38:48,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:38:48,954 INFO L93 Difference]: Finished difference Result 175 states and 239 transitions. [2023-12-19 11:38:48,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 11:38:48,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2023-12-19 11:38:48,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:38:48,955 INFO L225 Difference]: With dead ends: 175 [2023-12-19 11:38:48,955 INFO L226 Difference]: Without dead ends: 138 [2023-12-19 11:38:48,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-19 11:38:48,962 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 21 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 11:38:48,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 102 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:38:48,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-12-19 11:38:48,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 114. [2023-12-19 11:38:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 89 states have internal predecessors, (114), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-19 11:38:48,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 156 transitions. [2023-12-19 11:38:48,986 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 156 transitions. Word has length 55 [2023-12-19 11:38:48,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:38:48,987 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 156 transitions. [2023-12-19 11:38:48,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 11:38:48,987 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 156 transitions. [2023-12-19 11:38:48,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-19 11:38:48,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:38:48,987 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:38:48,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 11:38:48,988 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:38:48,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:38:48,988 INFO L85 PathProgramCache]: Analyzing trace with hash -882947203, now seen corresponding path program 1 times [2023-12-19 11:38:48,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:38:48,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638914691] [2023-12-19 11:38:48,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:38:48,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:38:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:49,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:38:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:49,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:38:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:49,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:38:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:49,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:38:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:49,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:38:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:49,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:38:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:49,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 11:38:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:49,125 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-19 11:38:49,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:38:49,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638914691] [2023-12-19 11:38:49,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638914691] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:38:49,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:38:49,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 11:38:49,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627710954] [2023-12-19 11:38:49,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:38:49,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 11:38:49,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:38:49,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 11:38:49,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 11:38:49,127 INFO L87 Difference]: Start difference. First operand 114 states and 156 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 11:38:49,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:38:49,205 INFO L93 Difference]: Finished difference Result 262 states and 356 transitions. [2023-12-19 11:38:49,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 11:38:49,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2023-12-19 11:38:49,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:38:49,207 INFO L225 Difference]: With dead ends: 262 [2023-12-19 11:38:49,207 INFO L226 Difference]: Without dead ends: 167 [2023-12-19 11:38:49,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-19 11:38:49,209 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 50 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 11:38:49,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 131 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 11:38:49,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-12-19 11:38:49,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 114. [2023-12-19 11:38:49,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.2696629213483146) internal successors, (113), 89 states have internal predecessors, (113), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-19 11:38:49,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2023-12-19 11:38:49,228 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 55 [2023-12-19 11:38:49,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:38:49,228 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2023-12-19 11:38:49,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 11:38:49,229 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2023-12-19 11:38:49,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-19 11:38:49,229 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:38:49,230 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:38:49,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 11:38:49,230 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:38:49,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:38:49,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1175113682, now seen corresponding path program 1 times [2023-12-19 11:38:49,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:38:49,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936438287] [2023-12-19 11:38:49,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:38:49,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:38:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:49,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:38:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:49,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:38:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:49,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:38:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:49,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:38:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:49,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:38:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:49,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:38:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:49,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 11:38:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:49,942 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-19 11:38:49,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:38:49,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936438287] [2023-12-19 11:38:49,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936438287] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:38:49,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:38:49,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 11:38:49,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659269787] [2023-12-19 11:38:49,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:38:49,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 11:38:49,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:38:49,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 11:38:49,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 11:38:49,944 INFO L87 Difference]: Start difference. First operand 114 states and 155 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 11:38:50,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:38:50,249 INFO L93 Difference]: Finished difference Result 321 states and 432 transitions. [2023-12-19 11:38:50,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-19 11:38:50,250 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 56 [2023-12-19 11:38:50,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:38:50,251 INFO L225 Difference]: With dead ends: 321 [2023-12-19 11:38:50,251 INFO L226 Difference]: Without dead ends: 226 [2023-12-19 11:38:50,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2023-12-19 11:38:50,252 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 253 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 11:38:50,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 253 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 11:38:50,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-12-19 11:38:50,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 105. [2023-12-19 11:38:50,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.2375) internal successors, (99), 80 states have internal predecessors, (99), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-19 11:38:50,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 141 transitions. [2023-12-19 11:38:50,263 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 141 transitions. Word has length 56 [2023-12-19 11:38:50,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:38:50,264 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 141 transitions. [2023-12-19 11:38:50,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 11:38:50,264 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 141 transitions. [2023-12-19 11:38:50,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-19 11:38:50,264 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:38:50,264 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:38:50,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 11:38:50,264 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:38:50,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:38:50,265 INFO L85 PathProgramCache]: Analyzing trace with hash -344607468, now seen corresponding path program 1 times [2023-12-19 11:38:50,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:38:50,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618062028] [2023-12-19 11:38:50,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:38:50,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:38:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:50,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:38:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:50,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:38:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:50,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:38:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:50,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:38:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:50,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:38:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:50,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:38:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:50,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 11:38:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:50,295 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-19 11:38:50,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:38:50,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618062028] [2023-12-19 11:38:50,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618062028] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:38:50,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:38:50,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 11:38:50,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341582092] [2023-12-19 11:38:50,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:38:50,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 11:38:50,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:38:50,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 11:38:50,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 11:38:50,297 INFO L87 Difference]: Start difference. First operand 105 states and 141 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 11:38:50,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:38:50,323 INFO L93 Difference]: Finished difference Result 183 states and 245 transitions. [2023-12-19 11:38:50,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 11:38:50,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 56 [2023-12-19 11:38:50,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:38:50,324 INFO L225 Difference]: With dead ends: 183 [2023-12-19 11:38:50,324 INFO L226 Difference]: Without dead ends: 97 [2023-12-19 11:38:50,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-19 11:38:50,325 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 9 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 11:38:50,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 67 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:38:50,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-19 11:38:50,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2023-12-19 11:38:50,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 67 states have internal predecessors, (79), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-19 11:38:50,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. [2023-12-19 11:38:50,334 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 121 transitions. Word has length 56 [2023-12-19 11:38:50,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:38:50,334 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 121 transitions. [2023-12-19 11:38:50,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 11:38:50,334 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2023-12-19 11:38:50,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-19 11:38:50,335 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:38:50,335 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:38:50,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 11:38:50,335 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:38:50,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:38:50,335 INFO L85 PathProgramCache]: Analyzing trace with hash 48419542, now seen corresponding path program 1 times [2023-12-19 11:38:50,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:38:50,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847864054] [2023-12-19 11:38:50,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:38:50,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:38:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:50,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:38:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:50,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:38:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:50,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:38:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:50,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:38:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:50,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:38:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:50,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:38:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:50,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 11:38:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:50,370 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-19 11:38:50,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:38:50,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847864054] [2023-12-19 11:38:50,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847864054] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:38:50,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:38:50,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 11:38:50,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188375194] [2023-12-19 11:38:50,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:38:50,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 11:38:50,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:38:50,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 11:38:50,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 11:38:50,372 INFO L87 Difference]: Start difference. First operand 92 states and 121 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 11:38:50,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:38:50,407 INFO L93 Difference]: Finished difference Result 169 states and 224 transitions. [2023-12-19 11:38:50,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 11:38:50,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 56 [2023-12-19 11:38:50,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:38:50,408 INFO L225 Difference]: With dead ends: 169 [2023-12-19 11:38:50,409 INFO L226 Difference]: Without dead ends: 130 [2023-12-19 11:38:50,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-19 11:38:50,409 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 26 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 11:38:50,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 81 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:38:50,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-12-19 11:38:50,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2023-12-19 11:38:50,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 95 states have (on average 1.1894736842105262) internal successors, (113), 95 states have internal predecessors, (113), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-19 11:38:50,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 169 transitions. [2023-12-19 11:38:50,419 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 169 transitions. Word has length 56 [2023-12-19 11:38:50,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:38:50,420 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 169 transitions. [2023-12-19 11:38:50,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 11:38:50,420 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 169 transitions. [2023-12-19 11:38:50,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-19 11:38:50,420 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:38:50,420 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:38:50,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 11:38:50,420 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:38:50,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:38:50,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1729606721, now seen corresponding path program 1 times [2023-12-19 11:38:50,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:38:50,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113097071] [2023-12-19 11:38:50,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:38:50,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:38:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:50,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:38:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:50,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:38:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:50,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:38:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:50,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:38:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:50,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:38:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:50,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:38:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:50,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 11:38:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:50,737 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-19 11:38:50,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:38:50,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113097071] [2023-12-19 11:38:50,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113097071] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:38:50,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:38:50,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 11:38:50,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200030391] [2023-12-19 11:38:50,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:38:50,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 11:38:50,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:38:50,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 11:38:50,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-19 11:38:50,739 INFO L87 Difference]: Start difference. First operand 128 states and 169 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 11:38:50,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:38:50,863 INFO L93 Difference]: Finished difference Result 237 states and 311 transitions. [2023-12-19 11:38:50,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 11:38:50,864 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 57 [2023-12-19 11:38:50,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:38:50,865 INFO L225 Difference]: With dead ends: 237 [2023-12-19 11:38:50,865 INFO L226 Difference]: Without dead ends: 163 [2023-12-19 11:38:50,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-19 11:38:50,866 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 56 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 11:38:50,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 213 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 11:38:50,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-12-19 11:38:50,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 138. [2023-12-19 11:38:50,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 105 states have (on average 1.1904761904761905) internal successors, (125), 105 states have internal predecessors, (125), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-19 11:38:50,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 181 transitions. [2023-12-19 11:38:50,880 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 181 transitions. Word has length 57 [2023-12-19 11:38:50,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:38:50,880 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 181 transitions. [2023-12-19 11:38:50,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 11:38:50,881 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 181 transitions. [2023-12-19 11:38:50,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-19 11:38:50,881 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:38:50,881 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:38:50,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 11:38:50,881 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:38:50,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:38:50,882 INFO L85 PathProgramCache]: Analyzing trace with hash -803362353, now seen corresponding path program 1 times [2023-12-19 11:38:50,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:38:50,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088496621] [2023-12-19 11:38:50,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:38:50,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:38:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:51,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:38:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:51,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:38:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:51,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:38:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:51,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:38:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:51,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:38:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:51,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:38:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:51,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 11:38:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:51,530 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-19 11:38:51,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:38:51,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088496621] [2023-12-19 11:38:51,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088496621] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:38:51,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:38:51,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 11:38:51,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22540863] [2023-12-19 11:38:51,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:38:51,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 11:38:51,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:38:51,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 11:38:51,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-12-19 11:38:51,532 INFO L87 Difference]: Start difference. First operand 138 states and 181 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 11:38:52,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:38:52,274 INFO L93 Difference]: Finished difference Result 220 states and 282 transitions. [2023-12-19 11:38:52,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-19 11:38:52,274 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2023-12-19 11:38:52,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:38:52,275 INFO L225 Difference]: With dead ends: 220 [2023-12-19 11:38:52,275 INFO L226 Difference]: Without dead ends: 218 [2023-12-19 11:38:52,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2023-12-19 11:38:52,276 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 206 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 11:38:52,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 354 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 11:38:52,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-12-19 11:38:52,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 153. [2023-12-19 11:38:52,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 120 states have (on average 1.1833333333333333) internal successors, (142), 120 states have internal predecessors, (142), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-19 11:38:52,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 198 transitions. [2023-12-19 11:38:52,290 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 198 transitions. Word has length 59 [2023-12-19 11:38:52,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:38:52,290 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 198 transitions. [2023-12-19 11:38:52,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 11:38:52,290 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 198 transitions. [2023-12-19 11:38:52,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-19 11:38:52,291 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:38:52,291 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:38:52,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 11:38:52,291 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:38:52,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:38:52,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1278916388, now seen corresponding path program 1 times [2023-12-19 11:38:52,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:38:52,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943909373] [2023-12-19 11:38:52,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:38:52,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:38:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:52,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:38:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:52,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:38:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:52,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:38:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:52,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:38:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:52,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:38:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:52,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:38:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:52,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 11:38:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:52,582 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-19 11:38:52,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:38:52,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943909373] [2023-12-19 11:38:52,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943909373] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:38:52,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:38:52,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 11:38:52,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155274742] [2023-12-19 11:38:52,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:38:52,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 11:38:52,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:38:52,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 11:38:52,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-19 11:38:52,584 INFO L87 Difference]: Start difference. First operand 153 states and 198 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 11:38:52,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:38:52,766 INFO L93 Difference]: Finished difference Result 162 states and 207 transitions. [2023-12-19 11:38:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 11:38:52,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2023-12-19 11:38:52,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:38:52,767 INFO L225 Difference]: With dead ends: 162 [2023-12-19 11:38:52,767 INFO L226 Difference]: Without dead ends: 160 [2023-12-19 11:38:52,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 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-19 11:38:52,768 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 45 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 11:38:52,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 300 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 11:38:52,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-12-19 11:38:52,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 153. [2023-12-19 11:38:52,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 120 states have (on average 1.175) internal successors, (141), 120 states have internal predecessors, (141), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-19 11:38:52,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 197 transitions. [2023-12-19 11:38:52,779 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 197 transitions. Word has length 60 [2023-12-19 11:38:52,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:38:52,779 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 197 transitions. [2023-12-19 11:38:52,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 11:38:52,779 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 197 transitions. [2023-12-19 11:38:52,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-19 11:38:52,780 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:38:52,780 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 11:38:52,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 11:38:52,780 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:38:52,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:38:52,781 INFO L85 PathProgramCache]: Analyzing trace with hash 350790167, now seen corresponding path program 1 times [2023-12-19 11:38:52,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:38:52,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238444062] [2023-12-19 11:38:52,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:38:52,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:38:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:52,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:38:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:52,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:38:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:52,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:38:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:52,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:38:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:52,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:38:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:52,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 11:38:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:52,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 11:38:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:52,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-19 11:38:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:52,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 11:38:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:52,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 11:38:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:52,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 11:38:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:52,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 11:38:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:52,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-19 11:38:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:52,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-19 11:38:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:38:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 11:38:52,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:38:52,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238444062] [2023-12-19 11:38:52,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238444062] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:38:52,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:38:52,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 11:38:52,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625395494] [2023-12-19 11:38:52,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:38:52,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 11:38:52,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:38:52,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 11:38:52,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-19 11:38:52,873 INFO L87 Difference]: Start difference. First operand 153 states and 197 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-19 11:38:52,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:38:52,891 INFO L93 Difference]: Finished difference Result 186 states and 232 transitions. [2023-12-19 11:38:52,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 11:38:52,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2023-12-19 11:38:52,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:38:52,891 INFO L225 Difference]: With dead ends: 186 [2023-12-19 11:38:52,891 INFO L226 Difference]: Without dead ends: 0 [2023-12-19 11:38:52,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-19 11:38:52,892 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 11:38:52,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 85 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:38:52,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-19 11:38:52,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-19 11:38:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-19 11:38:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-19 11:38:52,893 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2023-12-19 11:38:52,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:38:52,893 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-19 11:38:52,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-19 11:38:52,893 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-19 11:38:52,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-19 11:38:52,895 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 11:38:52,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 11:38:52,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-19 11:38:53,230 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2023-12-19 11:38:53,230 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-19 11:38:53,231 INFO L899 garLoopResultBuilder]: For program point L52-2(line 52) no Hoare annotation was computed. [2023-12-19 11:38:53,231 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-19 11:38:53,231 INFO L899 garLoopResultBuilder]: For program point L52-4(lines 52 56) no Hoare annotation was computed. [2023-12-19 11:38:53,231 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-19 11:38:53,231 INFO L899 garLoopResultBuilder]: For program point L52-6(lines 35 60) no Hoare annotation was computed. [2023-12-19 11:38:53,231 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 50) no Hoare annotation was computed. [2023-12-19 11:38:53,231 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-12-19 11:38:53,231 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2023-12-19 11:38:53,231 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 42) no Hoare annotation was computed. [2023-12-19 11:38:53,232 INFO L895 garLoopResultBuilder]: At program point L87-3(lines 87 93) the Hoare annotation is: (let ((.cse0 (div ~last_1_var_1_11~0 4294967296)) (.cse9 (* 65536 (div ~last_1_var_1_5~0 65536)))) (let ((.cse1 (= (+ 5 ~var_1_1~0) 0)) (.cse2 (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0)) (.cse4 (<= 1 |ULTIMATE.start_main_~k_loop~0#1|)) (.cse8 (= (+ .cse9 ~var_1_5~0) ~last_1_var_1_5~0)) (.cse5 (not (= (+ .cse9 ~last_1_var_1_11~0) (+ ~last_1_var_1_5~0 (* .cse0 4294967296))))) (.cse3 (= 256 ~last_1_var_1_5~0))) (or (and (< ~last_1_var_1_11~0 9) (< 0 (+ .cse0 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) .cse1 .cse2 (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) .cse3) (and .cse4 (= (+ 5 ~var_1_11~0) 0) .cse5 .cse1 .cse2 (let ((.cse7 (+ .cse9 ~var_1_6~0)) (.cse6 (* (div ~var_1_6~0 65536) 65536))) (or (and (= (+ ~var_1_5~0 8 .cse6) ~var_1_6~0) (<= (+ 8 .cse6 ~last_1_var_1_5~0) .cse7)) (and (<= .cse7 (+ 7 .cse6 ~last_1_var_1_5~0)) .cse8)))) (and (= (+ .cse9 ~var_1_1~0) ~last_1_var_1_5~0) .cse4 .cse8 .cse5 (= ~var_1_1~0 ~var_1_11~0) .cse3)))) [2023-12-19 11:38:53,232 INFO L899 garLoopResultBuilder]: For program point L87-4(lines 87 93) no Hoare annotation was computed. [2023-12-19 11:38:53,232 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-19 11:38:53,232 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-12-19 11:38:53,232 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2023-12-19 11:38:53,232 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-12-19 11:38:53,232 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-12-19 11:38:53,232 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-12-19 11:38:53,232 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 49) no Hoare annotation was computed. [2023-12-19 11:38:53,232 INFO L899 garLoopResultBuilder]: For program point L80-1(line 80) no Hoare annotation was computed. [2023-12-19 11:38:53,232 INFO L899 garLoopResultBuilder]: For program point L47-2(lines 44 50) no Hoare annotation was computed. [2023-12-19 11:38:53,232 INFO L899 garLoopResultBuilder]: For program point L80-3(line 80) no Hoare annotation was computed. [2023-12-19 11:38:53,232 INFO L899 garLoopResultBuilder]: For program point L80-5(line 80) no Hoare annotation was computed. [2023-12-19 11:38:53,233 INFO L899 garLoopResultBuilder]: For program point L80-7(line 80) no Hoare annotation was computed. [2023-12-19 11:38:53,233 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 41) no Hoare annotation was computed. [2023-12-19 11:38:53,233 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 36 42) no Hoare annotation was computed. [2023-12-19 11:38:53,233 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-12-19 11:38:53,233 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-12-19 11:38:53,233 INFO L899 garLoopResultBuilder]: For program point L73-1(lines 61 74) no Hoare annotation was computed. [2023-12-19 11:38:53,233 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-19 11:38:53,233 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-12-19 11:38:53,233 INFO L895 garLoopResultBuilder]: At program point L66-1(line 66) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-12-19 11:38:53,233 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-19 11:38:53,233 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-12-19 11:38:53,233 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 60) no Hoare annotation was computed. [2023-12-19 11:38:53,233 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-19 11:38:53,233 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-19 11:38:53,234 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-19 11:38:53,234 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-19 11:38:53,236 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 11:38:53,237 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 11:38:53,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 11:38:53 BoogieIcfgContainer [2023-12-19 11:38:53,246 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 11:38:53,247 INFO L158 Benchmark]: Toolchain (without parser) took 6833.83ms. Allocated memory was 222.3MB in the beginning and 385.9MB in the end (delta: 163.6MB). Free memory was 158.7MB in the beginning and 274.5MB in the end (delta: -115.8MB). Peak memory consumption was 48.6MB. Max. memory is 8.0GB. [2023-12-19 11:38:53,247 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 222.3MB. Free memory is still 171.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 11:38:53,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.34ms. Allocated memory is still 222.3MB. Free memory was 158.5MB in the beginning and 146.0MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-19 11:38:53,247 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.19ms. Allocated memory is still 222.3MB. Free memory was 146.0MB in the beginning and 143.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 11:38:53,247 INFO L158 Benchmark]: Boogie Preprocessor took 52.99ms. Allocated memory is still 222.3MB. Free memory was 143.5MB in the beginning and 140.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 11:38:53,248 INFO L158 Benchmark]: RCFGBuilder took 359.20ms. Allocated memory was 222.3MB in the beginning and 267.4MB in the end (delta: 45.1MB). Free memory was 140.1MB in the beginning and 217.4MB in the end (delta: -77.3MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. [2023-12-19 11:38:53,248 INFO L158 Benchmark]: TraceAbstraction took 6151.32ms. Allocated memory was 267.4MB in the beginning and 385.9MB in the end (delta: 118.5MB). Free memory was 216.4MB in the beginning and 274.5MB in the end (delta: -58.1MB). Peak memory consumption was 60.9MB. Max. memory is 8.0GB. [2023-12-19 11:38:53,249 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.50ms. Allocated memory is still 222.3MB. Free memory is still 171.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 232.34ms. Allocated memory is still 222.3MB. Free memory was 158.5MB in the beginning and 146.0MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.19ms. Allocated memory is still 222.3MB. Free memory was 146.0MB in the beginning and 143.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.99ms. Allocated memory is still 222.3MB. Free memory was 143.5MB in the beginning and 140.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 359.20ms. Allocated memory was 222.3MB in the beginning and 267.4MB in the end (delta: 45.1MB). Free memory was 140.1MB in the beginning and 217.4MB in the end (delta: -77.3MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. * TraceAbstraction took 6151.32ms. Allocated memory was 267.4MB in the beginning and 385.9MB in the end (delta: 118.5MB). Free memory was 216.4MB in the beginning and 274.5MB in the end (delta: -58.1MB). Peak memory consumption was 60.9MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 12, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 837 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 837 mSDsluCounter, 1976 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1351 mSDsCounter, 220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1187 IncrementalHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 220 mSolverCounterUnsat, 625 mSDtfsCounter, 1187 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=10, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 383 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 127 PreInvPairs, 137 NumberOfFragments, 368 HoareAnnotationTreeSize, 127 FormulaSimplifications, 940 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FormulaSimplificationsInter, 504 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 729 NumberOfCodeBlocks, 729 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 717 ConstructedInterpolants, 0 QuantifiedInterpolants, 3881 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 1312/1312 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: ((((((((((last_1_var_1_11 < 9) && (0 < ((last_1_var_1_11 / 4294967296) + 1))) && (0 <= k_loop)) && ((5 + var_1_1) == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && (256 == var_1_5)) && (8 == var_1_11)) && (256 == last_1_var_1_5)) || ((((((1 <= k_loop) && ((5 + var_1_11) == 0)) && !((((65536 * (last_1_var_1_5 / 65536)) + last_1_var_1_11) == (last_1_var_1_5 + ((last_1_var_1_11 / 4294967296) * 4294967296))))) && ((5 + var_1_1) == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && (((((var_1_5 + 8) + ((var_1_6 / 65536) * 65536)) == var_1_6) && (((8 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5) <= ((65536 * (last_1_var_1_5 / 65536)) + var_1_6))) || ((((65536 * (last_1_var_1_5 / 65536)) + var_1_6) <= ((7 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5)) && (((65536 * (last_1_var_1_5 / 65536)) + var_1_5) == last_1_var_1_5))))) || ((((((((65536 * (last_1_var_1_5 / 65536)) + var_1_1) == last_1_var_1_5) && (1 <= k_loop)) && (((65536 * (last_1_var_1_5 / 65536)) + var_1_5) == last_1_var_1_5)) && !((((65536 * (last_1_var_1_5 / 65536)) + last_1_var_1_11) == (last_1_var_1_5 + ((last_1_var_1_11 / 4294967296) * 4294967296))))) && (var_1_1 == var_1_11)) && (256 == last_1_var_1_5))) RESULT: Ultimate proved your program to be correct! [2023-12-19 11:38:53,274 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...