./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-81.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1035d962e39280c92969b9f7066ecadbc22a9f715d97d0ee182811f942c88e9b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:13:39,431 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:13:39,478 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:13:39,482 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:13:39,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:13:39,515 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:13:39,516 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:13:39,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:13:39,517 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:13:39,517 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:13:39,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:13:39,518 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:13:39,518 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:13:39,519 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:13:39,519 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:13:39,521 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:13:39,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:13:39,523 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:13:39,523 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:13:39,527 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:13:39,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:13:39,528 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:13:39,528 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:13:39,528 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:13:39,528 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:13:39,529 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:13:39,529 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:13:39,529 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:13:39,530 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:13:39,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:13:39,530 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:13:39,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:13:39,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:13:39,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:13:39,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:13:39,532 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:13:39,532 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:13:39,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:13:39,533 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:13:39,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:13:39,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:13:39,534 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:13:39,534 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1035d962e39280c92969b9f7066ecadbc22a9f715d97d0ee182811f942c88e9b [2024-11-10 03:13:39,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:13:39,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:13:39,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:13:39,816 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:13:39,817 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:13:39,818 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-81.i [2024-11-10 03:13:41,308 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:13:41,493 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:13:41,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-81.i [2024-11-10 03:13:41,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41f304b5f/7fa04af2023847cea39ae81c48bdb434/FLAG26ad57845 [2024-11-10 03:13:41,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41f304b5f/7fa04af2023847cea39ae81c48bdb434 [2024-11-10 03:13:41,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:13:41,523 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:13:41,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:13:41,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:13:41,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:13:41,532 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:13:41" (1/1) ... [2024-11-10 03:13:41,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@193eb11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:41, skipping insertion in model container [2024-11-10 03:13:41,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:13:41" (1/1) ... [2024-11-10 03:13:41,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:13:41,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-81.i[919,932] [2024-11-10 03:13:41,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:13:41,787 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:13:41,799 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-81.i[919,932] [2024-11-10 03:13:41,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:13:41,864 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:13:41,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:41 WrapperNode [2024-11-10 03:13:41,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:13:41,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:13:41,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:13:41,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:13:41,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:41" (1/1) ... [2024-11-10 03:13:41,882 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:41" (1/1) ... [2024-11-10 03:13:41,964 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2024-11-10 03:13:41,965 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:13:41,966 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:13:41,966 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:13:41,966 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:13:41,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:41" (1/1) ... [2024-11-10 03:13:41,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:41" (1/1) ... [2024-11-10 03:13:42,004 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:41" (1/1) ... [2024-11-10 03:13:42,032 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]. [2024-11-10 03:13:42,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:41" (1/1) ... [2024-11-10 03:13:42,033 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:41" (1/1) ... [2024-11-10 03:13:42,048 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:41" (1/1) ... [2024-11-10 03:13:42,052 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:41" (1/1) ... [2024-11-10 03:13:42,057 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:41" (1/1) ... [2024-11-10 03:13:42,062 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:41" (1/1) ... [2024-11-10 03:13:42,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:13:42,070 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:13:42,070 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:13:42,070 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:13:42,071 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:41" (1/1) ... [2024-11-10 03:13:42,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:13:42,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:13:42,107 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) [2024-11-10 03:13:42,118 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 [2024-11-10 03:13:42,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:13:42,160 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:13:42,160 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:13:42,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:13:42,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:13:42,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:13:42,236 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:13:42,241 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:13:42,603 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L131: havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2024-11-10 03:13:42,638 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 03:13:42,642 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:13:42,666 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:13:42,666 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:13:42,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:13:42 BoogieIcfgContainer [2024-11-10 03:13:42,667 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:13:42,669 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:13:42,670 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:13:42,672 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:13:42,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:13:41" (1/3) ... [2024-11-10 03:13:42,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6925b629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:13:42, skipping insertion in model container [2024-11-10 03:13:42,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:41" (2/3) ... [2024-11-10 03:13:42,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6925b629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:13:42, skipping insertion in model container [2024-11-10 03:13:42,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:13:42" (3/3) ... [2024-11-10 03:13:42,677 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-81.i [2024-11-10 03:13:42,697 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:13:42,698 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:13:42,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:13:42,767 INFO L333 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, 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;@697d2682, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:13:42,767 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:13:42,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 50 states have (on average 1.36) internal successors, (68), 51 states have internal predecessors, (68), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 03:13:42,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-10 03:13:42,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:13:42,786 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:13:42,787 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:13:42,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:13:42,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1382574185, now seen corresponding path program 1 times [2024-11-10 03:13:42,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:13:42,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816429973] [2024-11-10 03:13:42,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:13:42,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:13:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:13:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:13:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:13:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:13:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:13:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:13:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:13:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:13:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:13:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:13:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:13:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:13:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:13:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:13:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:13:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:13:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:13:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:13:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:13:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:13:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:13:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:13:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:13:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:13:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 03:13:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 03:13:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:43,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:13:43,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:13:43,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816429973] [2024-11-10 03:13:43,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816429973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:13:43,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:13:43,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:13:43,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941135358] [2024-11-10 03:13:43,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:13:43,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:13:43,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:13:43,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:13:43,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:13:43,208 INFO L87 Difference]: Start difference. First operand has 79 states, 50 states have (on average 1.36) internal successors, (68), 51 states have internal predecessors, (68), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 03:13:43,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:13:43,243 INFO L93 Difference]: Finished difference Result 150 states and 259 transitions. [2024-11-10 03:13:43,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:13:43,247 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2024-11-10 03:13:43,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:13:43,254 INFO L225 Difference]: With dead ends: 150 [2024-11-10 03:13:43,254 INFO L226 Difference]: Without dead ends: 74 [2024-11-10 03:13:43,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:13:43,260 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:13:43,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:13:43,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-10 03:13:43,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-10 03:13:43,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 03:13:43,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 112 transitions. [2024-11-10 03:13:43,409 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 112 transitions. Word has length 164 [2024-11-10 03:13:43,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:13:43,409 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 112 transitions. [2024-11-10 03:13:43,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 03:13:43,410 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 112 transitions. [2024-11-10 03:13:43,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-10 03:13:43,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:13:43,422 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:13:43,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:13:43,422 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:13:43,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:13:43,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1774596361, now seen corresponding path program 1 times [2024-11-10 03:13:43,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:13:43,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697155660] [2024-11-10 03:13:43,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:13:43,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:13:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:13:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:13:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:13:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:13:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:13:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:13:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:13:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:13:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:13:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:13:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:13:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:13:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:13:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:13:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:13:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:13:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:13:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:13:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:13:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:13:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:13:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:13:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:13:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:13:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 03:13:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 03:13:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:13:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:13:51,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:13:51,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697155660] [2024-11-10 03:13:51,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697155660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:13:51,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:13:51,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 03:13:51,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917908948] [2024-11-10 03:13:51,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:13:51,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 03:13:51,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:13:51,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 03:13:51,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-10 03:13:51,850 INFO L87 Difference]: Start difference. First operand 74 states and 112 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:13:53,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:13:53,405 INFO L93 Difference]: Finished difference Result 289 states and 432 transitions. [2024-11-10 03:13:53,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 03:13:53,406 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2024-11-10 03:13:53,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:13:53,412 INFO L225 Difference]: With dead ends: 289 [2024-11-10 03:13:53,412 INFO L226 Difference]: Without dead ends: 218 [2024-11-10 03:13:53,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2024-11-10 03:13:53,417 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 432 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 03:13:53,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 529 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 03:13:53,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-10 03:13:53,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 142. [2024-11-10 03:13:53,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 87 states have internal predecessors, (113), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 03:13:53,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-11-10 03:13:53,456 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 164 [2024-11-10 03:13:53,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:13:53,458 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-11-10 03:13:53,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:13:53,458 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-11-10 03:13:53,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-10 03:13:53,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:13:53,464 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:13:53,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:13:53,464 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:13:53,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:13:53,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1903679080, now seen corresponding path program 1 times [2024-11-10 03:13:53,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:13:53,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060620029] [2024-11-10 03:13:53,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:13:53,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:13:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:14:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:14:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:14:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:14:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:14:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:14:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:14:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:14:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:14:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:14:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:14:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:14:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:14:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:14:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:14:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:14:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:14:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:14:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:14:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:14:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:14:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:14:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:14:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:14:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 03:14:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 03:14:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:01,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:14:01,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:14:01,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060620029] [2024-11-10 03:14:01,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060620029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:14:01,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:14:01,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 03:14:01,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74899211] [2024-11-10 03:14:01,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:14:01,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 03:14:01,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:14:01,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 03:14:01,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-10 03:14:01,289 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:14:02,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:14:02,604 INFO L93 Difference]: Finished difference Result 254 states and 382 transitions. [2024-11-10 03:14:02,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 03:14:02,604 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2024-11-10 03:14:02,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:14:02,609 INFO L225 Difference]: With dead ends: 254 [2024-11-10 03:14:02,609 INFO L226 Difference]: Without dead ends: 183 [2024-11-10 03:14:02,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2024-11-10 03:14:02,612 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 198 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 03:14:02,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 450 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 03:14:02,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-10 03:14:02,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 133. [2024-11-10 03:14:02,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 78 states have (on average 1.2692307692307692) internal successors, (99), 78 states have internal predecessors, (99), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 03:14:02,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 203 transitions. [2024-11-10 03:14:02,650 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 203 transitions. Word has length 164 [2024-11-10 03:14:02,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:14:02,651 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 203 transitions. [2024-11-10 03:14:02,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:14:02,652 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 203 transitions. [2024-11-10 03:14:02,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 03:14:02,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:14:02,658 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:14:02,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 03:14:02,659 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:14:02,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:14:02,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2104099283, now seen corresponding path program 1 times [2024-11-10 03:14:02,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:14:02,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764642285] [2024-11-10 03:14:02,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:14:02,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:14:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:14:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:14:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:14:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:14:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:14:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:14:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:14:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:14:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:14:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:14:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:14:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:14:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:14:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:14:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:14:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:14:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:14:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:14:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:14:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:14:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:14:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:14:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:14:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:14:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 03:14:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 03:14:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:14:08,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:14:08,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764642285] [2024-11-10 03:14:08,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764642285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:14:08,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:14:08,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 03:14:08,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781534487] [2024-11-10 03:14:08,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:14:08,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 03:14:08,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:14:08,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 03:14:08,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-10 03:14:08,669 INFO L87 Difference]: Start difference. First operand 133 states and 203 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:14:11,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:14:11,476 INFO L93 Difference]: Finished difference Result 306 states and 454 transitions. [2024-11-10 03:14:11,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 03:14:11,477 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-11-10 03:14:11,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:14:11,479 INFO L225 Difference]: With dead ends: 306 [2024-11-10 03:14:11,479 INFO L226 Difference]: Without dead ends: 235 [2024-11-10 03:14:11,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2024-11-10 03:14:11,481 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 258 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:14:11,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 521 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 03:14:11,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-10 03:14:11,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 137. [2024-11-10 03:14:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 82 states have internal predecessors, (107), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 03:14:11,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 211 transitions. [2024-11-10 03:14:11,497 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 211 transitions. Word has length 165 [2024-11-10 03:14:11,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:14:11,497 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 211 transitions. [2024-11-10 03:14:11,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:14:11,498 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 211 transitions. [2024-11-10 03:14:11,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 03:14:11,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:14:11,499 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:14:11,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 03:14:11,500 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:14:11,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:14:11,500 INFO L85 PathProgramCache]: Analyzing trace with hash 307147924, now seen corresponding path program 1 times [2024-11-10 03:14:11,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:14:11,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933792567] [2024-11-10 03:14:11,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:14:11,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:14:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:14:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:14:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:14:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:14:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:14:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:14:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:14:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:14:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:14:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:14:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:14:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:14:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:14:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:14:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:14:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:14:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:14:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:14:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:14:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:14:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:14:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:14:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:14:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:14:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 03:14:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 03:14:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:16,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:14:16,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:14:16,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933792567] [2024-11-10 03:14:16,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933792567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:14:16,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:14:16,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 03:14:16,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296059487] [2024-11-10 03:14:16,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:14:16,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 03:14:16,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:14:16,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 03:14:16,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-10 03:14:16,838 INFO L87 Difference]: Start difference. First operand 137 states and 211 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 03:14:18,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:14:18,208 INFO L93 Difference]: Finished difference Result 359 states and 533 transitions. [2024-11-10 03:14:18,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 03:14:18,210 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 165 [2024-11-10 03:14:18,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:14:18,211 INFO L225 Difference]: With dead ends: 359 [2024-11-10 03:14:18,211 INFO L226 Difference]: Without dead ends: 276 [2024-11-10 03:14:18,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2024-11-10 03:14:18,213 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 476 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 03:14:18,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 667 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 03:14:18,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-10 03:14:18,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 148. [2024-11-10 03:14:18,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 93 states have (on average 1.3548387096774193) internal successors, (126), 93 states have internal predecessors, (126), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 03:14:18,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 230 transitions. [2024-11-10 03:14:18,240 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 230 transitions. Word has length 165 [2024-11-10 03:14:18,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:14:18,241 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 230 transitions. [2024-11-10 03:14:18,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 03:14:18,242 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 230 transitions. [2024-11-10 03:14:18,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 03:14:18,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:14:18,243 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:14:18,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 03:14:18,243 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:14:18,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:14:18,244 INFO L85 PathProgramCache]: Analyzing trace with hash -2061785294, now seen corresponding path program 1 times [2024-11-10 03:14:18,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:14:18,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865017107] [2024-11-10 03:14:18,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:14:18,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:14:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:22,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:14:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:22,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:14:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:22,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:14:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:22,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:14:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:22,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:14:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:22,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:14:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:22,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:14:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:22,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:14:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:22,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:14:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:22,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:14:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:22,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:14:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:22,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:14:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:22,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:14:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:22,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:14:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:22,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:14:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:22,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:14:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:22,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:14:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:22,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:14:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:22,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:14:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:22,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:14:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:22,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:14:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:22,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:14:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:23,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:14:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:23,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:14:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:23,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 03:14:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:23,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 03:14:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:23,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:14:23,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:14:23,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865017107] [2024-11-10 03:14:23,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865017107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:14:23,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:14:23,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 03:14:23,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371682592] [2024-11-10 03:14:23,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:14:23,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 03:14:23,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:14:23,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 03:14:23,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-10 03:14:23,031 INFO L87 Difference]: Start difference. First operand 148 states and 230 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:14:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:14:25,869 INFO L93 Difference]: Finished difference Result 288 states and 437 transitions. [2024-11-10 03:14:25,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 03:14:25,869 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-11-10 03:14:25,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:14:25,872 INFO L225 Difference]: With dead ends: 288 [2024-11-10 03:14:25,872 INFO L226 Difference]: Without dead ends: 205 [2024-11-10 03:14:25,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2024-11-10 03:14:25,878 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 182 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 03:14:25,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 494 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 03:14:25,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-10 03:14:25,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 144. [2024-11-10 03:14:25,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 03:14:25,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 222 transitions. [2024-11-10 03:14:25,909 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 222 transitions. Word has length 165 [2024-11-10 03:14:25,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:14:25,910 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 222 transitions. [2024-11-10 03:14:25,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:14:25,912 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 222 transitions. [2024-11-10 03:14:25,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 03:14:25,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:14:25,913 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:14:25,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 03:14:25,917 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:14:25,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:14:25,918 INFO L85 PathProgramCache]: Analyzing trace with hash 436230643, now seen corresponding path program 1 times [2024-11-10 03:14:25,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:14:25,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824284942] [2024-11-10 03:14:25,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:14:25,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:14:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:14:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:14:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:14:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:14:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:14:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:14:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:14:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:14:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:14:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:14:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:14:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:14:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:14:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:14:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:14:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:14:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:14:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:14:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:14:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:14:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:14:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:14:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:14:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:14:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 03:14:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 03:14:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:33,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:14:33,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:14:33,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824284942] [2024-11-10 03:14:33,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824284942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:14:33,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:14:33,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 03:14:33,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963699041] [2024-11-10 03:14:33,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:14:33,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 03:14:33,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:14:33,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 03:14:33,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-10 03:14:33,553 INFO L87 Difference]: Start difference. First operand 144 states and 222 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 03:14:35,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:14:35,783 INFO L93 Difference]: Finished difference Result 359 states and 527 transitions. [2024-11-10 03:14:35,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 03:14:35,785 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 165 [2024-11-10 03:14:35,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:14:35,786 INFO L225 Difference]: With dead ends: 359 [2024-11-10 03:14:35,786 INFO L226 Difference]: Without dead ends: 280 [2024-11-10 03:14:35,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2024-11-10 03:14:35,788 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 557 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:14:35,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 575 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 03:14:35,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-10 03:14:35,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 145. [2024-11-10 03:14:35,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 03:14:35,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 224 transitions. [2024-11-10 03:14:35,802 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 224 transitions. Word has length 165 [2024-11-10 03:14:35,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:14:35,803 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 224 transitions. [2024-11-10 03:14:35,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 03:14:35,803 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 224 transitions. [2024-11-10 03:14:35,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 03:14:35,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:14:35,804 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:14:35,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 03:14:35,805 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:14:35,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:14:35,805 INFO L85 PathProgramCache]: Analyzing trace with hash -198410701, now seen corresponding path program 1 times [2024-11-10 03:14:35,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:14:35,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652112175] [2024-11-10 03:14:35,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:14:35,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:14:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:14:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:14:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:14:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:14:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:14:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:14:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:14:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:14:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:14:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:14:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:14:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:14:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:14:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:14:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:14:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:14:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:14:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:14:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:14:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:14:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:14:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:14:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:14:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:14:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 03:14:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 03:14:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:36,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:14:36,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:14:36,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652112175] [2024-11-10 03:14:36,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652112175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:14:36,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:14:36,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 03:14:36,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719572144] [2024-11-10 03:14:36,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:14:36,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 03:14:36,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:14:36,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 03:14:36,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:14:36,332 INFO L87 Difference]: Start difference. First operand 145 states and 224 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:14:36,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:14:36,766 INFO L93 Difference]: Finished difference Result 330 states and 490 transitions. [2024-11-10 03:14:36,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 03:14:36,769 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-11-10 03:14:36,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:14:36,772 INFO L225 Difference]: With dead ends: 330 [2024-11-10 03:14:36,772 INFO L226 Difference]: Without dead ends: 241 [2024-11-10 03:14:36,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-10 03:14:36,773 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 354 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:14:36,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 398 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 03:14:36,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-10 03:14:36,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 145. [2024-11-10 03:14:36,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 03:14:36,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 224 transitions. [2024-11-10 03:14:36,792 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 224 transitions. Word has length 165 [2024-11-10 03:14:36,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:14:36,793 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 224 transitions. [2024-11-10 03:14:36,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:14:36,793 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 224 transitions. [2024-11-10 03:14:36,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 03:14:36,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:14:36,794 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:14:36,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 03:14:36,795 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:14:36,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:14:36,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1814699733, now seen corresponding path program 1 times [2024-11-10 03:14:36,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:14:36,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940633418] [2024-11-10 03:14:36,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:14:36,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:14:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:14:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:14:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:14:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:14:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:14:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:14:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:14:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:14:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:14:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:14:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:14:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:14:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:14:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:14:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:14:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:14:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:14:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:14:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:14:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:14:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:14:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:14:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:14:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:14:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 03:14:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 03:14:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:41,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:14:41,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:14:41,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940633418] [2024-11-10 03:14:41,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940633418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:14:41,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:14:41,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 03:14:41,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306852776] [2024-11-10 03:14:41,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:14:41,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 03:14:41,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:14:41,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 03:14:41,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-10 03:14:41,092 INFO L87 Difference]: Start difference. First operand 145 states and 224 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 03:14:42,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:14:42,152 INFO L93 Difference]: Finished difference Result 358 states and 534 transitions. [2024-11-10 03:14:42,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 03:14:42,153 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 165 [2024-11-10 03:14:42,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:14:42,155 INFO L225 Difference]: With dead ends: 358 [2024-11-10 03:14:42,156 INFO L226 Difference]: Without dead ends: 269 [2024-11-10 03:14:42,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2024-11-10 03:14:42,158 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 425 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 03:14:42,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 550 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 03:14:42,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-10 03:14:42,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 158. [2024-11-10 03:14:42,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 103 states have (on average 1.3689320388349515) internal successors, (141), 103 states have internal predecessors, (141), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 03:14:42,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 245 transitions. [2024-11-10 03:14:42,183 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 245 transitions. Word has length 165 [2024-11-10 03:14:42,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:14:42,184 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 245 transitions. [2024-11-10 03:14:42,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 03:14:42,184 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 245 transitions. [2024-11-10 03:14:42,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 03:14:42,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:14:42,186 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:14:42,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 03:14:42,186 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:14:42,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:14:42,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1943782452, now seen corresponding path program 1 times [2024-11-10 03:14:42,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:14:42,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721486659] [2024-11-10 03:14:42,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:14:42,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:14:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:14:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:14:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:14:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:14:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:14:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:14:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:14:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:14:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:14:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:14:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:14:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:14:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:14:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:14:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:14:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:14:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:14:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:14:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:14:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:14:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:14:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:14:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:14:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:14:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 03:14:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 03:14:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:49,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:14:49,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:14:49,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721486659] [2024-11-10 03:14:49,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721486659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:14:49,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:14:49,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 03:14:49,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800547965] [2024-11-10 03:14:49,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:14:49,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 03:14:49,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:14:49,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 03:14:49,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-10 03:14:49,757 INFO L87 Difference]: Start difference. First operand 158 states and 245 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-10 03:14:51,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:14:51,188 INFO L93 Difference]: Finished difference Result 345 states and 510 transitions. [2024-11-10 03:14:51,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 03:14:51,188 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) Word has length 165 [2024-11-10 03:14:51,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:14:51,190 INFO L225 Difference]: With dead ends: 345 [2024-11-10 03:14:51,191 INFO L226 Difference]: Without dead ends: 256 [2024-11-10 03:14:51,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2024-11-10 03:14:51,192 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 397 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 03:14:51,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 623 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 03:14:51,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-10 03:14:51,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 158. [2024-11-10 03:14:51,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 103 states have (on average 1.3689320388349515) internal successors, (141), 103 states have internal predecessors, (141), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 03:14:51,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 245 transitions. [2024-11-10 03:14:51,226 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 245 transitions. Word has length 165 [2024-11-10 03:14:51,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:14:51,227 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 245 transitions. [2024-11-10 03:14:51,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-10 03:14:51,227 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 245 transitions. [2024-11-10 03:14:51,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 03:14:51,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:14:51,229 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:14:51,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 03:14:51,229 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:14:51,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:14:51,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1521296726, now seen corresponding path program 1 times [2024-11-10 03:14:51,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:14:51,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831165019] [2024-11-10 03:14:51,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:14:51,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:14:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:14:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:14:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:14:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:14:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:14:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:14:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:14:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:14:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:14:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:14:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:14:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:14:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:14:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:14:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:14:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:14:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:14:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:14:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:14:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:14:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:14:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:14:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:14:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:14:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 03:14:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 03:14:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:52,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:14:52,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:14:52,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831165019] [2024-11-10 03:14:52,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831165019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:14:52,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:14:52,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 03:14:52,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176173359] [2024-11-10 03:14:52,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:14:52,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 03:14:52,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:14:52,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 03:14:52,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:14:52,427 INFO L87 Difference]: Start difference. First operand 158 states and 245 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 03:14:53,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:14:53,232 INFO L93 Difference]: Finished difference Result 321 states and 479 transitions. [2024-11-10 03:14:53,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 03:14:53,233 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 165 [2024-11-10 03:14:53,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:14:53,235 INFO L225 Difference]: With dead ends: 321 [2024-11-10 03:14:53,235 INFO L226 Difference]: Without dead ends: 224 [2024-11-10 03:14:53,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-11-10 03:14:53,236 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 270 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 03:14:53,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 463 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 03:14:53,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-10 03:14:53,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 158. [2024-11-10 03:14:53,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 103 states have (on average 1.3592233009708738) internal successors, (140), 103 states have internal predecessors, (140), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 03:14:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 244 transitions. [2024-11-10 03:14:53,250 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 244 transitions. Word has length 165 [2024-11-10 03:14:53,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:14:53,251 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 244 transitions. [2024-11-10 03:14:53,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 03:14:53,251 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 244 transitions. [2024-11-10 03:14:53,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 03:14:53,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:14:53,252 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:14:53,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 03:14:53,252 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:14:53,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:14:53,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1309141108, now seen corresponding path program 1 times [2024-11-10 03:14:53,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:14:53,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825647240] [2024-11-10 03:14:53,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:14:53,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:14:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:14:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:14:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:14:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:14:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:14:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:14:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:14:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:14:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:14:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:14:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:14:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:14:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:14:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:14:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:14:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:14:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:14:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:14:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:14:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:14:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:14:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:14:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:14:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:14:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 03:14:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 03:14:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:14:56,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:14:56,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:14:56,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825647240] [2024-11-10 03:14:56,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825647240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:14:56,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:14:56,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 03:14:56,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445269127] [2024-11-10 03:14:56,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:14:56,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 03:14:56,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:14:56,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 03:14:56,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:14:56,624 INFO L87 Difference]: Start difference. First operand 158 states and 244 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:14:57,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:14:57,015 INFO L93 Difference]: Finished difference Result 318 states and 480 transitions. [2024-11-10 03:14:57,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 03:14:57,016 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-11-10 03:14:57,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:14:57,018 INFO L225 Difference]: With dead ends: 318 [2024-11-10 03:14:57,018 INFO L226 Difference]: Without dead ends: 229 [2024-11-10 03:14:57,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-11-10 03:14:57,019 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 144 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:14:57,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 447 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 03:14:57,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-10 03:14:57,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 159. [2024-11-10 03:14:57,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 104 states have internal predecessors, (142), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 03:14:57,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 246 transitions. [2024-11-10 03:14:57,033 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 246 transitions. Word has length 165 [2024-11-10 03:14:57,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:14:57,034 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 246 transitions. [2024-11-10 03:14:57,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:14:57,034 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 246 transitions. [2024-11-10 03:14:57,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 03:14:57,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:14:57,035 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:14:57,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 03:14:57,035 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:14:57,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:14:57,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1438223827, now seen corresponding path program 1 times [2024-11-10 03:14:57,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:14:57,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359945429] [2024-11-10 03:14:57,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:14:57,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:14:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:15:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:15:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:15:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:15:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:15:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:15:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:15:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:15:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:15:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:15:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:15:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:15:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:15:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:15:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:15:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:15:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:15:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:15:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:15:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:15:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:15:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:15:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:15:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:15:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 03:15:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 03:15:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:01,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:15:01,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:15:01,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359945429] [2024-11-10 03:15:01,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359945429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:15:01,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:15:01,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 03:15:01,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859823670] [2024-11-10 03:15:01,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:15:01,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 03:15:01,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:15:01,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 03:15:01,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-10 03:15:01,157 INFO L87 Difference]: Start difference. First operand 159 states and 246 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:15:01,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:15:01,671 INFO L93 Difference]: Finished difference Result 322 states and 485 transitions. [2024-11-10 03:15:01,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 03:15:01,672 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-11-10 03:15:01,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:15:01,674 INFO L225 Difference]: With dead ends: 322 [2024-11-10 03:15:01,674 INFO L226 Difference]: Without dead ends: 222 [2024-11-10 03:15:01,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-10 03:15:01,675 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 131 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 03:15:01,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 497 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 03:15:01,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-10 03:15:01,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 160. [2024-11-10 03:15:01,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 105 states have (on average 1.3714285714285714) internal successors, (144), 105 states have internal predecessors, (144), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 03:15:01,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 248 transitions. [2024-11-10 03:15:01,694 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 248 transitions. Word has length 165 [2024-11-10 03:15:01,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:15:01,695 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 248 transitions. [2024-11-10 03:15:01,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:15:01,695 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 248 transitions. [2024-11-10 03:15:01,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-10 03:15:01,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:15:01,697 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:15:01,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 03:15:01,697 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:15:01,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:15:01,698 INFO L85 PathProgramCache]: Analyzing trace with hash 436509195, now seen corresponding path program 1 times [2024-11-10 03:15:01,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:15:01,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199104403] [2024-11-10 03:15:01,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:15:01,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:15:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat