./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label06.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label06.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b8e390e3329fd730c72061af7f4f756de3cffbc4334952b16b06779e5db77927 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:24:48,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:24:48,533 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:24:48,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:24:48,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:24:48,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:24:48,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:24:48,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:24:48,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:24:48,567 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:24:48,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:24:48,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:24:48,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:24:48,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:24:48,569 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:24:48,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:24:48,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:24:48,570 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:24:48,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:24:48,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:24:48,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:24:48,572 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:24:48,572 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:24:48,572 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:24:48,573 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:24:48,573 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:24:48,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:24:48,574 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:24:48,574 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:24:48,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:24:48,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:24:48,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:24:48,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:24:48,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:24:48,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:24:48,576 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:24:48,577 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:24:48,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:24:48,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:24:48,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:24:48,577 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:24:48,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:24:48,578 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b8e390e3329fd730c72061af7f4f756de3cffbc4334952b16b06779e5db77927 [2024-11-09 19:24:48,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:24:48,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:24:48,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:24:48,889 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:24:48,890 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:24:48,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label06.c [2024-11-09 19:24:50,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:24:50,667 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:24:50,669 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label06.c [2024-11-09 19:24:50,706 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d9df7623/1e4e394cc8da42f3b84abeadfcb14113/FLAG4a17483d7 [2024-11-09 19:24:50,837 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d9df7623/1e4e394cc8da42f3b84abeadfcb14113 [2024-11-09 19:24:50,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:24:50,841 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:24:50,843 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:24:50,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:24:50,850 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:24:50,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:24:50" (1/1) ... [2024-11-09 19:24:50,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@566e8f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:50, skipping insertion in model container [2024-11-09 19:24:50,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:24:50" (1/1) ... [2024-11-09 19:24:50,952 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:24:51,224 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label06.c[3178,3191] [2024-11-09 19:24:51,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:24:51,933 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:24:51,955 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label06.c[3178,3191] [2024-11-09 19:24:52,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:24:52,410 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:24:52,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:52 WrapperNode [2024-11-09 19:24:52,411 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:24:52,412 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:24:52,412 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:24:52,412 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:24:52,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:52" (1/1) ... [2024-11-09 19:24:52,472 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:52" (1/1) ... [2024-11-09 19:24:52,705 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4760 [2024-11-09 19:24:52,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:24:52,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:24:52,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:24:52,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:24:52,716 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:52" (1/1) ... [2024-11-09 19:24:52,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:52" (1/1) ... [2024-11-09 19:24:52,845 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:52" (1/1) ... [2024-11-09 19:24:52,982 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 19:24:52,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:52" (1/1) ... [2024-11-09 19:24:52,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:52" (1/1) ... [2024-11-09 19:24:53,086 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:52" (1/1) ... [2024-11-09 19:24:53,102 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:52" (1/1) ... [2024-11-09 19:24:53,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:52" (1/1) ... [2024-11-09 19:24:53,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:52" (1/1) ... [2024-11-09 19:24:53,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:24:53,220 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:24:53,220 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:24:53,221 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:24:53,222 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:52" (1/1) ... [2024-11-09 19:24:53,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:24:53,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:24:53,258 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 19:24:53,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 19:24:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:24:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:24:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:24:53,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:24:53,439 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:24:53,441 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:24:58,773 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2024-11-09 19:24:58,773 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2024-11-09 19:24:58,774 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2024-11-09 19:24:59,063 INFO L? ?]: Removed 2039 outVars from TransFormulas that were not future-live. [2024-11-09 19:24:59,063 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:24:59,106 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:24:59,106 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:24:59,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:24:59 BoogieIcfgContainer [2024-11-09 19:24:59,107 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:24:59,110 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:24:59,110 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:24:59,113 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:24:59,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:24:50" (1/3) ... [2024-11-09 19:24:59,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff808ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:24:59, skipping insertion in model container [2024-11-09 19:24:59,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:52" (2/3) ... [2024-11-09 19:24:59,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff808ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:24:59, skipping insertion in model container [2024-11-09 19:24:59,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:24:59" (3/3) ... [2024-11-09 19:24:59,115 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label06.c [2024-11-09 19:24:59,132 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:24:59,133 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:24:59,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:24:59,241 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;@650edaa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:24:59,241 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:24:59,254 INFO L276 IsEmpty]: Start isEmpty. Operand has 821 states, 819 states have (on average 2.744810744810745) internal successors, (2248), 820 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:24:59,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 19:24:59,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:59,262 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:24:59,262 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:59,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:59,268 INFO L85 PathProgramCache]: Analyzing trace with hash -201180030, now seen corresponding path program 1 times [2024-11-09 19:24:59,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:59,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637536480] [2024-11-09 19:24:59,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:59,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:59,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:24:59,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:59,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637536480] [2024-11-09 19:24:59,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637536480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:59,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:59,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:24:59,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211525648] [2024-11-09 19:24:59,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:59,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:24:59,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:59,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:24:59,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:59,641 INFO L87 Difference]: Start difference. First operand has 821 states, 819 states have (on average 2.744810744810745) internal successors, (2248), 820 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:04,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:25:04,395 INFO L93 Difference]: Finished difference Result 2410 states and 6691 transitions. [2024-11-09 19:25:04,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:25:04,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 19:25:04,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:25:04,423 INFO L225 Difference]: With dead ends: 2410 [2024-11-09 19:25:04,423 INFO L226 Difference]: Without dead ends: 1509 [2024-11-09 19:25:04,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:25:04,437 INFO L432 NwaCegarLoop]: 517 mSDtfsCounter, 1477 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3697 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 4393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 3697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:25:04,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1477 Valid, 529 Invalid, 4393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 3697 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-09 19:25:04,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2024-11-09 19:25:04,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1509. [2024-11-09 19:25:04,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1508 states have (on average 2.5072944297082227) internal successors, (3781), 1508 states have internal predecessors, (3781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:04,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 3781 transitions. [2024-11-09 19:25:04,553 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 3781 transitions. Word has length 25 [2024-11-09 19:25:04,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:25:04,555 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 3781 transitions. [2024-11-09 19:25:04,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:04,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 3781 transitions. [2024-11-09 19:25:04,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 19:25:04,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:25:04,559 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:25:04,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:25:04,561 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:25:04,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:25:04,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1621832365, now seen corresponding path program 1 times [2024-11-09 19:25:04,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:25:04,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738291854] [2024-11-09 19:25:04,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:04,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:25:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:25:05,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:25:05,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738291854] [2024-11-09 19:25:05,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738291854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:25:05,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:25:05,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:25:05,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137832121] [2024-11-09 19:25:05,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:25:05,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 19:25:05,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:25:05,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 19:25:05,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:25:05,152 INFO L87 Difference]: Start difference. First operand 1509 states and 3781 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:09,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:25:09,895 INFO L93 Difference]: Finished difference Result 3768 states and 9220 transitions. [2024-11-09 19:25:09,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:25:09,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-11-09 19:25:09,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:25:09,905 INFO L225 Difference]: With dead ends: 3768 [2024-11-09 19:25:09,905 INFO L226 Difference]: Without dead ends: 2261 [2024-11-09 19:25:09,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-11-09 19:25:09,908 INFO L432 NwaCegarLoop]: 693 mSDtfsCounter, 2938 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 5192 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2938 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 5413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 5192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:25:09,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2938 Valid, 1175 Invalid, 5413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 5192 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-09 19:25:09,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2024-11-09 19:25:09,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2261. [2024-11-09 19:25:09,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 2260 states have (on average 2.3092920353982302) internal successors, (5219), 2260 states have internal predecessors, (5219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 5219 transitions. [2024-11-09 19:25:09,953 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 5219 transitions. Word has length 101 [2024-11-09 19:25:09,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:25:09,955 INFO L471 AbstractCegarLoop]: Abstraction has 2261 states and 5219 transitions. [2024-11-09 19:25:09,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:09,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 5219 transitions. [2024-11-09 19:25:09,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-09 19:25:09,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:25:09,959 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:25:09,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:25:09,960 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:25:09,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:25:09,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1782315175, now seen corresponding path program 1 times [2024-11-09 19:25:09,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:25:09,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106819425] [2024-11-09 19:25:09,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:09,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:25:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:10,435 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:25:10,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:25:10,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106819425] [2024-11-09 19:25:10,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106819425] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:25:10,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911403027] [2024-11-09 19:25:10,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:10,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:25:10,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:25:10,439 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:25:10,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 19:25:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:10,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:25:10,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:25:10,807 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 19:25:10,807 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:25:10,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911403027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:25:10,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:25:10,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-09 19:25:10,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986813375] [2024-11-09 19:25:10,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:25:10,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:25:10,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:25:10,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:25:10,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:25:10,810 INFO L87 Difference]: Start difference. First operand 2261 states and 5219 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:14,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:25:14,495 INFO L93 Difference]: Finished difference Result 5272 states and 12775 transitions. [2024-11-09 19:25:14,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:25:14,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2024-11-09 19:25:14,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:25:14,515 INFO L225 Difference]: With dead ends: 5272 [2024-11-09 19:25:14,515 INFO L226 Difference]: Without dead ends: 3765 [2024-11-09 19:25:14,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:25:14,521 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 1380 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3827 mSolverCounterSat, 639 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 4466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 639 IncrementalHoareTripleChecker+Valid, 3827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:25:14,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 305 Invalid, 4466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [639 Valid, 3827 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 19:25:14,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3765 states. [2024-11-09 19:25:14,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3765 to 3765. [2024-11-09 19:25:14,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3765 states, 3764 states have (on average 2.3546758767268865) internal successors, (8863), 3764 states have internal predecessors, (8863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3765 states to 3765 states and 8863 transitions. [2024-11-09 19:25:14,595 INFO L78 Accepts]: Start accepts. Automaton has 3765 states and 8863 transitions. Word has length 167 [2024-11-09 19:25:14,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:25:14,598 INFO L471 AbstractCegarLoop]: Abstraction has 3765 states and 8863 transitions. [2024-11-09 19:25:14,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:14,599 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 8863 transitions. [2024-11-09 19:25:14,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-09 19:25:14,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:25:14,604 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:25:14,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 19:25:14,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:25:14,806 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:25:14,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:25:14,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1760837602, now seen corresponding path program 1 times [2024-11-09 19:25:14,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:25:14,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734292941] [2024-11-09 19:25:14,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:14,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:25:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:15,103 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:25:15,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:25:15,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734292941] [2024-11-09 19:25:15,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734292941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:25:15,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:25:15,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:25:15,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858216332] [2024-11-09 19:25:15,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:25:15,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:25:15,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:25:15,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:25:15,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:25:15,106 INFO L87 Difference]: Start difference. First operand 3765 states and 8863 transitions. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:19,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:25:19,521 INFO L93 Difference]: Finished difference Result 8318 states and 19608 transitions. [2024-11-09 19:25:19,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:25:19,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 175 [2024-11-09 19:25:19,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:25:19,543 INFO L225 Difference]: With dead ends: 8318 [2024-11-09 19:25:19,543 INFO L226 Difference]: Without dead ends: 5269 [2024-11-09 19:25:19,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11-09 19:25:19,549 INFO L432 NwaCegarLoop]: 697 mSDtfsCounter, 1368 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 5844 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 6051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 5844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:25:19,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 719 Invalid, 6051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 5844 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-09 19:25:19,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5269 states. [2024-11-09 19:25:19,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5269 to 4517. [2024-11-09 19:25:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4517 states, 4516 states have (on average 2.2779007971656333) internal successors, (10287), 4516 states have internal predecessors, (10287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4517 states to 4517 states and 10287 transitions. [2024-11-09 19:25:19,639 INFO L78 Accepts]: Start accepts. Automaton has 4517 states and 10287 transitions. Word has length 175 [2024-11-09 19:25:19,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:25:19,639 INFO L471 AbstractCegarLoop]: Abstraction has 4517 states and 10287 transitions. [2024-11-09 19:25:19,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand 4517 states and 10287 transitions. [2024-11-09 19:25:19,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-09 19:25:19,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:25:19,642 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:25:19,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:25:19,643 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:25:19,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:25:19,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1747460328, now seen corresponding path program 1 times [2024-11-09 19:25:19,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:25:19,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473103571] [2024-11-09 19:25:19,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:19,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:25:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 43 proven. 55 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 19:25:20,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:25:20,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473103571] [2024-11-09 19:25:20,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473103571] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:25:20,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409305580] [2024-11-09 19:25:20,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:20,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:25:20,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:25:20,146 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:25:20,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 19:25:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:20,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:25:20,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:25:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 19:25:20,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:25:20,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409305580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:25:20,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:25:20,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-09 19:25:20,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931674128] [2024-11-09 19:25:20,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:25:20,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:25:20,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:25:20,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:25:20,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:25:20,577 INFO L87 Difference]: Start difference. First operand 4517 states and 10287 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:24,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:25:24,025 INFO L93 Difference]: Finished difference Result 10536 states and 24255 transitions. [2024-11-09 19:25:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:25:24,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 237 [2024-11-09 19:25:24,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:25:24,054 INFO L225 Difference]: With dead ends: 10536 [2024-11-09 19:25:24,054 INFO L226 Difference]: Without dead ends: 6773 [2024-11-09 19:25:24,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:25:24,062 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 1378 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3333 mSolverCounterSat, 798 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 4131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 798 IncrementalHoareTripleChecker+Valid, 3333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:25:24,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 430 Invalid, 4131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [798 Valid, 3333 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 19:25:24,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2024-11-09 19:25:24,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 6773. [2024-11-09 19:25:24,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6773 states, 6772 states have (on average 2.100708800945068) internal successors, (14226), 6772 states have internal predecessors, (14226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:24,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6773 states to 6773 states and 14226 transitions. [2024-11-09 19:25:24,278 INFO L78 Accepts]: Start accepts. Automaton has 6773 states and 14226 transitions. Word has length 237 [2024-11-09 19:25:24,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:25:24,278 INFO L471 AbstractCegarLoop]: Abstraction has 6773 states and 14226 transitions. [2024-11-09 19:25:24,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:24,279 INFO L276 IsEmpty]: Start isEmpty. Operand 6773 states and 14226 transitions. [2024-11-09 19:25:24,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-09 19:25:24,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:25:24,283 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:25:24,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 19:25:24,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:25:24,485 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:25:24,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:25:24,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1334505118, now seen corresponding path program 1 times [2024-11-09 19:25:24,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:25:24,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469408499] [2024-11-09 19:25:24,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:24,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:25:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-09 19:25:24,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:25:24,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469408499] [2024-11-09 19:25:24,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469408499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:25:24,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:25:24,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:25:24,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391016656] [2024-11-09 19:25:24,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:25:24,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:25:24,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:25:24,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:25:24,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:25:24,690 INFO L87 Difference]: Start difference. First operand 6773 states and 14226 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:28,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:25:28,261 INFO L93 Difference]: Finished difference Result 15048 states and 32238 transitions. [2024-11-09 19:25:28,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:25:28,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 239 [2024-11-09 19:25:28,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:25:28,283 INFO L225 Difference]: With dead ends: 15048 [2024-11-09 19:25:28,284 INFO L226 Difference]: Without dead ends: 9029 [2024-11-09 19:25:28,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:25:28,297 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 1448 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3571 mSolverCounterSat, 626 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1448 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 4197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 626 IncrementalHoareTripleChecker+Valid, 3571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:25:28,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1448 Valid, 487 Invalid, 4197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [626 Valid, 3571 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 19:25:28,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9029 states. [2024-11-09 19:25:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9029 to 6773. [2024-11-09 19:25:28,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6773 states, 6772 states have (on average 2.100708800945068) internal successors, (14226), 6772 states have internal predecessors, (14226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6773 states to 6773 states and 14226 transitions. [2024-11-09 19:25:28,527 INFO L78 Accepts]: Start accepts. Automaton has 6773 states and 14226 transitions. Word has length 239 [2024-11-09 19:25:28,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:25:28,527 INFO L471 AbstractCegarLoop]: Abstraction has 6773 states and 14226 transitions. [2024-11-09 19:25:28,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:28,528 INFO L276 IsEmpty]: Start isEmpty. Operand 6773 states and 14226 transitions. [2024-11-09 19:25:28,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-09 19:25:28,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:25:28,531 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:25:28,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:25:28,531 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:25:28,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:25:28,532 INFO L85 PathProgramCache]: Analyzing trace with hash 238229870, now seen corresponding path program 1 times [2024-11-09 19:25:28,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:25:28,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754211594] [2024-11-09 19:25:28,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:28,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:25:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-09 19:25:28,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:25:28,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754211594] [2024-11-09 19:25:28,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754211594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:25:28,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:25:28,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:25:28,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2688830] [2024-11-09 19:25:28,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:25:28,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:25:28,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:25:28,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:25:28,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:25:28,728 INFO L87 Difference]: Start difference. First operand 6773 states and 14226 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:32,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:25:32,411 INFO L93 Difference]: Finished difference Result 17307 states and 36845 transitions. [2024-11-09 19:25:32,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:25:32,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 240 [2024-11-09 19:25:32,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:25:32,439 INFO L225 Difference]: With dead ends: 17307 [2024-11-09 19:25:32,439 INFO L226 Difference]: Without dead ends: 11288 [2024-11-09 19:25:32,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:25:32,450 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 1529 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3669 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1529 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 4135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 3669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:25:32,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1529 Valid, 317 Invalid, 4135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 3669 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 19:25:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11288 states. [2024-11-09 19:25:32,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11288 to 10533. [2024-11-09 19:25:32,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10533 states, 10532 states have (on average 2.0842195214584125) internal successors, (21951), 10532 states have internal predecessors, (21951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10533 states to 10533 states and 21951 transitions. [2024-11-09 19:25:32,715 INFO L78 Accepts]: Start accepts. Automaton has 10533 states and 21951 transitions. Word has length 240 [2024-11-09 19:25:32,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:25:32,716 INFO L471 AbstractCegarLoop]: Abstraction has 10533 states and 21951 transitions. [2024-11-09 19:25:32,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:32,717 INFO L276 IsEmpty]: Start isEmpty. Operand 10533 states and 21951 transitions. [2024-11-09 19:25:32,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-11-09 19:25:32,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:25:32,722 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:25:32,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:25:32,722 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:25:32,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:25:32,723 INFO L85 PathProgramCache]: Analyzing trace with hash 916646855, now seen corresponding path program 1 times [2024-11-09 19:25:32,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:25:32,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821096846] [2024-11-09 19:25:32,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:32,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:25:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:32,915 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 19:25:32,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:25:32,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821096846] [2024-11-09 19:25:32,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821096846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:25:32,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:25:32,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:25:32,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110041556] [2024-11-09 19:25:32,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:25:32,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:25:32,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:25:32,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:25:32,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:25:32,918 INFO L87 Difference]: Start difference. First operand 10533 states and 21951 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:25:36,831 INFO L93 Difference]: Finished difference Result 30088 states and 62973 transitions. [2024-11-09 19:25:36,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:25:36,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 323 [2024-11-09 19:25:36,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:25:36,872 INFO L225 Difference]: With dead ends: 30088 [2024-11-09 19:25:36,872 INFO L226 Difference]: Without dead ends: 20309 [2024-11-09 19:25:36,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:25:36,885 INFO L432 NwaCegarLoop]: 2066 mSDtfsCounter, 1347 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 4099 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1347 SdHoareTripleChecker+Valid, 2076 SdHoareTripleChecker+Invalid, 4464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 4099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:25:36,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1347 Valid, 2076 Invalid, 4464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 4099 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-09 19:25:36,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20309 states. [2024-11-09 19:25:37,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20309 to 18053. [2024-11-09 19:25:37,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18053 states, 18052 states have (on average 2.080046532240195) internal successors, (37549), 18052 states have internal predecessors, (37549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:37,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18053 states to 18053 states and 37549 transitions. [2024-11-09 19:25:37,252 INFO L78 Accepts]: Start accepts. Automaton has 18053 states and 37549 transitions. Word has length 323 [2024-11-09 19:25:37,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:25:37,252 INFO L471 AbstractCegarLoop]: Abstraction has 18053 states and 37549 transitions. [2024-11-09 19:25:37,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:37,253 INFO L276 IsEmpty]: Start isEmpty. Operand 18053 states and 37549 transitions. [2024-11-09 19:25:37,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-11-09 19:25:37,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:25:37,259 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:25:37,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:25:37,260 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:25:37,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:25:37,260 INFO L85 PathProgramCache]: Analyzing trace with hash 8764499, now seen corresponding path program 1 times [2024-11-09 19:25:37,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:25:37,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560546478] [2024-11-09 19:25:37,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:37,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:25:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-09 19:25:37,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:25:37,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560546478] [2024-11-09 19:25:37,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560546478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:25:37,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:25:37,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:25:37,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300065908] [2024-11-09 19:25:37,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:25:37,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:25:37,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:25:37,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:25:37,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:25:37,587 INFO L87 Difference]: Start difference. First operand 18053 states and 37549 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:41,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:25:41,353 INFO L93 Difference]: Finished difference Result 43624 states and 91658 transitions. [2024-11-09 19:25:41,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:25:41,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 327 [2024-11-09 19:25:41,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:25:41,394 INFO L225 Difference]: With dead ends: 43624 [2024-11-09 19:25:41,394 INFO L226 Difference]: Without dead ends: 26325 [2024-11-09 19:25:41,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:25:41,413 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 1411 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3608 mSolverCounterSat, 712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1411 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 4320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 712 IncrementalHoareTripleChecker+Valid, 3608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:25:41,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1411 Valid, 407 Invalid, 4320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [712 Valid, 3608 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 19:25:41,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26325 states. [2024-11-09 19:25:41,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26325 to 25573. [2024-11-09 19:25:41,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25573 states, 25572 states have (on average 2.0800484905365244) internal successors, (53191), 25572 states have internal predecessors, (53191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:41,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25573 states to 25573 states and 53191 transitions. [2024-11-09 19:25:41,746 INFO L78 Accepts]: Start accepts. Automaton has 25573 states and 53191 transitions. Word has length 327 [2024-11-09 19:25:41,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:25:41,747 INFO L471 AbstractCegarLoop]: Abstraction has 25573 states and 53191 transitions. [2024-11-09 19:25:41,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:41,748 INFO L276 IsEmpty]: Start isEmpty. Operand 25573 states and 53191 transitions. [2024-11-09 19:25:41,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-11-09 19:25:41,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:25:41,755 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:25:41,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:25:41,755 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:25:41,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:25:41,756 INFO L85 PathProgramCache]: Analyzing trace with hash -458546009, now seen corresponding path program 1 times [2024-11-09 19:25:41,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:25:41,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340738290] [2024-11-09 19:25:41,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:41,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:25:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 65 proven. 110 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-11-09 19:25:42,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:25:42,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340738290] [2024-11-09 19:25:42,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340738290] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:25:42,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376660314] [2024-11-09 19:25:42,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:42,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:25:42,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:25:42,166 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:25:42,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 19:25:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:42,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:25:42,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:25:42,397 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-09 19:25:42,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:25:42,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376660314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:25:42,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:25:42,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-09 19:25:42,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488343986] [2024-11-09 19:25:42,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:25:42,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:25:42,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:25:42,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:25:42,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:25:42,400 INFO L87 Difference]: Start difference. First operand 25573 states and 53191 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:45,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:25:45,947 INFO L93 Difference]: Finished difference Result 60920 states and 128105 transitions. [2024-11-09 19:25:45,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:25:45,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 355 [2024-11-09 19:25:45,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:25:45,988 INFO L225 Difference]: With dead ends: 60920 [2024-11-09 19:25:45,988 INFO L226 Difference]: Without dead ends: 36101 [2024-11-09 19:25:46,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:25:46,009 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 1473 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3435 mSolverCounterSat, 834 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 4269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 834 IncrementalHoareTripleChecker+Valid, 3435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:25:46,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 241 Invalid, 4269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [834 Valid, 3435 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 19:25:46,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36101 states. [2024-11-09 19:25:46,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36101 to 36101. [2024-11-09 19:25:46,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36101 states, 36100 states have (on average 2.0714127423822717) internal successors, (74778), 36100 states have internal predecessors, (74778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36101 states to 36101 states and 74778 transitions. [2024-11-09 19:25:46,708 INFO L78 Accepts]: Start accepts. Automaton has 36101 states and 74778 transitions. Word has length 355 [2024-11-09 19:25:46,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:25:46,708 INFO L471 AbstractCegarLoop]: Abstraction has 36101 states and 74778 transitions. [2024-11-09 19:25:46,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:46,708 INFO L276 IsEmpty]: Start isEmpty. Operand 36101 states and 74778 transitions. [2024-11-09 19:25:46,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-11-09 19:25:46,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:25:46,714 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:25:46,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 19:25:46,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:25:46,915 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:25:46,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:25:46,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1209400499, now seen corresponding path program 1 times [2024-11-09 19:25:46,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:25:46,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984265344] [2024-11-09 19:25:46,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:46,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:25:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:47,483 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-09 19:25:47,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:25:47,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984265344] [2024-11-09 19:25:47,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984265344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:25:47,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:25:47,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:25:47,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106124210] [2024-11-09 19:25:47,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:25:47,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:25:47,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:25:47,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:25:47,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:25:47,487 INFO L87 Difference]: Start difference. First operand 36101 states and 74778 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:51,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:25:51,348 INFO L93 Difference]: Finished difference Result 104536 states and 217078 transitions. [2024-11-09 19:25:51,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:25:51,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 359 [2024-11-09 19:25:51,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:25:51,428 INFO L225 Difference]: With dead ends: 104536 [2024-11-09 19:25:51,429 INFO L226 Difference]: Without dead ends: 65429 [2024-11-09 19:25:51,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:25:51,456 INFO L432 NwaCegarLoop]: 1990 mSDtfsCounter, 1450 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3594 mSolverCounterSat, 620 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 4214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 620 IncrementalHoareTripleChecker+Valid, 3594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:25:51,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1450 Valid, 2000 Invalid, 4214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [620 Valid, 3594 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 19:25:51,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65429 states. [2024-11-09 19:25:52,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65429 to 62421. [2024-11-09 19:25:52,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62421 states, 62420 states have (on average 2.0283242550464595) internal successors, (126608), 62420 states have internal predecessors, (126608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:52,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62421 states to 62421 states and 126608 transitions. [2024-11-09 19:25:52,724 INFO L78 Accepts]: Start accepts. Automaton has 62421 states and 126608 transitions. Word has length 359 [2024-11-09 19:25:52,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:25:52,729 INFO L471 AbstractCegarLoop]: Abstraction has 62421 states and 126608 transitions. [2024-11-09 19:25:52,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:52,729 INFO L276 IsEmpty]: Start isEmpty. Operand 62421 states and 126608 transitions. [2024-11-09 19:25:52,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2024-11-09 19:25:52,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:25:52,743 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:25:52,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:25:52,747 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:25:52,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:25:52,748 INFO L85 PathProgramCache]: Analyzing trace with hash 701203963, now seen corresponding path program 1 times [2024-11-09 19:25:52,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:25:52,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537002878] [2024-11-09 19:25:52,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:52,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:25:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:53,197 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-09 19:25:53,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:25:53,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537002878] [2024-11-09 19:25:53,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537002878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:25:53,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:25:53,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:25:53,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747017126] [2024-11-09 19:25:53,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:25:53,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:25:53,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:25:53,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:25:53,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:25:53,200 INFO L87 Difference]: Start difference. First operand 62421 states and 126608 transitions. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:57,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:25:57,150 INFO L93 Difference]: Finished difference Result 141384 states and 288597 transitions. [2024-11-09 19:25:57,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:25:57,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 383 [2024-11-09 19:25:57,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:25:57,274 INFO L225 Difference]: With dead ends: 141384 [2024-11-09 19:25:57,274 INFO L226 Difference]: Without dead ends: 79717 [2024-11-09 19:25:57,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:25:57,444 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 1460 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3529 mSolverCounterSat, 850 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1460 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 4379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 850 IncrementalHoareTripleChecker+Valid, 3529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:25:57,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1460 Valid, 108 Invalid, 4379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [850 Valid, 3529 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-09 19:25:57,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79717 states. [2024-11-09 19:25:58,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79717 to 79717. [2024-11-09 19:25:58,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79717 states, 79716 states have (on average 2.0384615384615383) internal successors, (162498), 79716 states have internal predecessors, (162498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:58,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79717 states to 79717 states and 162498 transitions. [2024-11-09 19:25:58,771 INFO L78 Accepts]: Start accepts. Automaton has 79717 states and 162498 transitions. Word has length 383 [2024-11-09 19:25:58,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:25:58,771 INFO L471 AbstractCegarLoop]: Abstraction has 79717 states and 162498 transitions. [2024-11-09 19:25:58,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:25:58,771 INFO L276 IsEmpty]: Start isEmpty. Operand 79717 states and 162498 transitions. [2024-11-09 19:25:58,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2024-11-09 19:25:58,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:25:58,784 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:25:58,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:25:58,785 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:25:58,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:25:58,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1045448825, now seen corresponding path program 1 times [2024-11-09 19:25:58,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:25:58,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685642320] [2024-11-09 19:25:58,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:58,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:25:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:59,170 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-09 19:25:59,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:25:59,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685642320] [2024-11-09 19:25:59,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685642320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:25:59,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:25:59,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:25:59,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689549239] [2024-11-09 19:25:59,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:25:59,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:25:59,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:25:59,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:25:59,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:25:59,176 INFO L87 Difference]: Start difference. First operand 79717 states and 162498 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:26:03,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:26:03,522 INFO L93 Difference]: Finished difference Result 194024 states and 396795 transitions. [2024-11-09 19:26:03,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:26:03,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 387 [2024-11-09 19:26:03,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:26:03,735 INFO L225 Difference]: With dead ends: 194024 [2024-11-09 19:26:03,735 INFO L226 Difference]: Without dead ends: 115061 [2024-11-09 19:26:03,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:26:03,785 INFO L432 NwaCegarLoop]: 1856 mSDtfsCounter, 1428 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3749 mSolverCounterSat, 568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1428 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 4317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 568 IncrementalHoareTripleChecker+Valid, 3749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:26:03,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1428 Valid, 1866 Invalid, 4317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [568 Valid, 3749 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 19:26:03,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115061 states. [2024-11-09 19:26:05,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115061 to 112805. [2024-11-09 19:26:05,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112805 states, 112804 states have (on average 2.0344757278110706) internal successors, (229497), 112804 states have internal predecessors, (229497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:26:05,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112805 states to 112805 states and 229497 transitions. [2024-11-09 19:26:05,851 INFO L78 Accepts]: Start accepts. Automaton has 112805 states and 229497 transitions. Word has length 387 [2024-11-09 19:26:05,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:26:05,854 INFO L471 AbstractCegarLoop]: Abstraction has 112805 states and 229497 transitions. [2024-11-09 19:26:05,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:26:05,855 INFO L276 IsEmpty]: Start isEmpty. Operand 112805 states and 229497 transitions. [2024-11-09 19:26:05,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2024-11-09 19:26:05,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:26:05,875 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:26:05,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 19:26:05,876 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:26:05,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:26:05,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1020050755, now seen corresponding path program 1 times [2024-11-09 19:26:05,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:26:05,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128457757] [2024-11-09 19:26:05,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:26:05,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:26:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:26:06,227 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-11-09 19:26:06,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:26:06,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128457757] [2024-11-09 19:26:06,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128457757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:26:06,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:26:06,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:26:06,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779346587] [2024-11-09 19:26:06,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:26:06,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:26:06,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:26:06,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:26:06,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:26:06,229 INFO L87 Difference]: Start difference. First operand 112805 states and 229497 transitions. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)