./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 a84128d9dc2647965d087aabf3251d6852e74faf39ebdf7a8caa157044f8c0e2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:34:35,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:34:35,718 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:34:35,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:34:35,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:34:35,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:34:35,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:34:35,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:34:35,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:34:35,754 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:34:35,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:34:35,755 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:34:35,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:34:35,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:34:35,757 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:34:35,758 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:34:35,758 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:34:35,758 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:34:35,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:34:35,758 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:34:35,759 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:34:35,759 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:34:35,759 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:34:35,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:34:35,762 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:34:35,762 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:34:35,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:34:35,762 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:34:35,763 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:34:35,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:34:35,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:34:35,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:34:35,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:34:35,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:34:35,764 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:34:35,764 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:34:35,764 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:34:35,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:34:35,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:34:35,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:34:35,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:34:35,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:34:35,766 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-clean/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-clean/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 -> a84128d9dc2647965d087aabf3251d6852e74faf39ebdf7a8caa157044f8c0e2 [2024-10-11 09:34:36,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:34:36,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:34:36,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:34:36,059 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:34:36,059 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:34:36,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i [2024-10-11 09:34:37,389 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:34:37,561 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:34:37,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i [2024-10-11 09:34:37,568 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/42e8eaf90/7acb983768ea4f74a2de63c3b2aa2237/FLAG1c444d1a9 [2024-10-11 09:34:37,583 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/42e8eaf90/7acb983768ea4f74a2de63c3b2aa2237 [2024-10-11 09:34:37,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:34:37,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:34:37,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:34:37,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:34:37,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:34:37,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:34:37" (1/1) ... [2024-10-11 09:34:37,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4486770e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:37, skipping insertion in model container [2024-10-11 09:34:37,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:34:37" (1/1) ... [2024-10-11 09:34:37,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:34:37,733 WARN L248 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-pr-ci_file-9.i[918,931] [2024-10-11 09:34:37,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:34:37,821 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:34:37,836 WARN L248 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-pr-ci_file-9.i[918,931] [2024-10-11 09:34:37,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:34:37,890 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:34:37,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:37 WrapperNode [2024-10-11 09:34:37,893 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:34:37,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:34:37,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:34:37,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:34:37,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:37" (1/1) ... [2024-10-11 09:34:37,913 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:37" (1/1) ... [2024-10-11 09:34:37,954 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2024-10-11 09:34:37,954 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:34:37,955 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:34:37,955 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:34:37,955 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:34:37,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:37" (1/1) ... [2024-10-11 09:34:37,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:37" (1/1) ... [2024-10-11 09:34:37,966 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:37" (1/1) ... [2024-10-11 09:34:37,983 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-10-11 09:34:37,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:37" (1/1) ... [2024-10-11 09:34:37,986 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:37" (1/1) ... [2024-10-11 09:34:37,993 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:37" (1/1) ... [2024-10-11 09:34:37,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:37" (1/1) ... [2024-10-11 09:34:37,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:37" (1/1) ... [2024-10-11 09:34:38,000 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:37" (1/1) ... [2024-10-11 09:34:38,003 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:34:38,003 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:34:38,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:34:38,004 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:34:38,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:37" (1/1) ... [2024-10-11 09:34:38,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:34:38,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:34:38,042 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:34:38,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:34:38,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:34:38,087 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:34:38,087 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:34:38,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:34:38,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:34:38,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:34:38,156 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:34:38,158 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:34:38,519 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-11 09:34:38,519 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:34:38,557 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:34:38,557 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:34:38,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:34:38 BoogieIcfgContainer [2024-10-11 09:34:38,558 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:34:38,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:34:38,559 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:34:38,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:34:38,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:34:37" (1/3) ... [2024-10-11 09:34:38,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517ea4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:34:38, skipping insertion in model container [2024-10-11 09:34:38,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:37" (2/3) ... [2024-10-11 09:34:38,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517ea4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:34:38, skipping insertion in model container [2024-10-11 09:34:38,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:34:38" (3/3) ... [2024-10-11 09:34:38,567 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i [2024-10-11 09:34:38,581 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:34:38,581 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:34:38,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:34:38,650 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;@35dee3fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:34:38,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:34:38,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 70 states have internal predecessors, (107), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 09:34:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 09:34:38,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:34:38,670 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:34:38,670 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:34:38,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:34:38,675 INFO L85 PathProgramCache]: Analyzing trace with hash -545865806, now seen corresponding path program 1 times [2024-10-11 09:34:38,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:34:38,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561118795] [2024-10-11 09:34:38,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:34:38,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:34:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:38,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:34:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:38,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:34:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:38,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:34:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:38,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:34:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:38,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:34:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:38,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:34:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:38,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:34:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:38,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:34:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:38,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:34:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:38,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:34:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:38,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:34:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:38,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:34:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:38,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:34:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:34:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:34:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:34:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:34:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:34:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:34:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:34:39,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:34:39,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561118795] [2024-10-11 09:34:39,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561118795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:34:39,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:34:39,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:34:39,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722036279] [2024-10-11 09:34:39,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:34:39,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:34:39,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:34:39,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:34:39,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:34:39,067 INFO L87 Difference]: Start difference. First operand has 91 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 70 states have internal predecessors, (107), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 09:34:39,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:34:39,121 INFO L93 Difference]: Finished difference Result 179 states and 307 transitions. [2024-10-11 09:34:39,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:34:39,131 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 133 [2024-10-11 09:34:39,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:34:39,175 INFO L225 Difference]: With dead ends: 179 [2024-10-11 09:34:39,179 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 09:34:39,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-10-11 09:34:39,190 INFO L432 NwaCegarLoop]: 136 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, 136 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-10-11 09:34:39,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:34:39,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 09:34:39,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-11 09:34:39,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 68 states have (on average 1.4852941176470589) internal successors, (101), 68 states have internal predecessors, (101), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 09:34:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 139 transitions. [2024-10-11 09:34:39,280 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 139 transitions. Word has length 133 [2024-10-11 09:34:39,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:34:39,284 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 139 transitions. [2024-10-11 09:34:39,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 09:34:39,285 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 139 transitions. [2024-10-11 09:34:39,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 09:34:39,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:34:39,294 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:34:39,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:34:39,295 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:34:39,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:34:39,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2105864300, now seen corresponding path program 1 times [2024-10-11 09:34:39,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:34:39,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347705112] [2024-10-11 09:34:39,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:34:39,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:34:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:34:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:34:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:34:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:34:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:34:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:34:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:34:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:34:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:34:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:34:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:34:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:34:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:34:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:34:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:34:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:34:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:34:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:34:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:34:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,657 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:34:39,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:34:39,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347705112] [2024-10-11 09:34:39,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347705112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:34:39,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:34:39,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:34:39,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651961337] [2024-10-11 09:34:39,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:34:39,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:34:39,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:34:39,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:34:39,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:34:39,664 INFO L87 Difference]: Start difference. First operand 89 states and 139 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:34:39,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:34:39,714 INFO L93 Difference]: Finished difference Result 178 states and 279 transitions. [2024-10-11 09:34:39,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:34:39,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 133 [2024-10-11 09:34:39,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:34:39,718 INFO L225 Difference]: With dead ends: 178 [2024-10-11 09:34:39,719 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 09:34:39,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-10-11 09:34:39,721 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:34:39,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:34:39,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 09:34:39,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 09:34:39,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 69 states have internal predecessors, (102), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 09:34:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 140 transitions. [2024-10-11 09:34:39,742 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 140 transitions. Word has length 133 [2024-10-11 09:34:39,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:34:39,744 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 140 transitions. [2024-10-11 09:34:39,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:34:39,745 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 140 transitions. [2024-10-11 09:34:39,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 09:34:39,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:34:39,748 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:34:39,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:34:39,748 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:34:39,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:34:39,749 INFO L85 PathProgramCache]: Analyzing trace with hash -144021603, now seen corresponding path program 1 times [2024-10-11 09:34:39,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:34:39,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698917223] [2024-10-11 09:34:39,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:34:39,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:34:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:34:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:34:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:34:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:34:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:34:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:34:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:34:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:34:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:34:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:34:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:34:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:34:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:34:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:34:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:34:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:34:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:34:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:34:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:34:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:39,896 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:34:39,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:34:39,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698917223] [2024-10-11 09:34:39,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698917223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:34:39,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:34:39,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:34:39,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831647552] [2024-10-11 09:34:39,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:34:39,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:34:39,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:34:39,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:34:39,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:34:39,899 INFO L87 Difference]: Start difference. First operand 90 states and 140 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:34:39,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:34:39,952 INFO L93 Difference]: Finished difference Result 253 states and 391 transitions. [2024-10-11 09:34:39,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:34:39,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 134 [2024-10-11 09:34:39,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:34:39,955 INFO L225 Difference]: With dead ends: 253 [2024-10-11 09:34:39,955 INFO L226 Difference]: Without dead ends: 164 [2024-10-11 09:34:39,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-10-11 09:34:39,956 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 110 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:34:39,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 315 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:34:39,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-11 09:34:39,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2024-10-11 09:34:39,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 126 states have (on average 1.4444444444444444) internal successors, (182), 127 states have internal predecessors, (182), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:34:39,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 246 transitions. [2024-10-11 09:34:39,972 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 246 transitions. Word has length 134 [2024-10-11 09:34:39,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:34:39,973 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 246 transitions. [2024-10-11 09:34:39,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:34:39,973 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 246 transitions. [2024-10-11 09:34:39,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 09:34:39,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:34:39,975 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:34:39,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:34:39,975 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:34:39,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:34:39,976 INFO L85 PathProgramCache]: Analyzing trace with hash -537048613, now seen corresponding path program 1 times [2024-10-11 09:34:39,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:34:39,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418705996] [2024-10-11 09:34:39,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:34:39,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:34:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:43,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:34:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:43,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:34:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:43,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:34:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:43,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:34:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:43,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:34:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:43,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:34:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:43,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:34:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:43,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:34:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:43,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:34:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:43,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:34:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:43,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:34:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:43,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:34:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:43,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:34:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:43,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:34:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:43,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:34:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:43,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:34:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:43,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:34:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:43,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:34:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:43,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:34:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:43,072 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:34:43,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:34:43,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418705996] [2024-10-11 09:34:43,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418705996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:34:43,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:34:43,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 09:34:43,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757215737] [2024-10-11 09:34:43,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:34:43,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 09:34:43,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:34:43,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 09:34:43,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-11 09:34:43,075 INFO L87 Difference]: Start difference. First operand 161 states and 246 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 09:34:46,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:34:46,324 INFO L93 Difference]: Finished difference Result 612 states and 932 transitions. [2024-10-11 09:34:46,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 09:34:46,325 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 134 [2024-10-11 09:34:46,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:34:46,333 INFO L225 Difference]: With dead ends: 612 [2024-10-11 09:34:46,333 INFO L226 Difference]: Without dead ends: 452 [2024-10-11 09:34:46,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2024-10-11 09:34:46,335 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 914 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:34:46,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 349 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 09:34:46,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-10-11 09:34:46,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 242. [2024-10-11 09:34:46,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 207 states have (on average 1.497584541062802) internal successors, (310), 208 states have internal predecessors, (310), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:34:46,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 374 transitions. [2024-10-11 09:34:46,380 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 374 transitions. Word has length 134 [2024-10-11 09:34:46,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:34:46,382 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 374 transitions. [2024-10-11 09:34:46,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 09:34:46,383 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 374 transitions. [2024-10-11 09:34:46,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 09:34:46,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:34:46,388 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:34:46,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 09:34:46,388 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:34:46,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:34:46,389 INFO L85 PathProgramCache]: Analyzing trace with hash -114346787, now seen corresponding path program 1 times [2024-10-11 09:34:46,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:34:46,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583825763] [2024-10-11 09:34:46,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:34:46,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:34:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:48,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:34:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:48,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:34:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:48,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:34:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:48,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:34:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:48,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:34:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:48,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:34:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:48,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:34:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:48,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:34:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:48,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:34:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:48,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:34:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:48,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:34:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:48,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:34:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:48,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:34:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:48,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:34:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:48,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:34:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:48,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:34:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:48,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:34:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:48,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:34:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:48,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:34:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:34:48,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:34:48,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583825763] [2024-10-11 09:34:48,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583825763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:34:48,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:34:48,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 09:34:48,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402872755] [2024-10-11 09:34:48,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:34:48,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 09:34:48,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:34:48,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 09:34:48,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-11 09:34:48,912 INFO L87 Difference]: Start difference. First operand 242 states and 374 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 09:34:50,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:34:50,482 INFO L93 Difference]: Finished difference Result 951 states and 1464 transitions. [2024-10-11 09:34:50,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 09:34:50,483 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 134 [2024-10-11 09:34:50,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:34:50,486 INFO L225 Difference]: With dead ends: 951 [2024-10-11 09:34:50,486 INFO L226 Difference]: Without dead ends: 710 [2024-10-11 09:34:50,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2024-10-11 09:34:50,488 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 743 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:34:50,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 454 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 09:34:50,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-10-11 09:34:50,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 455. [2024-10-11 09:34:50,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 420 states have (on average 1.5404761904761906) internal successors, (647), 421 states have internal predecessors, (647), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:34:50,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 711 transitions. [2024-10-11 09:34:50,506 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 711 transitions. Word has length 134 [2024-10-11 09:34:50,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:34:50,507 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 711 transitions. [2024-10-11 09:34:50,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 09:34:50,507 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 711 transitions. [2024-10-11 09:34:50,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 09:34:50,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:34:50,509 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:34:50,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 09:34:50,509 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:34:50,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:34:50,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1723441818, now seen corresponding path program 1 times [2024-10-11 09:34:50,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:34:50,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5237557] [2024-10-11 09:34:50,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:34:50,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:34:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:52,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:34:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:52,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:34:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:52,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:34:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:52,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:34:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:52,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:34:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:52,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:34:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:52,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:34:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:52,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:34:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:52,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:34:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:52,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:34:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:52,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:34:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:52,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:34:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:52,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:34:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:52,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:34:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:52,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:34:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:52,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:34:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:52,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:34:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:52,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:34:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:52,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:34:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:34:52,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:34:52,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5237557] [2024-10-11 09:34:52,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5237557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:34:52,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:34:52,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 09:34:52,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297669807] [2024-10-11 09:34:52,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:34:52,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 09:34:52,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:34:52,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 09:34:52,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 09:34:52,464 INFO L87 Difference]: Start difference. First operand 455 states and 711 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 09:34:55,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:34:55,008 INFO L93 Difference]: Finished difference Result 1221 states and 1897 transitions. [2024-10-11 09:34:55,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 09:34:55,009 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 134 [2024-10-11 09:34:55,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:34:55,012 INFO L225 Difference]: With dead ends: 1221 [2024-10-11 09:34:55,012 INFO L226 Difference]: Without dead ends: 767 [2024-10-11 09:34:55,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-10-11 09:34:55,014 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 742 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:34:55,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 360 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 09:34:55,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2024-10-11 09:34:55,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 455. [2024-10-11 09:34:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 420 states have (on average 1.5404761904761906) internal successors, (647), 421 states have internal predecessors, (647), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:34:55,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 711 transitions. [2024-10-11 09:34:55,029 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 711 transitions. Word has length 134 [2024-10-11 09:34:55,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:34:55,030 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 711 transitions. [2024-10-11 09:34:55,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 09:34:55,030 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 711 transitions. [2024-10-11 09:34:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 09:34:55,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:34:55,032 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:34:55,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 09:34:55,032 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:34:55,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:34:55,033 INFO L85 PathProgramCache]: Analyzing trace with hash -671062119, now seen corresponding path program 1 times [2024-10-11 09:34:55,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:34:55,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72720447] [2024-10-11 09:34:55,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:34:55,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:34:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:56,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:34:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:56,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:34:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:56,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:34:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:56,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:34:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:56,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:34:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:56,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:34:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:56,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:34:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:56,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:34:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:56,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:34:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:56,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:34:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:56,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:34:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:56,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:34:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:56,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:34:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:56,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:34:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:56,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:34:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:56,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:34:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:56,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:34:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:56,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:34:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:56,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:34:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:56,231 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:34:56,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:34:56,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72720447] [2024-10-11 09:34:56,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72720447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:34:56,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:34:56,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 09:34:56,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638889206] [2024-10-11 09:34:56,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:34:56,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 09:34:56,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:34:56,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 09:34:56,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:34:56,233 INFO L87 Difference]: Start difference. First operand 455 states and 711 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:34:58,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:34:58,157 INFO L93 Difference]: Finished difference Result 1083 states and 1674 transitions. [2024-10-11 09:34:58,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 09:34:58,158 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 134 [2024-10-11 09:34:58,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:34:58,168 INFO L225 Difference]: With dead ends: 1083 [2024-10-11 09:34:58,168 INFO L226 Difference]: Without dead ends: 629 [2024-10-11 09:34:58,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 09:34:58,169 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 142 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 09:34:58,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 648 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 09:34:58,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-10-11 09:34:58,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 473. [2024-10-11 09:34:58,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 438 states have (on average 1.5410958904109588) internal successors, (675), 439 states have internal predecessors, (675), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:34:58,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 739 transitions. [2024-10-11 09:34:58,209 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 739 transitions. Word has length 134 [2024-10-11 09:34:58,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:34:58,209 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 739 transitions. [2024-10-11 09:34:58,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:34:58,209 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 739 transitions. [2024-10-11 09:34:58,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 09:34:58,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:34:58,210 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:34:58,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 09:34:58,211 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:34:58,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:34:58,211 INFO L85 PathProgramCache]: Analyzing trace with hash 199786216, now seen corresponding path program 1 times [2024-10-11 09:34:58,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:34:58,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133616874] [2024-10-11 09:34:58,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:34:58,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:34:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:58,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:34:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:58,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:34:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:58,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:34:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:58,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:34:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:58,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:34:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:58,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:34:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:58,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:34:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:58,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:34:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:58,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:34:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:58,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:34:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:58,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:34:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:59,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:34:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:59,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:34:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:59,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:34:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:59,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:34:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:59,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:34:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:59,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:34:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:59,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:34:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:59,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:34:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:34:59,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:34:59,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133616874] [2024-10-11 09:34:59,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133616874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:34:59,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:34:59,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 09:34:59,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787052440] [2024-10-11 09:34:59,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:34:59,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 09:34:59,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:34:59,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 09:34:59,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:34:59,013 INFO L87 Difference]: Start difference. First operand 473 states and 739 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:34:59,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:34:59,441 INFO L93 Difference]: Finished difference Result 1090 states and 1699 transitions. [2024-10-11 09:34:59,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 09:34:59,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 134 [2024-10-11 09:34:59,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:34:59,444 INFO L225 Difference]: With dead ends: 1090 [2024-10-11 09:34:59,445 INFO L226 Difference]: Without dead ends: 618 [2024-10-11 09:34:59,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:34:59,447 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 195 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:34:59,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 356 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 09:34:59,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-10-11 09:34:59,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 380. [2024-10-11 09:34:59,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 345 states have (on average 1.518840579710145) internal successors, (524), 346 states have internal predecessors, (524), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:34:59,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 588 transitions. [2024-10-11 09:34:59,470 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 588 transitions. Word has length 134 [2024-10-11 09:34:59,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:34:59,470 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 588 transitions. [2024-10-11 09:34:59,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:34:59,470 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 588 transitions. [2024-10-11 09:34:59,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 09:34:59,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:34:59,471 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:34:59,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 09:34:59,471 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:34:59,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:34:59,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1252165915, now seen corresponding path program 1 times [2024-10-11 09:34:59,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:34:59,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624225410] [2024-10-11 09:34:59,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:34:59,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:34:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:00,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:35:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:00,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:35:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:00,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:35:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:00,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:35:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:00,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:35:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:00,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:35:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:00,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:35:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:00,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:35:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:00,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:35:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:00,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:35:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:00,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:35:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:00,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:35:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:00,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:35:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:00,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:35:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:00,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:35:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:00,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:35:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:00,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:35:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:00,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:35:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:00,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:35:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:00,092 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:35:00,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:35:00,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624225410] [2024-10-11 09:35:00,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624225410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:35:00,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:35:00,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 09:35:00,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917585780] [2024-10-11 09:35:00,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:35:00,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 09:35:00,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:35:00,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 09:35:00,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:35:00,094 INFO L87 Difference]: Start difference. First operand 380 states and 588 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:35:00,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:35:01,001 INFO L93 Difference]: Finished difference Result 1010 states and 1551 transitions. [2024-10-11 09:35:01,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 09:35:01,002 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 134 [2024-10-11 09:35:01,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:35:01,005 INFO L225 Difference]: With dead ends: 1010 [2024-10-11 09:35:01,005 INFO L226 Difference]: Without dead ends: 631 [2024-10-11 09:35:01,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 09:35:01,013 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 203 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 09:35:01,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 819 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 09:35:01,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-10-11 09:35:01,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 303. [2024-10-11 09:35:01,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 268 states have (on average 1.492537313432836) internal successors, (400), 269 states have internal predecessors, (400), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:35:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 464 transitions. [2024-10-11 09:35:01,046 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 464 transitions. Word has length 134 [2024-10-11 09:35:01,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:35:01,047 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 464 transitions. [2024-10-11 09:35:01,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:35:01,053 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 464 transitions. [2024-10-11 09:35:01,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 09:35:01,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:35:01,055 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:35:01,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 09:35:01,055 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:35:01,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:35:01,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1064322752, now seen corresponding path program 1 times [2024-10-11 09:35:01,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:35:01,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093102192] [2024-10-11 09:35:01,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:35:01,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:35:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:01,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:35:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:01,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:35:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:01,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:35:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:01,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:35:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:01,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:35:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:01,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:35:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:01,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:35:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:01,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:35:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:01,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:35:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:01,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:35:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:01,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:35:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:01,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:35:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:01,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:35:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:01,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:35:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:01,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:35:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:01,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:35:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:01,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:35:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:01,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:35:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:01,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:35:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-11 09:35:01,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:35:01,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093102192] [2024-10-11 09:35:01,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093102192] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:35:01,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843739109] [2024-10-11 09:35:01,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:35:01,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:35:01,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:35:01,221 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:35:01,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 09:35:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:01,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 09:35:01,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:35:01,588 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 242 proven. 54 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2024-10-11 09:35:01,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:35:01,750 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-11 09:35:01,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843739109] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:35:01,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:35:01,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-11 09:35:01,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786313270] [2024-10-11 09:35:01,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:35:01,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 09:35:01,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:35:01,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 09:35:01,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 09:35:01,753 INFO L87 Difference]: Start difference. First operand 303 states and 464 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 6 states have call successors, (55), 3 states have call predecessors, (55), 5 states have return successors, (56), 5 states have call predecessors, (56), 6 states have call successors, (56) [2024-10-11 09:35:01,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:35:01,937 INFO L93 Difference]: Finished difference Result 625 states and 943 transitions. [2024-10-11 09:35:01,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 09:35:01,938 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 6 states have call successors, (55), 3 states have call predecessors, (55), 5 states have return successors, (56), 5 states have call predecessors, (56), 6 states have call successors, (56) Word has length 136 [2024-10-11 09:35:01,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:35:01,940 INFO L225 Difference]: With dead ends: 625 [2024-10-11 09:35:01,941 INFO L226 Difference]: Without dead ends: 323 [2024-10-11 09:35:01,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-10-11 09:35:01,942 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 317 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:35:01,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 189 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:35:01,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-10-11 09:35:01,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2024-10-11 09:35:01,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 280 states have (on average 1.45) internal successors, (406), 281 states have internal predecessors, (406), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:35:01,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 470 transitions. [2024-10-11 09:35:01,958 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 470 transitions. Word has length 136 [2024-10-11 09:35:01,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:35:01,958 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 470 transitions. [2024-10-11 09:35:01,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 6 states have call successors, (55), 3 states have call predecessors, (55), 5 states have return successors, (56), 5 states have call predecessors, (56), 6 states have call successors, (56) [2024-10-11 09:35:01,958 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 470 transitions. [2024-10-11 09:35:01,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 09:35:01,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:35:01,960 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:35:01,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 09:35:02,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 09:35:02,162 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:35:02,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:35:02,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1425206210, now seen corresponding path program 1 times [2024-10-11 09:35:02,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:35:02,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282684581] [2024-10-11 09:35:02,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:35:02,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:35:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:35:02,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2067616019] [2024-10-11 09:35:02,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:35:02,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:35:02,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:35:02,224 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:35:02,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 09:35:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:02,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 09:35:02,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:35:02,523 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 250 proven. 42 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-10-11 09:35:02,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:35:02,738 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-11 09:35:02,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:35:02,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282684581] [2024-10-11 09:35:02,739 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 09:35:02,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067616019] [2024-10-11 09:35:02,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067616019] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:35:02,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 09:35:02,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-10-11 09:35:02,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412440888] [2024-10-11 09:35:02,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 09:35:02,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 09:35:02,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:35:02,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 09:35:02,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-10-11 09:35:02,741 INFO L87 Difference]: Start difference. First operand 319 states and 470 transitions. Second operand has 16 states, 16 states have (on average 4.9375) internal successors, (79), 16 states have internal predecessors, (79), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2024-10-11 09:35:03,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:35:03,555 INFO L93 Difference]: Finished difference Result 909 states and 1310 transitions. [2024-10-11 09:35:03,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 09:35:03,556 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.9375) internal successors, (79), 16 states have internal predecessors, (79), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 136 [2024-10-11 09:35:03,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:35:03,559 INFO L225 Difference]: With dead ends: 909 [2024-10-11 09:35:03,559 INFO L226 Difference]: Without dead ends: 591 [2024-10-11 09:35:03,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-10-11 09:35:03,561 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 452 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 09:35:03,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 780 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 09:35:03,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-10-11 09:35:03,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 335. [2024-10-11 09:35:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 294 states have (on average 1.4387755102040816) internal successors, (423), 295 states have internal predecessors, (423), 32 states have call successors, (32), 8 states have call predecessors, (32), 8 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:35:03,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 487 transitions. [2024-10-11 09:35:03,576 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 487 transitions. Word has length 136 [2024-10-11 09:35:03,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:35:03,578 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 487 transitions. [2024-10-11 09:35:03,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.9375) internal successors, (79), 16 states have internal predecessors, (79), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2024-10-11 09:35:03,578 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 487 transitions. [2024-10-11 09:35:03,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 09:35:03,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:35:03,585 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:35:03,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 09:35:03,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:35:03,786 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:35:03,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:35:03,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1273107979, now seen corresponding path program 1 times [2024-10-11 09:35:03,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:35:03,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026635851] [2024-10-11 09:35:03,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:35:03,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:35:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:03,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:35:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:03,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:35:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:03,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:35:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:03,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:35:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:03,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:35:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:03,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:35:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:03,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:35:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:03,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:35:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:03,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:35:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:03,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:35:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:03,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:35:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:03,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:35:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:03,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:35:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:03,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:35:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:03,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:35:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:03,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:35:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:03,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:35:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:03,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:35:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:03,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:35:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:35:03,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:35:03,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026635851] [2024-10-11 09:35:03,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026635851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:35:03,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:35:03,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:35:03,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358031947] [2024-10-11 09:35:03,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:35:03,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:35:03,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:35:03,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:35:03,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:35:03,854 INFO L87 Difference]: Start difference. First operand 335 states and 487 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:35:03,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:35:03,938 INFO L93 Difference]: Finished difference Result 768 states and 1102 transitions. [2024-10-11 09:35:03,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:35:03,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 136 [2024-10-11 09:35:03,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:35:03,942 INFO L225 Difference]: With dead ends: 768 [2024-10-11 09:35:03,942 INFO L226 Difference]: Without dead ends: 434 [2024-10-11 09:35:03,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-10-11 09:35:03,943 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 112 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:35:03,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 256 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:35:03,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-10-11 09:35:03,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 335. [2024-10-11 09:35:03,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 294 states have (on average 1.4251700680272108) internal successors, (419), 295 states have internal predecessors, (419), 32 states have call successors, (32), 8 states have call predecessors, (32), 8 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:35:03,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 483 transitions. [2024-10-11 09:35:03,964 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 483 transitions. Word has length 136 [2024-10-11 09:35:03,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:35:03,964 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 483 transitions. [2024-10-11 09:35:03,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:35:03,965 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 483 transitions. [2024-10-11 09:35:03,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 09:35:03,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:35:03,966 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:35:03,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 09:35:03,967 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:35:03,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:35:03,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1421389675, now seen corresponding path program 1 times [2024-10-11 09:35:03,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:35:03,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247134980] [2024-10-11 09:35:03,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:35:03,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:35:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:04,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:35:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:04,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:35:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:04,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:35:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:04,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:35:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:04,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:35:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:04,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:35:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:04,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:35:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:04,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:35:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:04,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:35:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:04,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:35:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:04,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:35:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:04,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:35:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:04,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:35:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:04,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:35:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:04,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:35:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:04,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:35:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:04,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:35:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:04,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:35:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:04,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:35:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:35:04,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:35:04,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247134980] [2024-10-11 09:35:04,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247134980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:35:04,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:35:04,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 09:35:04,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041043882] [2024-10-11 09:35:04,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:35:04,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 09:35:04,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:35:04,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 09:35:04,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-11 09:35:04,603 INFO L87 Difference]: Start difference. First operand 335 states and 483 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 09:35:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:35:05,376 INFO L93 Difference]: Finished difference Result 1188 states and 1663 transitions. [2024-10-11 09:35:05,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 09:35:05,377 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 136 [2024-10-11 09:35:05,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:35:05,383 INFO L225 Difference]: With dead ends: 1188 [2024-10-11 09:35:05,383 INFO L226 Difference]: Without dead ends: 854 [2024-10-11 09:35:05,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-10-11 09:35:05,385 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 542 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 09:35:05,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 587 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 09:35:05,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2024-10-11 09:35:05,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 630. [2024-10-11 09:35:05,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 559 states have (on average 1.4186046511627908) internal successors, (793), 562 states have internal predecessors, (793), 54 states have call successors, (54), 16 states have call predecessors, (54), 16 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 09:35:05,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 901 transitions. [2024-10-11 09:35:05,424 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 901 transitions. Word has length 136 [2024-10-11 09:35:05,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:35:05,424 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 901 transitions. [2024-10-11 09:35:05,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 09:35:05,425 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 901 transitions. [2024-10-11 09:35:05,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 09:35:05,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:35:05,427 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:35:05,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 09:35:05,427 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:35:05,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:35:05,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1483429289, now seen corresponding path program 1 times [2024-10-11 09:35:05,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:35:05,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462359744] [2024-10-11 09:35:05,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:35:05,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:35:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:05,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:35:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:05,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:35:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:05,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:35:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:05,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:35:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:05,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:35:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:05,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:35:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:05,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:35:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:05,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:35:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:05,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:35:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:05,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:35:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:05,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:35:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:05,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:35:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:05,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:35:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:05,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:35:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:05,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:35:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:05,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:35:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:05,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:35:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:05,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:35:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:05,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:35:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:05,822 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-11 09:35:05,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:35:05,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462359744] [2024-10-11 09:35:05,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462359744] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:35:05,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519192762] [2024-10-11 09:35:05,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:35:05,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:35:05,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:35:05,824 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:35:05,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 09:35:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:05,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 09:35:05,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:35:06,027 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:35:06,028 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:35:06,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519192762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:35:06,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 09:35:06,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2024-10-11 09:35:06,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025859156] [2024-10-11 09:35:06,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:35:06,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 09:35:06,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:35:06,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 09:35:06,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2024-10-11 09:35:06,029 INFO L87 Difference]: Start difference. First operand 630 states and 901 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:35:06,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:35:06,224 INFO L93 Difference]: Finished difference Result 1477 states and 2086 transitions. [2024-10-11 09:35:06,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 09:35:06,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 136 [2024-10-11 09:35:06,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:35:06,228 INFO L225 Difference]: With dead ends: 1477 [2024-10-11 09:35:06,228 INFO L226 Difference]: Without dead ends: 848 [2024-10-11 09:35:06,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2024-10-11 09:35:06,230 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 36 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:35:06,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 515 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:35:06,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2024-10-11 09:35:06,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 660. [2024-10-11 09:35:06,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 589 states have (on average 1.4176570458404074) internal successors, (835), 592 states have internal predecessors, (835), 54 states have call successors, (54), 16 states have call predecessors, (54), 16 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 09:35:06,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 943 transitions. [2024-10-11 09:35:06,260 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 943 transitions. Word has length 136 [2024-10-11 09:35:06,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:35:06,260 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 943 transitions. [2024-10-11 09:35:06,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:35:06,261 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 943 transitions. [2024-10-11 09:35:06,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 09:35:06,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:35:06,262 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:35:06,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 09:35:06,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:35:06,467 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:35:06,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:35:06,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1441385519, now seen corresponding path program 1 times [2024-10-11 09:35:06,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:35:06,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264530759] [2024-10-11 09:35:06,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:35:06,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:35:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:07,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:35:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:07,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:35:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:07,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:35:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:07,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:35:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:07,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:35:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:07,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:35:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:07,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:35:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:07,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:35:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:07,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:35:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:07,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:35:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:07,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:35:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:07,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:35:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:07,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:35:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:07,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:35:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:07,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:35:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:07,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:35:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:07,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:35:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:07,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:35:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:07,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:35:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:35:07,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:35:07,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264530759] [2024-10-11 09:35:07,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264530759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:35:07,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:35:07,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 09:35:07,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734019644] [2024-10-11 09:35:07,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:35:07,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 09:35:07,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:35:07,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 09:35:07,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 09:35:07,895 INFO L87 Difference]: Start difference. First operand 660 states and 943 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:35:09,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:35:09,402 INFO L93 Difference]: Finished difference Result 1554 states and 2175 transitions. [2024-10-11 09:35:09,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 09:35:09,402 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2024-10-11 09:35:09,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:35:09,410 INFO L225 Difference]: With dead ends: 1554 [2024-10-11 09:35:09,414 INFO L226 Difference]: Without dead ends: 895 [2024-10-11 09:35:09,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-10-11 09:35:09,416 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 364 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:35:09,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 632 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 09:35:09,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2024-10-11 09:35:09,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 644. [2024-10-11 09:35:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 573 states have (on average 1.3734729493891797) internal successors, (787), 576 states have internal predecessors, (787), 54 states have call successors, (54), 16 states have call predecessors, (54), 16 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 09:35:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 895 transitions. [2024-10-11 09:35:09,485 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 895 transitions. Word has length 137 [2024-10-11 09:35:09,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:35:09,486 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 895 transitions. [2024-10-11 09:35:09,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:35:09,486 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 895 transitions. [2024-10-11 09:35:09,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 09:35:09,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:35:09,489 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:35:09,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 09:35:09,489 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:35:09,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:35:09,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1844269775, now seen corresponding path program 1 times [2024-10-11 09:35:09,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:35:09,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024964397] [2024-10-11 09:35:09,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:35:09,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:35:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:09,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:35:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:09,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:35:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:09,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:35:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:09,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:35:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:09,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:35:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:09,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:35:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:09,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:35:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:09,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:35:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:09,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:35:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:09,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:35:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:09,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:35:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:09,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:35:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:09,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:35:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:09,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:35:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:09,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:35:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:09,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:35:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:09,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:35:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:09,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:35:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:09,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:35:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:35:09,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:35:09,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024964397] [2024-10-11 09:35:09,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024964397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:35:09,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:35:09,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:35:09,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181612365] [2024-10-11 09:35:09,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:35:09,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:35:09,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:35:09,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:35:09,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:35:09,564 INFO L87 Difference]: Start difference. First operand 644 states and 895 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:35:09,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:35:09,692 INFO L93 Difference]: Finished difference Result 1437 states and 1994 transitions. [2024-10-11 09:35:09,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:35:09,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2024-10-11 09:35:09,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:35:09,698 INFO L225 Difference]: With dead ends: 1437 [2024-10-11 09:35:09,699 INFO L226 Difference]: Without dead ends: 794 [2024-10-11 09:35:09,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-10-11 09:35:09,701 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 31 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:35:09,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 225 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:35:09,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2024-10-11 09:35:09,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 674. [2024-10-11 09:35:09,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 603 states have (on average 1.371475953565506) internal successors, (827), 606 states have internal predecessors, (827), 54 states have call successors, (54), 16 states have call predecessors, (54), 16 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 09:35:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 935 transitions. [2024-10-11 09:35:09,749 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 935 transitions. Word has length 137 [2024-10-11 09:35:09,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:35:09,749 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 935 transitions. [2024-10-11 09:35:09,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:35:09,750 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 935 transitions. [2024-10-11 09:35:09,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 09:35:09,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:35:09,751 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:35:09,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 09:35:09,751 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:35:09,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:35:09,752 INFO L85 PathProgramCache]: Analyzing trace with hash 864997568, now seen corresponding path program 1 times [2024-10-11 09:35:09,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:35:09,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720245829] [2024-10-11 09:35:09,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:35:09,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:35:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:35:09,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [58638603] [2024-10-11 09:35:09,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:35:09,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:35:09,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:35:09,816 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:35:09,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 09:35:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:35:09,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 09:35:09,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:35:23,817 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 303 proven. 72 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-10-11 09:35:23,817 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:35:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:35:47,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:35:47,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720245829] [2024-10-11 09:35:47,524 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 09:35:47,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58638603] [2024-10-11 09:35:47,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58638603] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 09:35:47,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 09:35:47,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2024-10-11 09:35:47,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943132757] [2024-10-11 09:35:47,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:35:47,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 09:35:47,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:35:47,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 09:35:47,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=187, Unknown=5, NotChecked=0, Total=240 [2024-10-11 09:35:47,526 INFO L87 Difference]: Start difference. First operand 674 states and 935 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:35:55,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-10-11 09:36:00,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-10-11 09:36:04,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1]