./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-52.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_fillercode_fillercodestructure_filler-ps-co_file-52.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 d2756a3afeabee0bd07615570da162530b76933ca347aab7efd24527f8af5fb3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:22:04,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:22:04,519 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:22:04,524 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:22:04,525 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:22:04,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:22:04,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:22:04,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:22:04,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:22:04,554 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:22:04,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:22:04,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:22:04,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:22:04,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:22:04,556 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:22:04,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:22:04,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:22:04,557 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:22:04,557 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:22:04,557 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:22:04,561 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:22:04,566 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:22:04,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:22:04,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:22:04,567 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:22:04,567 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:22:04,567 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:22:04,567 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:22:04,568 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:22:04,568 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:22:04,568 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:22:04,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:22:04,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:22:04,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:22:04,574 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:22:04,574 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:22:04,574 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:22:04,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:22:04,575 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:22:04,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:22:04,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:22:04,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:22:04,580 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 -> d2756a3afeabee0bd07615570da162530b76933ca347aab7efd24527f8af5fb3 [2024-11-10 06:22:04,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:22:04,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:22:04,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:22:04,904 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:22:04,904 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:22:04,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-52.i [2024-11-10 06:22:06,761 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:22:07,006 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:22:07,006 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-52.i [2024-11-10 06:22:07,021 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27a7eee40/89b224d8d0f848c39ce39a8f8428369f/FLAG03d69cf57 [2024-11-10 06:22:07,047 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27a7eee40/89b224d8d0f848c39ce39a8f8428369f [2024-11-10 06:22:07,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:22:07,053 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:22:07,056 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:22:07,056 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:22:07,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:22:07,063 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:22:07" (1/1) ... [2024-11-10 06:22:07,064 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33581278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:07, skipping insertion in model container [2024-11-10 06:22:07,065 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:22:07" (1/1) ... [2024-11-10 06:22:07,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:22:07,325 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_fillercode_fillercodestructure_filler-ps-co_file-52.i[919,932] [2024-11-10 06:22:07,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:22:07,413 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:22:07,432 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_fillercode_fillercodestructure_filler-ps-co_file-52.i[919,932] [2024-11-10 06:22:07,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:22:07,574 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:22:07,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:07 WrapperNode [2024-11-10 06:22:07,576 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:22:07,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:22:07,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:22:07,579 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:22:07,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:07" (1/1) ... [2024-11-10 06:22:07,603 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:07" (1/1) ... [2024-11-10 06:22:07,700 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2024-11-10 06:22:07,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:22:07,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:22:07,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:22:07,701 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:22:07,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:07" (1/1) ... [2024-11-10 06:22:07,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:07" (1/1) ... [2024-11-10 06:22:07,717 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:07" (1/1) ... [2024-11-10 06:22:07,751 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 06:22:07,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:07" (1/1) ... [2024-11-10 06:22:07,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:07" (1/1) ... [2024-11-10 06:22:07,760 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:07" (1/1) ... [2024-11-10 06:22:07,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:07" (1/1) ... [2024-11-10 06:22:07,764 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:07" (1/1) ... [2024-11-10 06:22:07,765 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:07" (1/1) ... [2024-11-10 06:22:07,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:22:07,770 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:22:07,770 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:22:07,770 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:22:07,771 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:07" (1/1) ... [2024-11-10 06:22:07,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:22:07,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:22:07,841 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 06:22:07,850 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 06:22:07,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:22:07,897 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:22:07,898 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:22:07,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:22:07,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:22:07,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:22:07,991 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:22:07,996 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:22:08,471 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-10 06:22:08,472 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:22:08,525 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:22:08,525 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:22:08,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:22:08 BoogieIcfgContainer [2024-11-10 06:22:08,531 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:22:08,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:22:08,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:22:08,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:22:08,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:22:07" (1/3) ... [2024-11-10 06:22:08,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1034fae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:22:08, skipping insertion in model container [2024-11-10 06:22:08,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:07" (2/3) ... [2024-11-10 06:22:08,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1034fae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:22:08, skipping insertion in model container [2024-11-10 06:22:08,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:22:08" (3/3) ... [2024-11-10 06:22:08,548 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-52.i [2024-11-10 06:22:08,590 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:22:08,591 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:22:08,742 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:22:08,765 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;@7c27fd60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:22:08,765 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:22:08,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 67 states have internal predecessors, (95), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 06:22:08,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 06:22:08,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:22:08,792 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:08,792 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:22:08,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:22:08,799 INFO L85 PathProgramCache]: Analyzing trace with hash -113955529, now seen corresponding path program 1 times [2024-11-10 06:22:08,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:22:08,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315756905] [2024-11-10 06:22:08,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:22:08,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:22:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:09,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:22:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:09,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:22:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:09,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:22:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:09,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:22:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:09,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:22:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:09,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:22:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:09,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:22:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:09,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:22:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:09,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:22:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:09,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:22:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:09,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:22:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:09,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:22:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:09,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:22:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:09,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:22:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:09,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:22:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:09,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:22:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:09,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:22:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:09,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:22:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:09,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:22:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:09,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:22:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:09,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:22:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:09,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:22:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:09,393 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 06:22:09,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:22:09,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315756905] [2024-11-10 06:22:09,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315756905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:22:09,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:22:09,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:22:09,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614991575] [2024-11-10 06:22:09,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:22:09,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:22:09,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:22:09,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:22:09,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:22:09,444 INFO L87 Difference]: Start difference. First operand has 91 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 67 states have internal predecessors, (95), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 06:22:09,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:22:09,500 INFO L93 Difference]: Finished difference Result 174 states and 293 transitions. [2024-11-10 06:22:09,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:22:09,503 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 155 [2024-11-10 06:22:09,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:22:09,516 INFO L225 Difference]: With dead ends: 174 [2024-11-10 06:22:09,516 INFO L226 Difference]: Without dead ends: 86 [2024-11-10 06:22:09,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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 06:22:09,530 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:22:09,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:22:09,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-10 06:22:09,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-10 06:22:09,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.403225806451613) internal successors, (87), 62 states have internal predecessors, (87), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 06:22:09,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 131 transitions. [2024-11-10 06:22:09,602 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 131 transitions. Word has length 155 [2024-11-10 06:22:09,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:22:09,603 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 131 transitions. [2024-11-10 06:22:09,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 06:22:09,606 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 131 transitions. [2024-11-10 06:22:09,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 06:22:09,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:22:09,612 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:09,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:22:09,612 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:22:09,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:22:09,614 INFO L85 PathProgramCache]: Analyzing trace with hash -355921253, now seen corresponding path program 1 times [2024-11-10 06:22:09,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:22:09,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535560158] [2024-11-10 06:22:09,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:22:09,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:22:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:22:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:22:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:22:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:22:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:22:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:22:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:22:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:22:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:22:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:22:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:22:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:22:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:22:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:22:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:22:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:22:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:22:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:22:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:22:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:22:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:22:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:22:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 06:22:10,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:22:10,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535560158] [2024-11-10 06:22:10,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535560158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:22:10,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:22:10,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:22:10,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648245906] [2024-11-10 06:22:10,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:22:10,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:22:10,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:22:10,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:22:10,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:22:10,295 INFO L87 Difference]: Start difference. First operand 86 states and 131 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:22:10,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:22:10,395 INFO L93 Difference]: Finished difference Result 252 states and 387 transitions. [2024-11-10 06:22:10,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:22:10,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2024-11-10 06:22:10,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:22:10,399 INFO L225 Difference]: With dead ends: 252 [2024-11-10 06:22:10,399 INFO L226 Difference]: Without dead ends: 169 [2024-11-10 06:22:10,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:22:10,406 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 83 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:22:10,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 264 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:22:10,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-10 06:22:10,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2024-11-10 06:22:10,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 118 states have (on average 1.4067796610169492) internal successors, (166), 118 states have internal predecessors, (166), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-10 06:22:10,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 254 transitions. [2024-11-10 06:22:10,461 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 254 transitions. Word has length 155 [2024-11-10 06:22:10,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:22:10,462 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 254 transitions. [2024-11-10 06:22:10,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:22:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 254 transitions. [2024-11-10 06:22:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-10 06:22:10,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:22:10,470 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:10,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:22:10,470 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:22:10,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:22:10,471 INFO L85 PathProgramCache]: Analyzing trace with hash 724583877, now seen corresponding path program 1 times [2024-11-10 06:22:10,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:22:10,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125197523] [2024-11-10 06:22:10,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:22:10,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:22:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:22:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:22:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:22:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:22:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:22:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:22:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:22:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:22:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:22:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:22:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:22:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:22:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:22:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:10,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:22:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:11,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:22:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:11,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:22:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:11,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:22:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:11,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:22:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:11,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:22:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:11,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:22:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:11,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:22:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:11,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:22:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:11,099 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 06:22:11,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:22:11,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125197523] [2024-11-10 06:22:11,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125197523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:22:11,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:22:11,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:22:11,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391066021] [2024-11-10 06:22:11,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:22:11,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:22:11,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:22:11,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:22:11,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:22:11,109 INFO L87 Difference]: Start difference. First operand 165 states and 254 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:22:11,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:22:11,217 INFO L93 Difference]: Finished difference Result 489 states and 756 transitions. [2024-11-10 06:22:11,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:22:11,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2024-11-10 06:22:11,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:22:11,225 INFO L225 Difference]: With dead ends: 489 [2024-11-10 06:22:11,228 INFO L226 Difference]: Without dead ends: 327 [2024-11-10 06:22:11,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:22:11,233 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 88 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:22:11,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 239 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:22:11,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-10 06:22:11,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 324. [2024-11-10 06:22:11,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 231 states have (on average 1.406926406926407) internal successors, (325), 231 states have internal predecessors, (325), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-10 06:22:11,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 501 transitions. [2024-11-10 06:22:11,305 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 501 transitions. Word has length 156 [2024-11-10 06:22:11,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:22:11,306 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 501 transitions. [2024-11-10 06:22:11,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:22:11,307 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 501 transitions. [2024-11-10 06:22:11,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-10 06:22:11,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:22:11,309 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:11,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:22:11,310 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:22:11,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:22:11,311 INFO L85 PathProgramCache]: Analyzing trace with hash -898684161, now seen corresponding path program 1 times [2024-11-10 06:22:11,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:22:11,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876816280] [2024-11-10 06:22:11,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:22:11,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:22:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:22:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:22:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:22:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:22:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:22:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:22:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:22:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:22:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:22:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:22:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:22:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:22:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:22:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:22:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:22:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:22:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:22:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:22:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:22:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:22:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:22:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:22:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,487 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 06:22:12,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:22:12,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876816280] [2024-11-10 06:22:12,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876816280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:22:12,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:22:12,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:22:12,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067507942] [2024-11-10 06:22:12,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:22:12,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:22:12,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:22:12,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:22:12,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:22:12,494 INFO L87 Difference]: Start difference. First operand 324 states and 501 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:22:12,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:22:12,652 INFO L93 Difference]: Finished difference Result 708 states and 1096 transitions. [2024-11-10 06:22:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:22:12,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2024-11-10 06:22:12,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:22:12,659 INFO L225 Difference]: With dead ends: 708 [2024-11-10 06:22:12,661 INFO L226 Difference]: Without dead ends: 387 [2024-11-10 06:22:12,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:22:12,664 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 49 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:22:12,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 215 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:22:12,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-10 06:22:12,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 377. [2024-11-10 06:22:12,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 261 states have (on average 1.3754789272030652) internal successors, (359), 261 states have internal predecessors, (359), 110 states have call successors, (110), 5 states have call predecessors, (110), 5 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-10 06:22:12,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 579 transitions. [2024-11-10 06:22:12,736 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 579 transitions. Word has length 157 [2024-11-10 06:22:12,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:22:12,737 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 579 transitions. [2024-11-10 06:22:12,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:22:12,740 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 579 transitions. [2024-11-10 06:22:12,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-10 06:22:12,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:22:12,742 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:12,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 06:22:12,744 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:22:12,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:22:12,745 INFO L85 PathProgramCache]: Analyzing trace with hash -339076575, now seen corresponding path program 1 times [2024-11-10 06:22:12,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:22:12,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698251557] [2024-11-10 06:22:12,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:22:12,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:22:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:22:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:22:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:22:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:22:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:22:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:22:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:22:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:22:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:22:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:22:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:22:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:22:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:22:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:22:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:22:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:22:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:22:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:22:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:22:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:22:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:22:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:22:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 06:22:12,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:22:12,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698251557] [2024-11-10 06:22:12,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698251557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:22:12,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:22:12,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:22:12,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859845845] [2024-11-10 06:22:12,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:22:12,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:22:12,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:22:12,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:22:12,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:22:12,992 INFO L87 Difference]: Start difference. First operand 377 states and 579 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:22:13,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:22:13,079 INFO L93 Difference]: Finished difference Result 730 states and 1133 transitions. [2024-11-10 06:22:13,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:22:13,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 158 [2024-11-10 06:22:13,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:22:13,086 INFO L225 Difference]: With dead ends: 730 [2024-11-10 06:22:13,086 INFO L226 Difference]: Without dead ends: 409 [2024-11-10 06:22:13,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:22:13,089 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 11 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:22:13,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 238 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:22:13,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-10 06:22:13,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 385. [2024-11-10 06:22:13,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 269 states have (on average 1.379182156133829) internal successors, (371), 269 states have internal predecessors, (371), 110 states have call successors, (110), 5 states have call predecessors, (110), 5 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-10 06:22:13,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 591 transitions. [2024-11-10 06:22:13,151 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 591 transitions. Word has length 158 [2024-11-10 06:22:13,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:22:13,152 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 591 transitions. [2024-11-10 06:22:13,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:22:13,152 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 591 transitions. [2024-11-10 06:22:13,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-10 06:22:13,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:22:13,155 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:13,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 06:22:13,156 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:22:13,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:22:13,156 INFO L85 PathProgramCache]: Analyzing trace with hash 359535875, now seen corresponding path program 1 times [2024-11-10 06:22:13,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:22:13,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217142302] [2024-11-10 06:22:13,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:22:13,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:22:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:13,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:22:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:13,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:22:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:13,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:22:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:13,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:22:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:13,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:22:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:13,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:22:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:13,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:22:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:13,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:22:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:13,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:22:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:13,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:22:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:13,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:22:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:13,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:22:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:13,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:22:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:13,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:22:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:13,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:22:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:13,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:22:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:13,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:22:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:13,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:22:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:13,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:22:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:13,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:22:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:13,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:22:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:13,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:22:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:13,443 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 06:22:13,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:22:13,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217142302] [2024-11-10 06:22:13,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217142302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:22:13,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:22:13,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:22:13,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104916942] [2024-11-10 06:22:13,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:22:13,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:22:13,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:22:13,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:22:13,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:22:13,446 INFO L87 Difference]: Start difference. First operand 385 states and 591 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:22:13,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:22:13,529 INFO L93 Difference]: Finished difference Result 724 states and 1118 transitions. [2024-11-10 06:22:13,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:22:13,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 159 [2024-11-10 06:22:13,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:22:13,533 INFO L225 Difference]: With dead ends: 724 [2024-11-10 06:22:13,534 INFO L226 Difference]: Without dead ends: 395 [2024-11-10 06:22:13,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:22:13,536 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 47 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:22:13,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 230 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:22:13,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-10 06:22:13,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 386. [2024-11-10 06:22:13,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 270 states have (on average 1.3777777777777778) internal successors, (372), 270 states have internal predecessors, (372), 110 states have call successors, (110), 5 states have call predecessors, (110), 5 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-10 06:22:13,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 592 transitions. [2024-11-10 06:22:13,583 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 592 transitions. Word has length 159 [2024-11-10 06:22:13,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:22:13,584 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 592 transitions. [2024-11-10 06:22:13,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:22:13,584 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 592 transitions. [2024-11-10 06:22:13,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-10 06:22:13,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:22:13,586 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:13,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 06:22:13,586 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:22:13,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:22:13,587 INFO L85 PathProgramCache]: Analyzing trace with hash -797659527, now seen corresponding path program 1 times [2024-11-10 06:22:13,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:22:13,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483942880] [2024-11-10 06:22:13,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:22:13,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:22:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:22:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:22:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:22:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:22:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:22:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:22:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:22:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:22:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:22:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:22:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:22:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:22:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:22:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:22:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:22:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:22:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:22:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:22:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:22:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:22:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:22:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:22:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,763 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 06:22:21,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:22:21,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483942880] [2024-11-10 06:22:21,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483942880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:22:21,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:22:21,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 06:22:21,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248463521] [2024-11-10 06:22:21,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:22:21,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 06:22:21,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:22:21,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 06:22:21,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-10 06:22:21,767 INFO L87 Difference]: Start difference. First operand 386 states and 592 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 06:22:28,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:22:28,667 INFO L93 Difference]: Finished difference Result 772 states and 1135 transitions. [2024-11-10 06:22:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-10 06:22:28,667 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 159 [2024-11-10 06:22:28,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:22:28,672 INFO L225 Difference]: With dead ends: 772 [2024-11-10 06:22:28,672 INFO L226 Difference]: Without dead ends: 769 [2024-11-10 06:22:28,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=637, Invalid=1813, Unknown=0, NotChecked=0, Total=2450 [2024-11-10 06:22:28,677 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 469 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 06:22:28,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 919 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 06:22:28,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2024-11-10 06:22:28,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 596. [2024-11-10 06:22:28,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 434 states have (on average 1.3894009216589862) internal successors, (603), 434 states have internal predecessors, (603), 154 states have call successors, (154), 7 states have call predecessors, (154), 7 states have return successors, (154), 154 states have call predecessors, (154), 154 states have call successors, (154) [2024-11-10 06:22:28,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 911 transitions. [2024-11-10 06:22:28,750 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 911 transitions. Word has length 159 [2024-11-10 06:22:28,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:22:28,751 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 911 transitions. [2024-11-10 06:22:28,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 06:22:28,751 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 911 transitions. [2024-11-10 06:22:28,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-10 06:22:28,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:22:28,753 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:28,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 06:22:28,754 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:22:28,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:22:28,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1091062534, now seen corresponding path program 1 times [2024-11-10 06:22:28,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:22:28,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414050613] [2024-11-10 06:22:28,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:22:28,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:22:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:28,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:22:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:28,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:22:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:28,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:22:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:28,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:22:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:28,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:22:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:28,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:22:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:28,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:22:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:28,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:22:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:28,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:22:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:28,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:22:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:28,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:22:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:28,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:22:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:28,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:22:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:28,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:22:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:28,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:22:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:28,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:22:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:28,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:22:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:28,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:22:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:28,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:22:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:29,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:22:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:29,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:22:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:29,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:22:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:29,017 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 06:22:29,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:22:29,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414050613] [2024-11-10 06:22:29,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414050613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:22:29,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:22:29,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:22:29,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554470802] [2024-11-10 06:22:29,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:22:29,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:22:29,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:22:29,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:22:29,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:22:29,020 INFO L87 Difference]: Start difference. First operand 596 states and 911 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:22:29,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:22:29,170 INFO L93 Difference]: Finished difference Result 1257 states and 1934 transitions. [2024-11-10 06:22:29,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:22:29,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 159 [2024-11-10 06:22:29,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:22:29,176 INFO L225 Difference]: With dead ends: 1257 [2024-11-10 06:22:29,176 INFO L226 Difference]: Without dead ends: 718 [2024-11-10 06:22:29,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:22:29,180 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 144 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:22:29,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 503 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:22:29,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-11-10 06:22:29,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 511. [2024-11-10 06:22:29,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 372 states have (on average 1.3951612903225807) internal successors, (519), 372 states have internal predecessors, (519), 132 states have call successors, (132), 6 states have call predecessors, (132), 6 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-10 06:22:29,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 783 transitions. [2024-11-10 06:22:29,229 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 783 transitions. Word has length 159 [2024-11-10 06:22:29,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:22:29,231 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 783 transitions. [2024-11-10 06:22:29,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:22:29,231 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 783 transitions. [2024-11-10 06:22:29,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-10 06:22:29,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:22:29,233 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:29,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 06:22:29,233 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:22:29,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:22:29,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1890024166, now seen corresponding path program 1 times [2024-11-10 06:22:29,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:22:29,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696898381] [2024-11-10 06:22:29,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:22:29,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:22:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat