./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label22.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/Problem17_label22.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 4813005008457a5d4e6ae5277d71ca9796b28c553541eb8e67cfaf33286f04c4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:51:56,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:51:56,120 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:51:56,126 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:51:56,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:51:56,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:51:56,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:51:56,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:51:56,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:51:56,162 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:51:56,162 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:51:56,162 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:51:56,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:51:56,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:51:56,165 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:51:56,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:51:56,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:51:56,166 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:51:56,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:51:56,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:51:56,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:51:56,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:51:56,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:51:56,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:51:56,171 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:51:56,171 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:51:56,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:51:56,171 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:51:56,172 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:51:56,172 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:51:56,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:51:56,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:51:56,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:51:56,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:51:56,173 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:51:56,173 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:51:56,174 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:51:56,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:51:56,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:51:56,174 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:51:56,174 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:51:56,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:51:56,176 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 -> 4813005008457a5d4e6ae5277d71ca9796b28c553541eb8e67cfaf33286f04c4 [2024-11-09 19:51:56,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:51:56,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:51:56,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:51:56,492 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:51:56,492 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:51:56,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label22.c [2024-11-09 19:51:57,905 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:51:58,311 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:51:58,313 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label22.c [2024-11-09 19:51:58,342 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e238624f2/9d8daa9254dd4627b4f5c8cf385d09f8/FLAGf595421ad [2024-11-09 19:51:58,358 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e238624f2/9d8daa9254dd4627b4f5c8cf385d09f8 [2024-11-09 19:51:58,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:51:58,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:51:58,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:51:58,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:51:58,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:51:58,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:51:58" (1/1) ... [2024-11-09 19:51:58,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c399dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:58, skipping insertion in model container [2024-11-09 19:51:58,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:51:58" (1/1) ... [2024-11-09 19:51:58,457 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:51:58,727 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/Problem17_label22.c[7589,7602] [2024-11-09 19:51:59,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:51:59,268 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:51:59,294 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/Problem17_label22.c[7589,7602] [2024-11-09 19:51:59,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:51:59,569 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:51:59,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:59 WrapperNode [2024-11-09 19:51:59,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:51:59,571 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:51:59,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:51:59,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:51:59,578 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:51:59" (1/1) ... [2024-11-09 19:51:59,641 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:51:59" (1/1) ... [2024-11-09 19:51:59,851 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2612 [2024-11-09 19:51:59,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:51:59,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:51:59,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:51:59,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:51:59,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:59" (1/1) ... [2024-11-09 19:51:59,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:59" (1/1) ... [2024-11-09 19:52:00,020 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:59" (1/1) ... [2024-11-09 19:52:00,161 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:52:00,161 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:59" (1/1) ... [2024-11-09 19:52:00,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:59" (1/1) ... [2024-11-09 19:52:00,264 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:59" (1/1) ... [2024-11-09 19:52:00,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:59" (1/1) ... [2024-11-09 19:52:00,301 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:59" (1/1) ... [2024-11-09 19:52:00,319 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:59" (1/1) ... [2024-11-09 19:52:00,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:52:00,360 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:52:00,360 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:52:00,360 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:52:00,361 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:59" (1/1) ... [2024-11-09 19:52:00,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:52:00,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:52:00,403 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:52:00,409 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:52:00,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:52:00,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:52:00,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:52:00,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:52:00,618 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:52:00,620 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:52:04,572 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2024-11-09 19:52:04,871 INFO L? ?]: Removed 949 outVars from TransFormulas that were not future-live. [2024-11-09 19:52:04,871 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:52:04,901 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:52:04,901 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:52:04,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:52:04 BoogieIcfgContainer [2024-11-09 19:52:04,902 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:52:04,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:52:04,906 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:52:04,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:52:04,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:51:58" (1/3) ... [2024-11-09 19:52:04,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0bf894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:52:04, skipping insertion in model container [2024-11-09 19:52:04,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:59" (2/3) ... [2024-11-09 19:52:04,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0bf894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:52:04, skipping insertion in model container [2024-11-09 19:52:04,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:52:04" (3/3) ... [2024-11-09 19:52:04,915 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label22.c [2024-11-09 19:52:04,933 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:52:04,933 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:52:05,035 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:52:05,042 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;@3761b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:52:05,043 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:52:05,050 INFO L276 IsEmpty]: Start isEmpty. Operand has 593 states, 591 states have (on average 2.4077834179357023) internal successors, (1423), 592 states have internal predecessors, (1423), 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:52:05,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 19:52:05,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:52:05,060 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, 1, 1, 1, 1, 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:52:05,060 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:52:05,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:52:05,066 INFO L85 PathProgramCache]: Analyzing trace with hash -290227373, now seen corresponding path program 1 times [2024-11-09 19:52:05,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:52:05,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88755537] [2024-11-09 19:52:05,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:52:05,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:52:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:52:05,434 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:52:05,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:52:05,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88755537] [2024-11-09 19:52:05,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88755537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:52:05,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:52:05,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:52:05,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592832605] [2024-11-09 19:52:05,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:52:05,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:52:05,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:52:05,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:52:05,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:52:05,472 INFO L87 Difference]: Start difference. First operand has 593 states, 591 states have (on average 2.4077834179357023) internal successors, (1423), 592 states have internal predecessors, (1423), 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 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 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:52:08,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:52:08,580 INFO L93 Difference]: Finished difference Result 1673 states and 4141 transitions. [2024-11-09 19:52:08,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:52:08,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 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 53 [2024-11-09 19:52:08,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:52:08,610 INFO L225 Difference]: With dead ends: 1673 [2024-11-09 19:52:08,610 INFO L226 Difference]: Without dead ends: 1001 [2024-11-09 19:52:08,615 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:52:08,618 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 852 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 2282 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 2678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 2282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:52:08,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 279 Invalid, 2678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 2282 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-09 19:52:08,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-11-09 19:52:08,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 985. [2024-11-09 19:52:08,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 984 states have (on average 2.432926829268293) internal successors, (2394), 984 states have internal predecessors, (2394), 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:52:08,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 2394 transitions. [2024-11-09 19:52:08,729 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 2394 transitions. Word has length 53 [2024-11-09 19:52:08,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:52:08,729 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 2394 transitions. [2024-11-09 19:52:08,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 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:52:08,730 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 2394 transitions. [2024-11-09 19:52:08,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 19:52:08,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:52:08,734 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, 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] [2024-11-09 19:52:08,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:52:08,734 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:52:08,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:52:08,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1571389997, now seen corresponding path program 1 times [2024-11-09 19:52:08,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:52:08,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061626180] [2024-11-09 19:52:08,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:52:08,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:52:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:52:08,973 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:52:08,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:52:08,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061626180] [2024-11-09 19:52:08,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061626180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:52:08,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:52:08,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:52:08,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115938773] [2024-11-09 19:52:08,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:52:08,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:52:08,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:52:08,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:52:08,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:52:08,981 INFO L87 Difference]: Start difference. First operand 985 states and 2394 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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:52:11,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:52:11,974 INFO L93 Difference]: Finished difference Result 2848 states and 7038 transitions. [2024-11-09 19:52:11,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:52:11,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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 119 [2024-11-09 19:52:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:52:11,984 INFO L225 Difference]: With dead ends: 2848 [2024-11-09 19:52:11,984 INFO L226 Difference]: Without dead ends: 1865 [2024-11-09 19:52:11,986 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:52:11,988 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 763 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2147 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 2147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:52:11,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 506 Invalid, 2432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 2147 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-09 19:52:11,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2024-11-09 19:52:12,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1859. [2024-11-09 19:52:12,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1858 states have (on average 2.2583423035522068) internal successors, (4196), 1858 states have internal predecessors, (4196), 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:52:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 4196 transitions. [2024-11-09 19:52:12,033 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 4196 transitions. Word has length 119 [2024-11-09 19:52:12,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:52:12,035 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 4196 transitions. [2024-11-09 19:52:12,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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:52:12,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 4196 transitions. [2024-11-09 19:52:12,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 19:52:12,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:52:12,040 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, 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] [2024-11-09 19:52:12,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:52:12,044 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:52:12,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:52:12,045 INFO L85 PathProgramCache]: Analyzing trace with hash -445800789, now seen corresponding path program 1 times [2024-11-09 19:52:12,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:52:12,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91728456] [2024-11-09 19:52:12,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:52:12,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:52:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:52:12,358 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:52:12,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:52:12,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91728456] [2024-11-09 19:52:12,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91728456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:52:12,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:52:12,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:52:12,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424771551] [2024-11-09 19:52:12,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:52:12,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:52:12,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:52:12,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:52:12,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:52:12,363 INFO L87 Difference]: Start difference. First operand 1859 states and 4196 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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:52:14,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:52:14,853 INFO L93 Difference]: Finished difference Result 4150 states and 9270 transitions. [2024-11-09 19:52:14,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:52:14,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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 129 [2024-11-09 19:52:14,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:52:14,864 INFO L225 Difference]: With dead ends: 4150 [2024-11-09 19:52:14,864 INFO L226 Difference]: Without dead ends: 2293 [2024-11-09 19:52:14,867 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:52:14,868 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 719 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 2086 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 2109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:52:14,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 502 Invalid, 2109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2086 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-09 19:52:14,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2024-11-09 19:52:14,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 2289. [2024-11-09 19:52:14,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2289 states, 2288 states have (on average 2.208041958041958) internal successors, (5052), 2288 states have internal predecessors, (5052), 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:52:14,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2289 states to 2289 states and 5052 transitions. [2024-11-09 19:52:14,912 INFO L78 Accepts]: Start accepts. Automaton has 2289 states and 5052 transitions. Word has length 129 [2024-11-09 19:52:14,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:52:14,913 INFO L471 AbstractCegarLoop]: Abstraction has 2289 states and 5052 transitions. [2024-11-09 19:52:14,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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:52:14,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2289 states and 5052 transitions. [2024-11-09 19:52:14,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 19:52:14,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:52:14,915 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, 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] [2024-11-09 19:52:14,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:52:14,916 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:52:14,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:52:14,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1254460815, now seen corresponding path program 1 times [2024-11-09 19:52:14,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:52:14,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277699547] [2024-11-09 19:52:14,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:52:14,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:52:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:52:15,091 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:52:15,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:52:15,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277699547] [2024-11-09 19:52:15,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277699547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:52:15,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:52:15,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:52:15,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699488753] [2024-11-09 19:52:15,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:52:15,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:52:15,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:52:15,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:52:15,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:52:15,093 INFO L87 Difference]: Start difference. First operand 2289 states and 5052 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 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:52:17,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:52:17,754 INFO L93 Difference]: Finished difference Result 6735 states and 14975 transitions. [2024-11-09 19:52:17,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:52:17,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 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 140 [2024-11-09 19:52:17,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:52:17,775 INFO L225 Difference]: With dead ends: 6735 [2024-11-09 19:52:17,776 INFO L226 Difference]: Without dead ends: 4448 [2024-11-09 19:52:17,782 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:52:17,784 INFO L432 NwaCegarLoop]: 521 mSDtfsCounter, 744 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 2109 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 2434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 2109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:52:17,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 596 Invalid, 2434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 2109 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-09 19:52:17,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4448 states. [2024-11-09 19:52:17,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4448 to 4444. [2024-11-09 19:52:17,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4444 states, 4443 states have (on average 2.0722484807562456) internal successors, (9207), 4443 states have internal predecessors, (9207), 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:52:17,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4444 states to 4444 states and 9207 transitions. [2024-11-09 19:52:17,876 INFO L78 Accepts]: Start accepts. Automaton has 4444 states and 9207 transitions. Word has length 140 [2024-11-09 19:52:17,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:52:17,877 INFO L471 AbstractCegarLoop]: Abstraction has 4444 states and 9207 transitions. [2024-11-09 19:52:17,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 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:52:17,878 INFO L276 IsEmpty]: Start isEmpty. Operand 4444 states and 9207 transitions. [2024-11-09 19:52:17,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-09 19:52:17,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:52:17,880 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:52:17,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:52:17,881 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:52:17,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:52:17,882 INFO L85 PathProgramCache]: Analyzing trace with hash -394622186, now seen corresponding path program 1 times [2024-11-09 19:52:17,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:52:17,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256800016] [2024-11-09 19:52:17,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:52:17,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:52:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:52:18,301 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 99 proven. 63 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 19:52:18,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:52:18,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256800016] [2024-11-09 19:52:18,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256800016] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:52:18,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474380756] [2024-11-09 19:52:18,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:52:18,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:52:18,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:52:18,306 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:52:18,309 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:52:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:52:18,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:52:18,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:52:18,587 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-09 19:52:18,588 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:52:18,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474380756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:52:18,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:52:18,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:52:18,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097112624] [2024-11-09 19:52:18,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:52:18,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:52:18,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:52:18,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:52:18,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:52:18,593 INFO L87 Difference]: Start difference. First operand 4444 states and 9207 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:52:20,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:52:20,906 INFO L93 Difference]: Finished difference Result 10612 states and 22356 transitions. [2024-11-09 19:52:20,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:52:20,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 190 [2024-11-09 19:52:20,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:52:20,934 INFO L225 Difference]: With dead ends: 10612 [2024-11-09 19:52:20,934 INFO L226 Difference]: Without dead ends: 6170 [2024-11-09 19:52:20,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:52:20,942 INFO L432 NwaCegarLoop]: 1168 mSDtfsCounter, 813 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 2393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:52:20,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 1238 Invalid, 2393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 19:52:20,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6170 states. [2024-11-09 19:52:21,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6170 to 6168. [2024-11-09 19:52:21,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6168 states, 6167 states have (on average 2.0536727744446246) internal successors, (12665), 6167 states have internal predecessors, (12665), 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:52:21,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6168 states to 6168 states and 12665 transitions. [2024-11-09 19:52:21,068 INFO L78 Accepts]: Start accepts. Automaton has 6168 states and 12665 transitions. Word has length 190 [2024-11-09 19:52:21,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:52:21,070 INFO L471 AbstractCegarLoop]: Abstraction has 6168 states and 12665 transitions. [2024-11-09 19:52:21,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:52:21,070 INFO L276 IsEmpty]: Start isEmpty. Operand 6168 states and 12665 transitions. [2024-11-09 19:52:21,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-09 19:52:21,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:52:21,072 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:52:21,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 19:52:21,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:52:21,274 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:52:21,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:52:21,276 INFO L85 PathProgramCache]: Analyzing trace with hash -337140984, now seen corresponding path program 1 times [2024-11-09 19:52:21,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:52:21,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49322253] [2024-11-09 19:52:21,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:52:21,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:52:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:52:21,545 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 19:52:21,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:52:21,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49322253] [2024-11-09 19:52:21,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49322253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:52:21,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:52:21,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:52:21,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943163672] [2024-11-09 19:52:21,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:52:21,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:52:21,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:52:21,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:52:21,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:52:21,550 INFO L87 Difference]: Start difference. First operand 6168 states and 12665 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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:52:23,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:52:23,880 INFO L93 Difference]: Finished difference Result 17455 states and 36096 transitions. [2024-11-09 19:52:23,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:52:23,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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 196 [2024-11-09 19:52:23,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:52:23,915 INFO L225 Difference]: With dead ends: 17455 [2024-11-09 19:52:23,915 INFO L226 Difference]: Without dead ends: 10007 [2024-11-09 19:52:23,926 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:52:23,927 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 745 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 2345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:52:23,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 591 Invalid, 2345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 19:52:23,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10007 states. [2024-11-09 19:52:24,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10007 to 7443. [2024-11-09 19:52:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7443 states, 7442 states have (on average 1.9700349368449341) internal successors, (14661), 7442 states have internal predecessors, (14661), 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:52:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7443 states to 7443 states and 14661 transitions. [2024-11-09 19:52:24,175 INFO L78 Accepts]: Start accepts. Automaton has 7443 states and 14661 transitions. Word has length 196 [2024-11-09 19:52:24,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:52:24,175 INFO L471 AbstractCegarLoop]: Abstraction has 7443 states and 14661 transitions. [2024-11-09 19:52:24,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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:52:24,176 INFO L276 IsEmpty]: Start isEmpty. Operand 7443 states and 14661 transitions. [2024-11-09 19:52:24,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-09 19:52:24,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:52:24,178 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:52:24,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:52:24,179 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:52:24,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:52:24,180 INFO L85 PathProgramCache]: Analyzing trace with hash -597622479, now seen corresponding path program 1 times [2024-11-09 19:52:24,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:52:24,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927415002] [2024-11-09 19:52:24,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:52:24,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:52:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:52:24,340 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-09 19:52:24,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:52:24,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927415002] [2024-11-09 19:52:24,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927415002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:52:24,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:52:24,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:52:24,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653296514] [2024-11-09 19:52:24,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:52:24,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:52:24,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:52:24,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:52:24,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:52:24,342 INFO L87 Difference]: Start difference. First operand 7443 states and 14661 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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:52:26,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:52:26,553 INFO L93 Difference]: Finished difference Result 19140 states and 37991 transitions. [2024-11-09 19:52:26,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:52:26,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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 209 [2024-11-09 19:52:26,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:52:26,578 INFO L225 Difference]: With dead ends: 19140 [2024-11-09 19:52:26,578 INFO L226 Difference]: Without dead ends: 11698 [2024-11-09 19:52:26,588 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:52:26,588 INFO L432 NwaCegarLoop]: 397 mSDtfsCounter, 753 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1938 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 2212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:52:26,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 461 Invalid, 2212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1938 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 19:52:26,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11698 states. [2024-11-09 19:52:26,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11698 to 7413. [2024-11-09 19:52:26,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7413 states, 7412 states have (on average 1.971937398812736) internal successors, (14616), 7412 states have internal predecessors, (14616), 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:52:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7413 states to 7413 states and 14616 transitions. [2024-11-09 19:52:26,914 INFO L78 Accepts]: Start accepts. Automaton has 7413 states and 14616 transitions. Word has length 209 [2024-11-09 19:52:26,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:52:26,915 INFO L471 AbstractCegarLoop]: Abstraction has 7413 states and 14616 transitions. [2024-11-09 19:52:26,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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:52:26,916 INFO L276 IsEmpty]: Start isEmpty. Operand 7413 states and 14616 transitions. [2024-11-09 19:52:26,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-09 19:52:26,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:52:26,920 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:52:26,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:52:26,922 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:52:26,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:52:26,923 INFO L85 PathProgramCache]: Analyzing trace with hash -116821903, now seen corresponding path program 1 times [2024-11-09 19:52:26,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:52:26,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546233774] [2024-11-09 19:52:26,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:52:26,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:52:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:52:27,245 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-09 19:52:27,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:52:27,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546233774] [2024-11-09 19:52:27,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546233774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:52:27,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:52:27,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:52:27,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387758712] [2024-11-09 19:52:27,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:52:27,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:52:27,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:52:27,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:52:27,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:52:27,248 INFO L87 Difference]: Start difference. First operand 7413 states and 14616 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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:52:29,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:52:29,611 INFO L93 Difference]: Finished difference Result 19089 states and 38051 transitions. [2024-11-09 19:52:29,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:52:29,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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 220 [2024-11-09 19:52:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:52:29,638 INFO L225 Difference]: With dead ends: 19089 [2024-11-09 19:52:29,638 INFO L226 Difference]: Without dead ends: 11678 [2024-11-09 19:52:29,648 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:52:29,649 INFO L432 NwaCegarLoop]: 1076 mSDtfsCounter, 838 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1848 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 2152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 1848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:52:29,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 1131 Invalid, 2152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 1848 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 19:52:29,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11678 states. [2024-11-09 19:52:29,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11678 to 11252. [2024-11-09 19:52:29,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11252 states, 11251 states have (on average 1.9679139632032707) internal successors, (22141), 11251 states have internal predecessors, (22141), 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:52:29,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11252 states to 11252 states and 22141 transitions. [2024-11-09 19:52:29,930 INFO L78 Accepts]: Start accepts. Automaton has 11252 states and 22141 transitions. Word has length 220 [2024-11-09 19:52:29,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:52:29,931 INFO L471 AbstractCegarLoop]: Abstraction has 11252 states and 22141 transitions. [2024-11-09 19:52:29,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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:52:29,931 INFO L276 IsEmpty]: Start isEmpty. Operand 11252 states and 22141 transitions. [2024-11-09 19:52:29,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-11-09 19:52:29,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:52:29,936 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:52:29,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:52:29,936 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:52:29,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:52:29,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1363346436, now seen corresponding path program 1 times [2024-11-09 19:52:29,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:52:29,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133311032] [2024-11-09 19:52:29,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:52:29,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:52:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:52:30,140 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-09 19:52:30,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:52:30,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133311032] [2024-11-09 19:52:30,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133311032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:52:30,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:52:30,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:52:30,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100149886] [2024-11-09 19:52:30,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:52:30,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:52:30,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:52:30,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:52:30,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:52:30,146 INFO L87 Difference]: Start difference. First operand 11252 states and 22141 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:52:32,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:52:32,480 INFO L93 Difference]: Finished difference Result 27176 states and 53805 transitions. [2024-11-09 19:52:32,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:52:32,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 293 [2024-11-09 19:52:32,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:52:32,515 INFO L225 Difference]: With dead ends: 27176 [2024-11-09 19:52:32,515 INFO L226 Difference]: Without dead ends: 14648 [2024-11-09 19:52:32,530 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:52:32,532 INFO L432 NwaCegarLoop]: 1132 mSDtfsCounter, 740 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1911 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:52:32,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 1203 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1911 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 19:52:32,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14648 states. [2024-11-09 19:52:32,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14648 to 14648. [2024-11-09 19:52:32,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14648 states, 14647 states have (on average 1.940055984160579) internal successors, (28416), 14647 states have internal predecessors, (28416), 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:52:32,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14648 states to 14648 states and 28416 transitions. [2024-11-09 19:52:32,835 INFO L78 Accepts]: Start accepts. Automaton has 14648 states and 28416 transitions. Word has length 293 [2024-11-09 19:52:32,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:52:32,835 INFO L471 AbstractCegarLoop]: Abstraction has 14648 states and 28416 transitions. [2024-11-09 19:52:32,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:52:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 14648 states and 28416 transitions. [2024-11-09 19:52:32,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-11-09 19:52:32,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:52:32,842 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-09 19:52:32,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:52:32,842 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:52:32,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:52:32,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1020569726, now seen corresponding path program 1 times [2024-11-09 19:52:32,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:52:32,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920383014] [2024-11-09 19:52:32,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:52:32,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:52:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:52:33,305 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 116 proven. 33 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2024-11-09 19:52:33,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:52:33,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920383014] [2024-11-09 19:52:33,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920383014] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:52:33,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379255249] [2024-11-09 19:52:33,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:52:33,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:52:33,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:52:33,307 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:52:33,308 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:52:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:52:33,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:52:33,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:52:33,567 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2024-11-09 19:52:33,568 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:52:33,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379255249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:52:33,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:52:33,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:52:33,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581147689] [2024-11-09 19:52:33,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:52:33,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:52:33,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:52:33,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:52:33,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:52:33,570 INFO L87 Difference]: Start difference. First operand 14648 states and 28416 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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:52:35,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:52:35,658 INFO L93 Difference]: Finished difference Result 34837 states and 67928 transitions. [2024-11-09 19:52:35,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:52:35,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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 328 [2024-11-09 19:52:35,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:52:35,692 INFO L225 Difference]: With dead ends: 34837 [2024-11-09 19:52:35,692 INFO L226 Difference]: Without dead ends: 20191 [2024-11-09 19:52:35,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:52:35,711 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 806 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1920 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 2197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 1920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:52:35,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 356 Invalid, 2197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 1920 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 19:52:35,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20191 states. [2024-11-09 19:52:35,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20191 to 18482. [2024-11-09 19:52:35,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18482 states, 18481 states have (on average 1.9433472214706997) internal successors, (35915), 18481 states have internal predecessors, (35915), 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:52:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18482 states to 18482 states and 35915 transitions. [2024-11-09 19:52:35,965 INFO L78 Accepts]: Start accepts. Automaton has 18482 states and 35915 transitions. Word has length 328 [2024-11-09 19:52:35,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:52:35,965 INFO L471 AbstractCegarLoop]: Abstraction has 18482 states and 35915 transitions. [2024-11-09 19:52:35,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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:52:35,966 INFO L276 IsEmpty]: Start isEmpty. Operand 18482 states and 35915 transitions. [2024-11-09 19:52:35,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2024-11-09 19:52:35,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:52:35,981 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:35,999 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:52:36,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 19:52:36,182 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:52:36,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:52:36,182 INFO L85 PathProgramCache]: Analyzing trace with hash -2059279533, now seen corresponding path program 1 times [2024-11-09 19:52:36,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:52:36,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706007070] [2024-11-09 19:52:36,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:52:36,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:52:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:52:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-09 19:52:36,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:52:36,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706007070] [2024-11-09 19:52:36,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706007070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:52:36,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:52:36,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:52:36,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871549512] [2024-11-09 19:52:36,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:52:36,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:52:36,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:52:36,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:52:36,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:52:36,872 INFO L87 Difference]: Start difference. First operand 18482 states and 35915 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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:52:39,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:52:39,032 INFO L93 Difference]: Finished difference Result 44651 states and 86951 transitions. [2024-11-09 19:52:39,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:52:39,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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 491 [2024-11-09 19:52:39,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:52:39,075 INFO L225 Difference]: With dead ends: 44651 [2024-11-09 19:52:39,075 INFO L226 Difference]: Without dead ends: 26171 [2024-11-09 19:52:39,095 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:52:39,096 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 835 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1963 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 2326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 1963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:52:39,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 176 Invalid, 2326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 1963 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 19:52:39,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26171 states. [2024-11-09 19:52:39,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26171 to 23598. [2024-11-09 19:52:39,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23598 states, 23597 states have (on average 1.9557994660338178) internal successors, (46151), 23597 states have internal predecessors, (46151), 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:52:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23598 states to 23598 states and 46151 transitions. [2024-11-09 19:52:39,509 INFO L78 Accepts]: Start accepts. Automaton has 23598 states and 46151 transitions. Word has length 491 [2024-11-09 19:52:39,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:52:39,509 INFO L471 AbstractCegarLoop]: Abstraction has 23598 states and 46151 transitions. [2024-11-09 19:52:39,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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:52:39,509 INFO L276 IsEmpty]: Start isEmpty. Operand 23598 states and 46151 transitions. [2024-11-09 19:52:39,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2024-11-09 19:52:39,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:52:39,536 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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:52:39,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:52:39,536 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:52:39,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:52:39,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2027083170, now seen corresponding path program 1 times [2024-11-09 19:52:39,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:52:39,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818438666] [2024-11-09 19:52:39,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:52:39,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:52:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:52:39,859 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2024-11-09 19:52:39,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:52:39,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818438666] [2024-11-09 19:52:39,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818438666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:52:39,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:52:39,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:52:39,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646357549] [2024-11-09 19:52:39,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:52:39,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:52:39,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:52:39,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:52:39,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:52:39,862 INFO L87 Difference]: Start difference. First operand 23598 states and 46151 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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:52:42,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:52:42,100 INFO L93 Difference]: Finished difference Result 55720 states and 109502 transitions. [2024-11-09 19:52:42,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:52:42,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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 580 [2024-11-09 19:52:42,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:52:42,143 INFO L225 Difference]: With dead ends: 55720 [2024-11-09 19:52:42,144 INFO L226 Difference]: Without dead ends: 32124 [2024-11-09 19:52:42,155 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:52:42,155 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 799 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1924 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:52:42,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 359 Invalid, 2198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1924 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 19:52:42,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32124 states. [2024-11-09 19:52:42,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32124 to 29558. [2024-11-09 19:52:42,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29558 states, 29557 states have (on average 1.9570321751192612) internal successors, (57844), 29557 states have internal predecessors, (57844), 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:52:42,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29558 states to 29558 states and 57844 transitions. [2024-11-09 19:52:42,554 INFO L78 Accepts]: Start accepts. Automaton has 29558 states and 57844 transitions. Word has length 580 [2024-11-09 19:52:42,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:52:42,556 INFO L471 AbstractCegarLoop]: Abstraction has 29558 states and 57844 transitions. [2024-11-09 19:52:42,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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:52:42,556 INFO L276 IsEmpty]: Start isEmpty. Operand 29558 states and 57844 transitions. [2024-11-09 19:52:42,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2024-11-09 19:52:42,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:52:42,583 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:42,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:52:42,584 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:52:42,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:52:42,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1719578297, now seen corresponding path program 1 times [2024-11-09 19:52:42,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:52:42,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885843774] [2024-11-09 19:52:42,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:52:42,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:52:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:52:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 320 proven. 83 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-09 19:52:43,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:52:43,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885843774] [2024-11-09 19:52:43,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885843774] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:52:43,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130119532] [2024-11-09 19:52:43,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:52:43,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:52:43,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:52:43,397 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:52:43,398 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:52:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:52:43,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 19:52:43,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:52:44,117 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-09 19:52:44,118 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:52:44,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130119532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:52:44,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:52:44,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2024-11-09 19:52:44,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399200499] [2024-11-09 19:52:44,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:52:44,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:52:44,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:52:44,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:52:44,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:52:44,123 INFO L87 Difference]: Start difference. First operand 29558 states and 57844 transitions. Second operand has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 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:52:48,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:52:48,366 INFO L93 Difference]: Finished difference Result 81346 states and 159241 transitions. [2024-11-09 19:52:48,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:52:48,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 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 615 [2024-11-09 19:52:48,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:52:48,445 INFO L225 Difference]: With dead ends: 81346 [2024-11-09 19:52:48,445 INFO L226 Difference]: Without dead ends: 50081 [2024-11-09 19:52:48,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 613 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:52:48,475 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 1350 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4022 mSolverCounterSat, 635 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 4657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 635 IncrementalHoareTripleChecker+Valid, 4022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:52:48,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 192 Invalid, 4657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [635 Valid, 4022 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-09 19:52:48,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50081 states. [2024-11-09 19:52:48,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50081 to 43219. [2024-11-09 19:52:48,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43219 states, 43218 states have (on average 1.9570086538016567) internal successors, (84578), 43218 states have internal predecessors, (84578), 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:52:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43219 states to 43219 states and 84578 transitions. [2024-11-09 19:52:49,049 INFO L78 Accepts]: Start accepts. Automaton has 43219 states and 84578 transitions. Word has length 615 [2024-11-09 19:52:49,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:52:49,050 INFO L471 AbstractCegarLoop]: Abstraction has 43219 states and 84578 transitions. [2024-11-09 19:52:49,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 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:52:49,050 INFO L276 IsEmpty]: Start isEmpty. Operand 43219 states and 84578 transitions. [2024-11-09 19:52:49,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2024-11-09 19:52:49,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:52:49,078 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:49,096 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:52:49,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:52:49,279 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:52:49,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:52:49,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1626794193, now seen corresponding path program 1 times [2024-11-09 19:52:49,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:52:49,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848829632] [2024-11-09 19:52:49,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:52:49,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:52:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:52:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-11-09 19:52:50,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:52:50,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848829632] [2024-11-09 19:52:50,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848829632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:52:50,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:52:50,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:52:50,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794621327] [2024-11-09 19:52:50,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:52:50,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:52:50,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:52:50,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:52:50,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:52:50,282 INFO L87 Difference]: Start difference. First operand 43219 states and 84578 transitions. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 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:52:52,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:52:52,284 INFO L93 Difference]: Finished difference Result 86430 states and 169148 transitions. [2024-11-09 19:52:52,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:52:52,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 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 623 [2024-11-09 19:52:52,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:52:52,344 INFO L225 Difference]: With dead ends: 86430 [2024-11-09 19:52:52,344 INFO L226 Difference]: Without dead ends: 43212 [2024-11-09 19:52:52,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:52:52,367 INFO L432 NwaCegarLoop]: 912 mSDtfsCounter, 937 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1883 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 1975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:52:52,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 940 Invalid, 1975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1883 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 19:52:52,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43212 states. [2024-11-09 19:52:52,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43212 to 43211. [2024-11-09 19:52:52,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43211 states, 43210 states have (on average 1.9561444110159685) internal successors, (84525), 43210 states have internal predecessors, (84525), 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:52:52,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43211 states to 43211 states and 84525 transitions. [2024-11-09 19:52:52,807 INFO L78 Accepts]: Start accepts. Automaton has 43211 states and 84525 transitions. Word has length 623 [2024-11-09 19:52:52,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:52:52,809 INFO L471 AbstractCegarLoop]: Abstraction has 43211 states and 84525 transitions. [2024-11-09 19:52:52,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 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:52:52,810 INFO L276 IsEmpty]: Start isEmpty. Operand 43211 states and 84525 transitions. [2024-11-09 19:52:52,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2024-11-09 19:52:52,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:52:52,836 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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:52:52,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 19:52:52,836 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:52:52,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:52:52,837 INFO L85 PathProgramCache]: Analyzing trace with hash 550289908, now seen corresponding path program 1 times [2024-11-09 19:52:52,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:52:52,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956610956] [2024-11-09 19:52:52,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:52:52,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:52:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:52:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 827 backedges. 462 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2024-11-09 19:52:53,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:52:53,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956610956] [2024-11-09 19:52:53,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956610956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:52:53,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:52:53,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:52:53,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908792549] [2024-11-09 19:52:53,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:52:53,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:52:53,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:52:53,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:52:53,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:52:53,152 INFO L87 Difference]: Start difference. First operand 43211 states and 84525 transitions. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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:52:55,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:52:55,503 INFO L93 Difference]: Finished difference Result 93668 states and 183452 transitions. [2024-11-09 19:52:55,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:52:55,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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 643 [2024-11-09 19:52:55,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:52:55,568 INFO L225 Difference]: With dead ends: 93668 [2024-11-09 19:52:55,568 INFO L226 Difference]: Without dead ends: 49172 [2024-11-09 19:52:55,597 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:52:55,598 INFO L432 NwaCegarLoop]: 1020 mSDtfsCounter, 861 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 2181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:52:55,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1068 Invalid, 2181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 1912 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 19:52:55,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49172 states. [2024-11-09 19:52:56,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49172 to 48742. [2024-11-09 19:52:56,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48742 states, 48741 states have (on average 1.937342278574506) internal successors, (94428), 48741 states have internal predecessors, (94428), 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:52:56,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48742 states to 48742 states and 94428 transitions. [2024-11-09 19:52:56,458 INFO L78 Accepts]: Start accepts. Automaton has 48742 states and 94428 transitions. Word has length 643 [2024-11-09 19:52:56,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:52:56,459 INFO L471 AbstractCegarLoop]: Abstraction has 48742 states and 94428 transitions. [2024-11-09 19:52:56,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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:52:56,459 INFO L276 IsEmpty]: Start isEmpty. Operand 48742 states and 94428 transitions. [2024-11-09 19:52:56,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2024-11-09 19:52:56,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:52:56,489 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:56,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 19:52:56,490 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:52:56,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:52:56,490 INFO L85 PathProgramCache]: Analyzing trace with hash -745544862, now seen corresponding path program 1 times [2024-11-09 19:52:56,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:52:56,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232178619] [2024-11-09 19:52:56,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:52:56,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:52:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:52:57,127 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 623 trivial. 0 not checked. [2024-11-09 19:52:57,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:52:57,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232178619] [2024-11-09 19:52:57,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232178619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:52:57,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:52:57,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:52:57,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545405270] [2024-11-09 19:52:57,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:52:57,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:52:57,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:52:57,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:52:57,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:52:57,130 INFO L87 Difference]: Start difference. First operand 48742 states and 94428 transitions. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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:52:59,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:52:59,542 INFO L93 Difference]: Finished difference Result 101736 states and 197076 transitions. [2024-11-09 19:52:59,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:52:59,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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 717 [2024-11-09 19:52:59,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:52:59,618 INFO L225 Difference]: With dead ends: 101736 [2024-11-09 19:52:59,618 INFO L226 Difference]: Without dead ends: 51706 [2024-11-09 19:52:59,636 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:52:59,637 INFO L432 NwaCegarLoop]: 1096 mSDtfsCounter, 817 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:52:59,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 1153 Invalid, 2003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1856 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 19:52:59,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51706 states. [2024-11-09 19:53:00,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51706 to 49571. [2024-11-09 19:53:00,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49571 states, 49570 states have (on average 1.9237038531369781) internal successors, (95358), 49570 states have internal predecessors, (95358), 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:53:00,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49571 states to 49571 states and 95358 transitions. [2024-11-09 19:53:00,677 INFO L78 Accepts]: Start accepts. Automaton has 49571 states and 95358 transitions. Word has length 717 [2024-11-09 19:53:00,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:53:00,678 INFO L471 AbstractCegarLoop]: Abstraction has 49571 states and 95358 transitions. [2024-11-09 19:53:00,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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:53:00,679 INFO L276 IsEmpty]: Start isEmpty. Operand 49571 states and 95358 transitions. [2024-11-09 19:53:00,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2024-11-09 19:53:00,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:53:00,705 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:00,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 19:53:00,706 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:53:00,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:53:00,707 INFO L85 PathProgramCache]: Analyzing trace with hash 853457373, now seen corresponding path program 1 times [2024-11-09 19:53:00,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:53:00,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118911815] [2024-11-09 19:53:00,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:53:00,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:53:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:53:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 435 proven. 143 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-09 19:53:02,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:53:02,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118911815] [2024-11-09 19:53:02,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118911815] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:53:02,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804598356] [2024-11-09 19:53:02,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:53:02,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:53:02,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:53:02,317 INFO L229 MonitoredProcess]: Starting monitored process 5 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:53:02,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 19:53:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:53:02,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 19:53:02,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:53:02,985 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 477 proven. 83 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-09 19:53:02,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:53:04,011 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 477 proven. 83 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-09 19:53:04,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804598356] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 19:53:04,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 19:53:04,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2024-11-09 19:53:04,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929270763] [2024-11-09 19:53:04,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 19:53:04,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 19:53:04,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:53:04,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 19:53:04,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 19:53:04,014 INFO L87 Difference]: Start difference. First operand 49571 states and 95358 transitions. Second operand has 9 states, 9 states have (on average 132.44444444444446) internal successors, (1192), 8 states have internal predecessors, (1192), 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)