./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_operatoramount_amount100_file-63.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_operatoramount_amount100_file-63.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 577634e4ca5e5062d04a888d1f269694da9d1fc5e92895960c37cfcca177a593 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:13:31,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:13:31,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:13:31,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:13:31,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:13:31,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:13:31,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:13:31,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:13:31,764 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:13:31,765 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:13:31,765 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:13:31,766 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:13:31,767 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:13:31,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:13:31,769 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:13:31,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:13:31,770 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:13:31,770 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:13:31,771 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:13:31,771 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:13:31,771 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:13:31,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:13:31,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:13:31,773 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:13:31,773 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:13:31,774 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:13:31,774 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:13:31,774 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:13:31,775 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:13:31,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:13:31,775 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:13:31,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:13:31,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:13:31,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:13:31,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:13:31,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:13:31,777 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:13:31,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:13:31,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:13:31,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:13:31,778 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:13:31,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:13:31,780 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 -> 577634e4ca5e5062d04a888d1f269694da9d1fc5e92895960c37cfcca177a593 [2024-10-11 12:13:32,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:13:32,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:13:32,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:13:32,062 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:13:32,063 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:13:32,064 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-63.i [2024-10-11 12:13:33,524 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:13:33,762 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:13:33,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-63.i [2024-10-11 12:13:33,781 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7708e048e/f4f551ff42944dedb82d8e3ee03be4f3/FLAG960071718 [2024-10-11 12:13:33,797 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7708e048e/f4f551ff42944dedb82d8e3ee03be4f3 [2024-10-11 12:13:33,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:13:33,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:13:33,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:13:33,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:13:33,809 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:13:33,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:13:33" (1/1) ... [2024-10-11 12:13:33,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dcb577e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:13:33, skipping insertion in model container [2024-10-11 12:13:33,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:13:33" (1/1) ... [2024-10-11 12:13:33,846 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:13:34,022 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_operatoramount_amount100_file-63.i[916,929] [2024-10-11 12:13:34,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:13:34,135 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:13:34,150 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_operatoramount_amount100_file-63.i[916,929] [2024-10-11 12:13:34,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:13:34,212 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:13:34,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:13:34 WrapperNode [2024-10-11 12:13:34,213 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:13:34,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:13:34,215 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:13:34,215 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:13:34,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:13:34" (1/1) ... [2024-10-11 12:13:34,236 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:13:34" (1/1) ... [2024-10-11 12:13:34,303 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2024-10-11 12:13:34,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:13:34,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:13:34,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:13:34,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:13:34,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:13:34" (1/1) ... [2024-10-11 12:13:34,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:13:34" (1/1) ... [2024-10-11 12:13:34,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:13:34" (1/1) ... [2024-10-11 12:13:34,357 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 12:13:34,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:13:34" (1/1) ... [2024-10-11 12:13:34,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:13:34" (1/1) ... [2024-10-11 12:13:34,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:13:34" (1/1) ... [2024-10-11 12:13:34,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:13:34" (1/1) ... [2024-10-11 12:13:34,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:13:34" (1/1) ... [2024-10-11 12:13:34,399 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:13:34" (1/1) ... [2024-10-11 12:13:34,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:13:34,413 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:13:34,413 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:13:34,413 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:13:34,415 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:13:34" (1/1) ... [2024-10-11 12:13:34,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:13:34,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:13:34,449 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 12:13:34,451 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 12:13:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:13:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:13:34,494 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:13:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:13:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:13:34,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:13:34,573 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:13:34,575 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:13:35,155 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-11 12:13:35,155 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:13:35,199 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:13:35,199 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:13:35,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:13:35 BoogieIcfgContainer [2024-10-11 12:13:35,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:13:35,205 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:13:35,205 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:13:35,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:13:35,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:13:33" (1/3) ... [2024-10-11 12:13:35,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f9dbc97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:13:35, skipping insertion in model container [2024-10-11 12:13:35,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:13:34" (2/3) ... [2024-10-11 12:13:35,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f9dbc97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:13:35, skipping insertion in model container [2024-10-11 12:13:35,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:13:35" (3/3) ... [2024-10-11 12:13:35,214 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-63.i [2024-10-11 12:13:35,228 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:13:35,228 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:13:35,289 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:13:35,299 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;@758307fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:13:35,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:13:35,304 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 60 states have (on average 1.5333333333333334) internal successors, (92), 61 states have internal predecessors, (92), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 12:13:35,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 12:13:35,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:13:35,317 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:35,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:13:35,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:13:35,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1776301218, now seen corresponding path program 1 times [2024-10-11 12:13:35,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:13:35,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129569571] [2024-10-11 12:13:35,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:13:35,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:13:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:35,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:13:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:35,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:13:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:35,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:13:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:35,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:13:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:35,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:13:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:35,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:13:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:35,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:13:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:35,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:13:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:35,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:13:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:35,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:13:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:35,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:13:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:35,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:13:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:35,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:13:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:35,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:13:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:35,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:13:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:35,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:13:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:35,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:13:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:35,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:13:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:35,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:13:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:35,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:13:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:35,991 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:13:35,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:13:35,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129569571] [2024-10-11 12:13:35,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129569571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:13:35,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:13:35,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:13:35,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695412892] [2024-10-11 12:13:35,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:13:36,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:13:36,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:13:36,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:13:36,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:13:36,027 INFO L87 Difference]: Start difference. First operand has 83 states, 60 states have (on average 1.5333333333333334) internal successors, (92), 61 states have internal predecessors, (92), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:13:36,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:13:36,095 INFO L93 Difference]: Finished difference Result 162 states and 282 transitions. [2024-10-11 12:13:36,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:13:36,099 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-10-11 12:13:36,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:13:36,110 INFO L225 Difference]: With dead ends: 162 [2024-10-11 12:13:36,111 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 12:13:36,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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 12:13:36,121 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:13:36,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 228 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:13:36,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 12:13:36,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-11 12:13:36,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 58 states have internal predecessors, (82), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 12:13:36,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 122 transitions. [2024-10-11 12:13:36,166 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 122 transitions. Word has length 139 [2024-10-11 12:13:36,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:13:36,168 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 122 transitions. [2024-10-11 12:13:36,168 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:13:36,169 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 122 transitions. [2024-10-11 12:13:36,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 12:13:36,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:13:36,172 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:36,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:13:36,174 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:13:36,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:13:36,175 INFO L85 PathProgramCache]: Analyzing trace with hash 328704254, now seen corresponding path program 1 times [2024-10-11 12:13:36,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:13:36,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758292525] [2024-10-11 12:13:36,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:13:36,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:13:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:36,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:13:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:36,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:13:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:36,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:13:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:36,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:13:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:36,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:13:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:36,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:13:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:36,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:13:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:36,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:13:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:36,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:13:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:36,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:13:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:36,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:13:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:36,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:13:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:36,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:13:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:36,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:13:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:36,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:13:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:36,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:13:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:36,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:13:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:36,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:13:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:36,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:13:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:36,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:13:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:36,482 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:13:36,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:13:36,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758292525] [2024-10-11 12:13:36,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758292525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:13:36,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:13:36,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:13:36,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084663962] [2024-10-11 12:13:36,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:13:36,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:13:36,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:13:36,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:13:36,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:13:36,492 INFO L87 Difference]: Start difference. First operand 80 states and 122 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:13:36,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:13:36,591 INFO L93 Difference]: Finished difference Result 208 states and 315 transitions. [2024-10-11 12:13:36,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:13:36,592 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-10-11 12:13:36,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:13:36,594 INFO L225 Difference]: With dead ends: 208 [2024-10-11 12:13:36,594 INFO L226 Difference]: Without dead ends: 129 [2024-10-11 12:13:36,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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 12:13:36,597 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 70 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:13:36,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 222 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:13:36,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-11 12:13:36,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2024-10-11 12:13:36,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 96 states have internal predecessors, (134), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 12:13:36,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 190 transitions. [2024-10-11 12:13:36,619 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 190 transitions. Word has length 139 [2024-10-11 12:13:36,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:13:36,620 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 190 transitions. [2024-10-11 12:13:36,621 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:13:36,621 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 190 transitions. [2024-10-11 12:13:36,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 12:13:36,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:13:36,623 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:36,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:13:36,624 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:13:36,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:13:36,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1590255104, now seen corresponding path program 1 times [2024-10-11 12:13:36,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:13:36,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59140119] [2024-10-11 12:13:36,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:13:36,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:13:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:37,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:13:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:37,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:13:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:37,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:13:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:37,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:13:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:37,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:13:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:37,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:13:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:37,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:13:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:37,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:13:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:37,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:13:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:37,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:13:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:37,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:13:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:37,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:13:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:37,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:13:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:37,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:13:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:37,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:13:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:37,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:13:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:37,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:13:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:37,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:13:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:37,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:13:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:37,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:13:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:37,150 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:13:37,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:13:37,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59140119] [2024-10-11 12:13:37,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59140119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:13:37,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:13:37,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:13:37,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431040338] [2024-10-11 12:13:37,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:13:37,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:13:37,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:13:37,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:13:37,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:13:37,157 INFO L87 Difference]: Start difference. First operand 126 states and 190 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:13:37,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:13:37,336 INFO L93 Difference]: Finished difference Result 366 states and 550 transitions. [2024-10-11 12:13:37,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:13:37,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-10-11 12:13:37,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:13:37,342 INFO L225 Difference]: With dead ends: 366 [2024-10-11 12:13:37,344 INFO L226 Difference]: Without dead ends: 241 [2024-10-11 12:13:37,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:13:37,348 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 86 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:13:37,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 338 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:13:37,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-11 12:13:37,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 181. [2024-10-11 12:13:37,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 128 states have (on average 1.3515625) internal successors, (173), 129 states have internal predecessors, (173), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 12:13:37,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 269 transitions. [2024-10-11 12:13:37,381 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 269 transitions. Word has length 139 [2024-10-11 12:13:37,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:13:37,385 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 269 transitions. [2024-10-11 12:13:37,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:13:37,387 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 269 transitions. [2024-10-11 12:13:37,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 12:13:37,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:13:37,392 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:37,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 12:13:37,393 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:13:37,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:13:37,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2012956930, now seen corresponding path program 1 times [2024-10-11 12:13:37,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:13:37,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049929860] [2024-10-11 12:13:37,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:13:37,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:13:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:46,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:13:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:46,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:13:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:46,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:13:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:46,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:13:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:46,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:13:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:46,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:13:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:46,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:13:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:46,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:13:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:46,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:13:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:46,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:13:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:46,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:13:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:46,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:13:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:46,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:13:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:46,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:13:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:46,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:13:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:46,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:13:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:46,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:13:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:46,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:13:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:46,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:13:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:46,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:13:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:46,813 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:13:46,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:13:46,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049929860] [2024-10-11 12:13:46,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049929860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:13:46,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:13:46,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 12:13:46,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588081434] [2024-10-11 12:13:46,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:13:46,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 12:13:46,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:13:46,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 12:13:46,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 12:13:46,816 INFO L87 Difference]: Start difference. First operand 181 states and 269 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:13:47,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:13:47,875 INFO L93 Difference]: Finished difference Result 438 states and 643 transitions. [2024-10-11 12:13:47,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 12:13:47,876 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-10-11 12:13:47,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:13:47,880 INFO L225 Difference]: With dead ends: 438 [2024-10-11 12:13:47,880 INFO L226 Difference]: Without dead ends: 313 [2024-10-11 12:13:47,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2024-10-11 12:13:47,882 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 325 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 12:13:47,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 393 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 12:13:47,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-11 12:13:47,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 201. [2024-10-11 12:13:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 148 states have (on average 1.3716216216216217) internal successors, (203), 149 states have internal predecessors, (203), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 12:13:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 299 transitions. [2024-10-11 12:13:47,906 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 299 transitions. Word has length 139 [2024-10-11 12:13:47,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:13:47,907 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 299 transitions. [2024-10-11 12:13:47,907 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:13:47,907 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 299 transitions. [2024-10-11 12:13:47,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 12:13:47,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:13:47,909 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:47,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 12:13:47,909 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:13:47,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:13:47,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1854617474, now seen corresponding path program 1 times [2024-10-11 12:13:47,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:13:47,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577171954] [2024-10-11 12:13:47,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:13:47,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:13:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:13:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:13:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:13:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:13:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:13:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:13:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:13:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:13:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:13:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:13:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:13:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:13:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:13:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:13:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:13:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:13:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:13:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:13:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:13:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:13:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,187 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:13:48,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:13:48,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577171954] [2024-10-11 12:13:48,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577171954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:13:48,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:13:48,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:13:48,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369419841] [2024-10-11 12:13:48,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:13:48,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:13:48,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:13:48,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:13:48,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:13:48,189 INFO L87 Difference]: Start difference. First operand 201 states and 299 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:13:48,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:13:48,301 INFO L93 Difference]: Finished difference Result 403 states and 598 transitions. [2024-10-11 12:13:48,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:13:48,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-10-11 12:13:48,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:13:48,304 INFO L225 Difference]: With dead ends: 403 [2024-10-11 12:13:48,304 INFO L226 Difference]: Without dead ends: 258 [2024-10-11 12:13:48,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:13:48,306 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 136 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:13:48,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 301 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:13:48,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-11 12:13:48,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 211. [2024-10-11 12:13:48,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 158 states have (on average 1.3734177215189873) internal successors, (217), 159 states have internal predecessors, (217), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 12:13:48,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 313 transitions. [2024-10-11 12:13:48,340 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 313 transitions. Word has length 139 [2024-10-11 12:13:48,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:13:48,341 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 313 transitions. [2024-10-11 12:13:48,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:13:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 313 transitions. [2024-10-11 12:13:48,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 12:13:48,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:13:48,345 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:48,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 12:13:48,346 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:13:48,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:13:48,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1195308480, now seen corresponding path program 1 times [2024-10-11 12:13:48,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:13:48,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619425607] [2024-10-11 12:13:48,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:13:48,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:13:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:13:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:13:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:13:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:13:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:13:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:13:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:13:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:13:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:13:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:13:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:13:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:13:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:13:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:13:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:13:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:13:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:13:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:13:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:13:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:13:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:48,598 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:13:48,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:13:48,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619425607] [2024-10-11 12:13:48,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619425607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:13:48,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:13:48,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:13:48,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764428340] [2024-10-11 12:13:48,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:13:48,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:13:48,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:13:48,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:13:48,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:13:48,603 INFO L87 Difference]: Start difference. First operand 211 states and 313 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:13:48,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:13:48,745 INFO L93 Difference]: Finished difference Result 458 states and 679 transitions. [2024-10-11 12:13:48,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:13:48,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-10-11 12:13:48,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:13:48,749 INFO L225 Difference]: With dead ends: 458 [2024-10-11 12:13:48,749 INFO L226 Difference]: Without dead ends: 306 [2024-10-11 12:13:48,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:13:48,753 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 131 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:13:48,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 366 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:13:48,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-10-11 12:13:48,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 211. [2024-10-11 12:13:48,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 158 states have (on average 1.360759493670886) internal successors, (215), 159 states have internal predecessors, (215), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 12:13:48,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 311 transitions. [2024-10-11 12:13:48,781 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 311 transitions. Word has length 139 [2024-10-11 12:13:48,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:13:48,782 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 311 transitions. [2024-10-11 12:13:48,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:13:48,782 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 311 transitions. [2024-10-11 12:13:48,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 12:13:48,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:13:48,785 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:48,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 12:13:48,786 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:13:48,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:13:48,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1622701372, now seen corresponding path program 1 times [2024-10-11 12:13:48,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:13:48,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92263385] [2024-10-11 12:13:48,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:13:48,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:13:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:49,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:13:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:49,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:13:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:49,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:13:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:49,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:13:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:49,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:13:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:49,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:13:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:49,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:13:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:49,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:13:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:49,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:13:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:49,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:13:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:49,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:13:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:49,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:13:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:49,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:13:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:49,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:13:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:49,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:13:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:49,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:13:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:49,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:13:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:49,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:13:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:49,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:13:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:49,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:13:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:49,123 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:13:49,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:13:49,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92263385] [2024-10-11 12:13:49,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92263385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:13:49,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:13:49,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 12:13:49,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105772960] [2024-10-11 12:13:49,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:13:49,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:13:49,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:13:49,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:13:49,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:13:49,126 INFO L87 Difference]: Start difference. First operand 211 states and 311 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:13:49,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:13:49,391 INFO L93 Difference]: Finished difference Result 441 states and 652 transitions. [2024-10-11 12:13:49,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 12:13:49,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-10-11 12:13:49,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:13:49,397 INFO L225 Difference]: With dead ends: 441 [2024-10-11 12:13:49,398 INFO L226 Difference]: Without dead ends: 289 [2024-10-11 12:13:49,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:13:49,400 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 170 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:13:49,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 486 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:13:49,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-11 12:13:49,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 274. [2024-10-11 12:13:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 199 states have (on average 1.3467336683417086) internal successors, (268), 201 states have internal predecessors, (268), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-11 12:13:49,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 404 transitions. [2024-10-11 12:13:49,431 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 404 transitions. Word has length 139 [2024-10-11 12:13:49,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:13:49,431 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 404 transitions. [2024-10-11 12:13:49,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:13:49,432 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 404 transitions. [2024-10-11 12:13:49,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 12:13:49,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:13:49,434 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:49,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 12:13:49,434 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:13:49,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:13:49,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1971201346, now seen corresponding path program 1 times [2024-10-11 12:13:49,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:13:49,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321426094] [2024-10-11 12:13:49,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:13:49,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:13:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:53,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:13:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:53,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:13:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:53,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:13:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:53,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:13:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:53,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:13:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:53,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:13:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:53,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:13:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:53,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:13:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:53,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:13:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:53,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:13:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:53,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:13:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:53,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:13:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:53,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:13:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:53,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:13:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:53,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:13:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:53,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:13:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:53,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:13:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:53,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:13:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:53,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:13:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:53,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:13:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:53,865 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:13:53,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:13:53,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321426094] [2024-10-11 12:13:53,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321426094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:13:53,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:13:53,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 12:13:53,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201236130] [2024-10-11 12:13:53,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:13:53,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 12:13:53,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:13:53,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 12:13:53,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-11 12:13:53,867 INFO L87 Difference]: Start difference. First operand 274 states and 404 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:13:55,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:13:55,309 INFO L93 Difference]: Finished difference Result 732 states and 1072 transitions. [2024-10-11 12:13:55,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 12:13:55,310 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), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-10-11 12:13:55,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:13:55,313 INFO L225 Difference]: With dead ends: 732 [2024-10-11 12:13:55,313 INFO L226 Difference]: Without dead ends: 517 [2024-10-11 12:13:55,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2024-10-11 12:13:55,315 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 433 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 12:13:55,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 802 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 12:13:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-10-11 12:13:55,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 322. [2024-10-11 12:13:55,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 246 states have (on average 1.3617886178861789) internal successors, (335), 248 states have internal predecessors, (335), 68 states have call successors, (68), 7 states have call predecessors, (68), 7 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-11 12:13:55,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 471 transitions. [2024-10-11 12:13:55,345 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 471 transitions. Word has length 139 [2024-10-11 12:13:55,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:13:55,346 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 471 transitions. [2024-10-11 12:13:55,346 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), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:13:55,347 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 471 transitions. [2024-10-11 12:13:55,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 12:13:55,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:13:55,348 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:55,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 12:13:55,349 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:13:55,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:13:55,349 INFO L85 PathProgramCache]: Analyzing trace with hash -579196991, now seen corresponding path program 1 times [2024-10-11 12:13:55,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:13:55,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805219975] [2024-10-11 12:13:55,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:13:55,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:13:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:55,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:13:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:55,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:13:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:55,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:13:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:55,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:13:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:55,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:13:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:55,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:13:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:55,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:13:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:55,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:13:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:55,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:13:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:55,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:13:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:55,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:13:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:55,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:13:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:55,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:13:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:55,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:13:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:55,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:13:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:55,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:13:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:55,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:13:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:55,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:13:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:55,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:13:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:55,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:13:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:13:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:13:55,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:13:55,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805219975] [2024-10-11 12:13:55,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805219975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:13:55,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:13:55,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:13:55,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722271356] [2024-10-11 12:13:55,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:13:55,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:13:55,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:13:55,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:13:55,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:13:55,486 INFO L87 Difference]: Start difference. First operand 322 states and 471 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:13:55,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:13:55,559 INFO L93 Difference]: Finished difference Result 726 states and 1064 transitions. [2024-10-11 12:13:55,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:13:55,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-10-11 12:13:55,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:13:55,564 INFO L225 Difference]: With dead ends: 726 [2024-10-11 12:13:55,564 INFO L226 Difference]: Without dead ends: 505 [2024-10-11 12:13:55,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:13:55,565 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 55 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:13:55,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 323 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:13:55,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-10-11 12:13:55,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 500. [2024-10-11 12:13:55,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 402 states have (on average 1.3706467661691542) internal successors, (551), 407 states have internal predecessors, (551), 86 states have call successors, (86), 11 states have call predecessors, (86), 11 states have return successors, (86), 81 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-11 12:13:55,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 723 transitions. [2024-10-11 12:13:55,604 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 723 transitions. Word has length 140 [2024-10-11 12:13:55,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:13:55,604 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 723 transitions. [2024-10-11 12:13:55,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:13:55,605 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 723 transitions. [2024-10-11 12:13:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 12:13:55,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:13:55,606 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:55,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 12:13:55,606 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:13:55,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:13:55,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1729999779, now seen corresponding path program 1 times [2024-10-11 12:13:55,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:13:55,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250308321] [2024-10-11 12:13:55,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:13:55,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:13:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:01,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:14:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:01,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:14:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:01,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:14:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:01,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:14:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:01,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:14:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:01,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:14:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:01,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:14:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:01,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:14:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:01,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:14:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:01,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:14:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:01,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:14:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:01,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:14:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:01,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:14:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:01,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:14:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:01,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:14:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:01,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:14:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:01,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:14:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:01,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:14:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:01,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:14:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:01,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:14:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:14:01,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:14:01,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250308321] [2024-10-11 12:14:01,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250308321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:14:01,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:14:01,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 12:14:01,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319296936] [2024-10-11 12:14:01,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:14:01,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 12:14:01,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:14:01,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 12:14:01,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-11 12:14:01,551 INFO L87 Difference]: Start difference. First operand 500 states and 723 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:14:03,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:14:03,493 INFO L93 Difference]: Finished difference Result 1357 states and 1967 transitions. [2024-10-11 12:14:03,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 12:14:03,493 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-10-11 12:14:03,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:14:03,498 INFO L225 Difference]: With dead ends: 1357 [2024-10-11 12:14:03,498 INFO L226 Difference]: Without dead ends: 944 [2024-10-11 12:14:03,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-10-11 12:14:03,500 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 433 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 12:14:03,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 658 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 12:14:03,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2024-10-11 12:14:03,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 644. [2024-10-11 12:14:03,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 545 states have (on average 1.4055045871559633) internal successors, (766), 550 states have internal predecessors, (766), 86 states have call successors, (86), 12 states have call predecessors, (86), 12 states have return successors, (86), 81 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-11 12:14:03,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 938 transitions. [2024-10-11 12:14:03,551 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 938 transitions. Word has length 140 [2024-10-11 12:14:03,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:14:03,552 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 938 transitions. [2024-10-11 12:14:03,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:14:03,552 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 938 transitions. [2024-10-11 12:14:03,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 12:14:03,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:14:03,555 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:14:03,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 12:14:03,555 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:14:03,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:14:03,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1863902939, now seen corresponding path program 1 times [2024-10-11 12:14:03,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:14:03,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998588853] [2024-10-11 12:14:03,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:14:03,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:14:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:04,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:14:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:04,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:14:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:04,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:14:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:04,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:14:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:04,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:14:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:04,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:14:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:04,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:14:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:04,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:14:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:04,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:14:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:04,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:14:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:04,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:14:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:04,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:14:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:04,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:14:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:04,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:14:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:04,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:14:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:04,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:14:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:04,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:14:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:04,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:14:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:04,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:14:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:04,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:14:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:04,622 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:14:04,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:14:04,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998588853] [2024-10-11 12:14:04,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998588853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:14:04,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:14:04,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 12:14:04,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186157979] [2024-10-11 12:14:04,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:14:04,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 12:14:04,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:14:04,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 12:14:04,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 12:14:04,624 INFO L87 Difference]: Start difference. First operand 644 states and 938 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:14:05,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:14:05,733 INFO L93 Difference]: Finished difference Result 1523 states and 2148 transitions. [2024-10-11 12:14:05,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 12:14:05,734 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-10-11 12:14:05,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:14:05,742 INFO L225 Difference]: With dead ends: 1523 [2024-10-11 12:14:05,743 INFO L226 Difference]: Without dead ends: 1144 [2024-10-11 12:14:05,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2024-10-11 12:14:05,745 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 393 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 12:14:05,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1036 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 12:14:05,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2024-10-11 12:14:05,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 814. [2024-10-11 12:14:05,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 703 states have (on average 1.4054054054054055) internal successors, (988), 712 states have internal predecessors, (988), 94 states have call successors, (94), 16 states have call predecessors, (94), 16 states have return successors, (94), 85 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-11 12:14:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1176 transitions. [2024-10-11 12:14:05,817 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1176 transitions. Word has length 140 [2024-10-11 12:14:05,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:14:05,817 INFO L471 AbstractCegarLoop]: Abstraction has 814 states and 1176 transitions. [2024-10-11 12:14:05,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:14:05,818 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1176 transitions. [2024-10-11 12:14:05,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 12:14:05,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:14:05,820 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:14:05,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 12:14:05,820 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:14:05,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:14:05,821 INFO L85 PathProgramCache]: Analyzing trace with hash 484958437, now seen corresponding path program 1 times [2024-10-11 12:14:05,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:14:05,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335126463] [2024-10-11 12:14:05,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:14:05,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:14:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:06,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:14:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:06,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:14:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:06,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:14:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:06,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:14:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:06,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:14:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:06,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:14:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:06,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:14:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:06,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:14:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:06,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:14:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:06,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:14:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:06,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:14:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:06,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:14:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:06,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:14:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:06,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:14:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:06,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:14:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:06,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:14:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:06,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:14:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:06,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:14:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:06,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:14:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:06,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:14:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:06,097 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:14:06,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:14:06,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335126463] [2024-10-11 12:14:06,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335126463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:14:06,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:14:06,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 12:14:06,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033343398] [2024-10-11 12:14:06,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:14:06,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:14:06,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:14:06,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:14:06,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:14:06,100 INFO L87 Difference]: Start difference. First operand 814 states and 1176 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:14:06,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:14:06,287 INFO L93 Difference]: Finished difference Result 1439 states and 2091 transitions. [2024-10-11 12:14:06,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 12:14:06,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-10-11 12:14:06,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:14:06,293 INFO L225 Difference]: With dead ends: 1439 [2024-10-11 12:14:06,294 INFO L226 Difference]: Without dead ends: 1000 [2024-10-11 12:14:06,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:14:06,296 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 163 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:14:06,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 555 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:14:06,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2024-10-11 12:14:06,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 587. [2024-10-11 12:14:06,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 526 states have (on average 1.403041825095057) internal successors, (738), 529 states have internal predecessors, (738), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 12:14:06,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 838 transitions. [2024-10-11 12:14:06,346 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 838 transitions. Word has length 140 [2024-10-11 12:14:06,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:14:06,347 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 838 transitions. [2024-10-11 12:14:06,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:14:06,347 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 838 transitions. [2024-10-11 12:14:06,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 12:14:06,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:14:06,349 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:14:06,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 12:14:06,350 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:14:06,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:14:06,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1186023015, now seen corresponding path program 1 times [2024-10-11 12:14:06,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:14:06,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415217377] [2024-10-11 12:14:06,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:14:06,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:14:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:09,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:14:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:09,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:14:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:09,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:14:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:09,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:14:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:09,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:14:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:09,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:14:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:09,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:14:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:09,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:14:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:09,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:14:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:09,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:14:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:09,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:14:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:09,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:14:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:09,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:14:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:09,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:14:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:09,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:14:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:09,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:14:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:09,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:14:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:09,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:14:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:09,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:14:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:09,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:14:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:09,568 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:14:09,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:14:09,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415217377] [2024-10-11 12:14:09,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415217377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:14:09,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:14:09,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 12:14:09,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906867752] [2024-10-11 12:14:09,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:14:09,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 12:14:09,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:14:09,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 12:14:09,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-11 12:14:09,571 INFO L87 Difference]: Start difference. First operand 587 states and 838 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:14:10,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:14:10,879 INFO L93 Difference]: Finished difference Result 969 states and 1362 transitions. [2024-10-11 12:14:10,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 12:14:10,880 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-10-11 12:14:10,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:14:10,883 INFO L225 Difference]: With dead ends: 969 [2024-10-11 12:14:10,883 INFO L226 Difference]: Without dead ends: 713 [2024-10-11 12:14:10,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2024-10-11 12:14:10,886 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 399 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 12:14:10,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1036 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 12:14:10,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2024-10-11 12:14:10,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 589. [2024-10-11 12:14:10,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 528 states have (on average 1.4053030303030303) internal successors, (742), 531 states have internal predecessors, (742), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 12:14:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 842 transitions. [2024-10-11 12:14:10,934 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 842 transitions. Word has length 140 [2024-10-11 12:14:10,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:14:10,935 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 842 transitions. [2024-10-11 12:14:10,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:14:10,935 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 842 transitions. [2024-10-11 12:14:10,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 12:14:10,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:14:10,938 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:14:10,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 12:14:10,938 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:14:10,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:14:10,939 INFO L85 PathProgramCache]: Analyzing trace with hash 912351329, now seen corresponding path program 1 times [2024-10-11 12:14:10,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:14:10,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162363138] [2024-10-11 12:14:10,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:14:10,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:14:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:11,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:14:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:11,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:14:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:11,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:14:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:11,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:14:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:11,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:14:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:11,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:14:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:11,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:14:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:11,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:14:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:11,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:14:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:11,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:14:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:11,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:14:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:11,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:14:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:11,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:14:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:11,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:14:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:11,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:14:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:11,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:14:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:11,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:14:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:11,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:14:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:11,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:14:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:11,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:14:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:14:11,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:14:11,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162363138] [2024-10-11 12:14:11,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162363138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:14:11,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:14:11,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 12:14:11,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832672479] [2024-10-11 12:14:11,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:14:11,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:14:11,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:14:11,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:14:11,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:14:11,319 INFO L87 Difference]: Start difference. First operand 589 states and 842 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:14:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:14:11,624 INFO L93 Difference]: Finished difference Result 1211 states and 1743 transitions. [2024-10-11 12:14:11,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 12:14:11,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-10-11 12:14:11,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:14:11,629 INFO L225 Difference]: With dead ends: 1211 [2024-10-11 12:14:11,629 INFO L226 Difference]: Without dead ends: 946 [2024-10-11 12:14:11,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:14:11,631 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 236 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:14:11,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 477 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:14:11,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2024-10-11 12:14:11,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 595. [2024-10-11 12:14:11,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 534 states have (on average 1.404494382022472) internal successors, (750), 537 states have internal predecessors, (750), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 12:14:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 850 transitions. [2024-10-11 12:14:11,683 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 850 transitions. Word has length 140 [2024-10-11 12:14:11,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:14:11,683 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 850 transitions. [2024-10-11 12:14:11,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:14:11,684 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 850 transitions. [2024-10-11 12:14:11,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 12:14:11,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:14:11,685 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:14:11,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 12:14:11,686 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:14:11,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:14:11,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1002244263, now seen corresponding path program 1 times [2024-10-11 12:14:11,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:14:11,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551934985] [2024-10-11 12:14:11,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:14:11,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:14:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:14:40,231 WARN L286 SmtUtils]: Spent 11.35s on a formula simplification. DAG size of input: 213 DAG size of output: 200 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)