./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label09.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/Problem01_label09.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 ffdda078a4af5cadd809285deda853e717921f28c9c08179af4d863a439eed59 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 18:36:04,378 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 18:36:04,443 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 18:36:04,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 18:36:04,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 18:36:04,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 18:36:04,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 18:36:04,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 18:36:04,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 18:36:04,496 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 18:36:04,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 18:36:04,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 18:36:04,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 18:36:04,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 18:36:04,499 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 18:36:04,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 18:36:04,501 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 18:36:04,502 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 18:36:04,502 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 18:36:04,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 18:36:04,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 18:36:04,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 18:36:04,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 18:36:04,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 18:36:04,508 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 18:36:04,508 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 18:36:04,509 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 18:36:04,509 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 18:36:04,509 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 18:36:04,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 18:36:04,523 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 18:36:04,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 18:36:04,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:36:04,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 18:36:04,524 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 18:36:04,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 18:36:04,525 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 18:36:04,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 18:36:04,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 18:36:04,525 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 18:36:04,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 18:36:04,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 18:36:04,528 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 -> ffdda078a4af5cadd809285deda853e717921f28c9c08179af4d863a439eed59 [2024-11-09 18:36:04,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:36:04,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:36:04,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:36:04,811 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:36:04,811 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:36:04,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label09.c [2024-11-09 18:36:06,306 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:36:06,570 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:36:06,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label09.c [2024-11-09 18:36:06,599 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d419c118/4b5a58b6782c4cdea2f076330a6ae7d0/FLAGf9f525a4e [2024-11-09 18:36:06,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d419c118/4b5a58b6782c4cdea2f076330a6ae7d0 [2024-11-09 18:36:06,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:36:06,623 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:36:06,626 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:36:06,626 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:36:06,631 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:36:06,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:36:06" (1/1) ... [2024-11-09 18:36:06,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2821fe8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:06, skipping insertion in model container [2024-11-09 18:36:06,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:36:06" (1/1) ... [2024-11-09 18:36:06,693 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:36:07,036 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/Problem01_label09.c[20223,20236] [2024-11-09 18:36:07,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:36:07,085 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:36:07,171 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/Problem01_label09.c[20223,20236] [2024-11-09 18:36:07,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:36:07,211 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:36:07,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:07 WrapperNode [2024-11-09 18:36:07,212 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:36:07,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:36:07,215 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:36:07,215 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:36:07,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:07" (1/1) ... [2024-11-09 18:36:07,247 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:07" (1/1) ... [2024-11-09 18:36:07,301 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-09 18:36:07,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:36:07,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:36:07,302 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:36:07,302 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:36:07,314 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:07" (1/1) ... [2024-11-09 18:36:07,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:07" (1/1) ... [2024-11-09 18:36:07,318 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:07" (1/1) ... [2024-11-09 18:36:07,348 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 18:36:07,352 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:07" (1/1) ... [2024-11-09 18:36:07,352 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:07" (1/1) ... [2024-11-09 18:36:07,382 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:07" (1/1) ... [2024-11-09 18:36:07,384 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:07" (1/1) ... [2024-11-09 18:36:07,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:07" (1/1) ... [2024-11-09 18:36:07,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:07" (1/1) ... [2024-11-09 18:36:07,404 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:36:07,406 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:36:07,406 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:36:07,406 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:36:07,407 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:07" (1/1) ... [2024-11-09 18:36:07,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:36:07,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:36:07,444 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 18:36:07,452 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 18:36:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:36:07,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 18:36:07,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:36:07,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:36:07,586 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:36:07,589 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:36:08,634 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-09 18:36:08,634 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:36:08,661 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:36:08,662 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 18:36:08,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:36:08 BoogieIcfgContainer [2024-11-09 18:36:08,663 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:36:08,665 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:36:08,666 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:36:08,670 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:36:08,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:36:06" (1/3) ... [2024-11-09 18:36:08,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e1c14e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:36:08, skipping insertion in model container [2024-11-09 18:36:08,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:07" (2/3) ... [2024-11-09 18:36:08,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e1c14e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:36:08, skipping insertion in model container [2024-11-09 18:36:08,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:36:08" (3/3) ... [2024-11-09 18:36:08,674 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label09.c [2024-11-09 18:36:08,696 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:36:08,697 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:36:08,768 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:36:08,777 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;@4f4d9115, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:36:08,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:36:08,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 199 states have (on average 1.6582914572864322) internal successors, (330), 200 states have internal predecessors, (330), 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 18:36:08,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 18:36:08,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:08,802 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:36:08,803 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:08,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:08,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1902046770, now seen corresponding path program 1 times [2024-11-09 18:36:08,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:08,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124002014] [2024-11-09 18:36:08,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:08,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:09,346 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 18:36:09,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:09,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124002014] [2024-11-09 18:36:09,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124002014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:09,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:09,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:36:09,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709965246] [2024-11-09 18:36:09,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:09,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:09,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:09,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:09,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:09,394 INFO L87 Difference]: Start difference. First operand has 201 states, 199 states have (on average 1.6582914572864322) internal successors, (330), 200 states have internal predecessors, (330), 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 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 18:36:10,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:10,183 INFO L93 Difference]: Finished difference Result 534 states and 921 transitions. [2024-11-09 18:36:10,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:10,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 120 [2024-11-09 18:36:10,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:10,198 INFO L225 Difference]: With dead ends: 534 [2024-11-09 18:36:10,198 INFO L226 Difference]: Without dead ends: 269 [2024-11-09 18:36:10,202 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 18:36:10,205 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 67 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:10,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 70 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 18:36:10,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-09 18:36:10,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-09 18:36:10,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 1.4291044776119404) internal successors, (383), 268 states have internal predecessors, (383), 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 18:36:10,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 383 transitions. [2024-11-09 18:36:10,261 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 383 transitions. Word has length 120 [2024-11-09 18:36:10,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:10,262 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 383 transitions. [2024-11-09 18:36:10,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 18:36:10,263 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 383 transitions. [2024-11-09 18:36:10,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 18:36:10,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:10,267 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 18:36:10,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 18:36:10,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:10,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:10,271 INFO L85 PathProgramCache]: Analyzing trace with hash -959979000, now seen corresponding path program 1 times [2024-11-09 18:36:10,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:10,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136691448] [2024-11-09 18:36:10,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:10,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:10,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:36:10,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:10,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136691448] [2024-11-09 18:36:10,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136691448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:10,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:10,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:36:10,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721594410] [2024-11-09 18:36:10,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:10,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:10,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:10,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:10,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:10,415 INFO L87 Difference]: Start difference. First operand 269 states and 383 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 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 18:36:10,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:10,839 INFO L93 Difference]: Finished difference Result 800 states and 1143 transitions. [2024-11-09 18:36:10,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:10,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 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 126 [2024-11-09 18:36:10,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:10,843 INFO L225 Difference]: With dead ends: 800 [2024-11-09 18:36:10,843 INFO L226 Difference]: Without dead ends: 533 [2024-11-09 18:36:10,844 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 18:36:10,845 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 173 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:10,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 32 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:36:10,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-09 18:36:10,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2024-11-09 18:36:10,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 532 states have (on average 1.3646616541353382) internal successors, (726), 532 states have internal predecessors, (726), 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 18:36:10,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 726 transitions. [2024-11-09 18:36:10,874 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 726 transitions. Word has length 126 [2024-11-09 18:36:10,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:10,874 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 726 transitions. [2024-11-09 18:36:10,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 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 18:36:10,875 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 726 transitions. [2024-11-09 18:36:10,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 18:36:10,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:10,879 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 18:36:10,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 18:36:10,879 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:10,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:10,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1481156222, now seen corresponding path program 1 times [2024-11-09 18:36:10,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:10,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531460453] [2024-11-09 18:36:10,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:10,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:36:11,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:11,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531460453] [2024-11-09 18:36:11,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531460453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:11,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:11,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:36:11,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413234175] [2024-11-09 18:36:11,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:11,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:11,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:11,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:11,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:11,031 INFO L87 Difference]: Start difference. First operand 533 states and 726 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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 18:36:11,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:11,418 INFO L93 Difference]: Finished difference Result 1460 states and 1973 transitions. [2024-11-09 18:36:11,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:11,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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 130 [2024-11-09 18:36:11,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:11,425 INFO L225 Difference]: With dead ends: 1460 [2024-11-09 18:36:11,425 INFO L226 Difference]: Without dead ends: 929 [2024-11-09 18:36:11,427 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 18:36:11,429 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 137 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:11,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 42 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:36:11,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2024-11-09 18:36:11,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 929. [2024-11-09 18:36:11,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 928 states have (on average 1.2661637931034482) internal successors, (1175), 928 states have internal predecessors, (1175), 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 18:36:11,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1175 transitions. [2024-11-09 18:36:11,467 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1175 transitions. Word has length 130 [2024-11-09 18:36:11,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:11,468 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1175 transitions. [2024-11-09 18:36:11,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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 18:36:11,470 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1175 transitions. [2024-11-09 18:36:11,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 18:36:11,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:11,474 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-09 18:36:11,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 18:36:11,475 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:11,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:11,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1210421335, now seen corresponding path program 1 times [2024-11-09 18:36:11,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:11,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036405125] [2024-11-09 18:36:11,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:11,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:11,643 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:36:11,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:11,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036405125] [2024-11-09 18:36:11,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036405125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:11,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:11,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:36:11,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774978318] [2024-11-09 18:36:11,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:11,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:11,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:11,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:11,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:11,646 INFO L87 Difference]: Start difference. First operand 929 states and 1175 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 18:36:12,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:12,077 INFO L93 Difference]: Finished difference Result 2516 states and 3171 transitions. [2024-11-09 18:36:12,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:12,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 135 [2024-11-09 18:36:12,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:12,084 INFO L225 Difference]: With dead ends: 2516 [2024-11-09 18:36:12,084 INFO L226 Difference]: Without dead ends: 1589 [2024-11-09 18:36:12,086 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 18:36:12,087 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 137 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:12,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 33 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:36:12,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2024-11-09 18:36:12,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1193. [2024-11-09 18:36:12,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 1192 states have (on average 1.2583892617449663) internal successors, (1500), 1192 states have internal predecessors, (1500), 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 18:36:12,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1500 transitions. [2024-11-09 18:36:12,126 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1500 transitions. Word has length 135 [2024-11-09 18:36:12,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:12,128 INFO L471 AbstractCegarLoop]: Abstraction has 1193 states and 1500 transitions. [2024-11-09 18:36:12,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 18:36:12,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1500 transitions. [2024-11-09 18:36:12,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 18:36:12,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:12,132 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-09 18:36:12,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 18:36:12,133 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:12,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:12,134 INFO L85 PathProgramCache]: Analyzing trace with hash -225374541, now seen corresponding path program 1 times [2024-11-09 18:36:12,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:12,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447802209] [2024-11-09 18:36:12,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:12,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:36:12,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:12,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447802209] [2024-11-09 18:36:12,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447802209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:12,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:12,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:36:12,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983922939] [2024-11-09 18:36:12,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:12,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:12,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:12,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:12,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:12,335 INFO L87 Difference]: Start difference. First operand 1193 states and 1500 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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 18:36:12,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:12,695 INFO L93 Difference]: Finished difference Result 2384 states and 2998 transitions. [2024-11-09 18:36:12,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:12,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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 138 [2024-11-09 18:36:12,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:12,700 INFO L225 Difference]: With dead ends: 2384 [2024-11-09 18:36:12,700 INFO L226 Difference]: Without dead ends: 1193 [2024-11-09 18:36:12,702 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 18:36:12,704 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 132 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:12,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 66 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:36:12,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-11-09 18:36:12,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1193. [2024-11-09 18:36:12,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 1192 states have (on average 1.2483221476510067) internal successors, (1488), 1192 states have internal predecessors, (1488), 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 18:36:12,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1488 transitions. [2024-11-09 18:36:12,733 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1488 transitions. Word has length 138 [2024-11-09 18:36:12,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:12,734 INFO L471 AbstractCegarLoop]: Abstraction has 1193 states and 1488 transitions. [2024-11-09 18:36:12,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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 18:36:12,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1488 transitions. [2024-11-09 18:36:12,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 18:36:12,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:12,738 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2024-11-09 18:36:12,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 18:36:12,739 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:12,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:12,739 INFO L85 PathProgramCache]: Analyzing trace with hash -741835554, now seen corresponding path program 1 times [2024-11-09 18:36:12,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:12,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074220937] [2024-11-09 18:36:12,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:12,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:12,945 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:36:12,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:12,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074220937] [2024-11-09 18:36:12,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074220937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:12,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:12,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:36:12,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495998593] [2024-11-09 18:36:12,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:12,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:36:12,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:12,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:36:12,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:36:12,949 INFO L87 Difference]: Start difference. First operand 1193 states and 1488 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 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 18:36:13,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:13,512 INFO L93 Difference]: Finished difference Result 2516 states and 3118 transitions. [2024-11-09 18:36:13,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:36:13,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 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 143 [2024-11-09 18:36:13,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:13,518 INFO L225 Difference]: With dead ends: 2516 [2024-11-09 18:36:13,518 INFO L226 Difference]: Without dead ends: 1325 [2024-11-09 18:36:13,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:36:13,520 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 388 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:13,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 52 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 18:36:13,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2024-11-09 18:36:13,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1193. [2024-11-09 18:36:13,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 1192 states have (on average 1.238255033557047) internal successors, (1476), 1192 states have internal predecessors, (1476), 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 18:36:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1476 transitions. [2024-11-09 18:36:13,546 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1476 transitions. Word has length 143 [2024-11-09 18:36:13,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:13,546 INFO L471 AbstractCegarLoop]: Abstraction has 1193 states and 1476 transitions. [2024-11-09 18:36:13,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 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 18:36:13,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1476 transitions. [2024-11-09 18:36:13,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-09 18:36:13,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:13,550 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:36:13,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 18:36:13,550 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:13,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:13,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1342092084, now seen corresponding path program 1 times [2024-11-09 18:36:13,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:13,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872010462] [2024-11-09 18:36:13,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:13,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:13,770 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:36:13,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:13,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872010462] [2024-11-09 18:36:13,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872010462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:13,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:13,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:36:13,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954025726] [2024-11-09 18:36:13,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:13,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:13,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:13,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:13,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:13,773 INFO L87 Difference]: Start difference. First operand 1193 states and 1476 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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 18:36:14,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:14,139 INFO L93 Difference]: Finished difference Result 2384 states and 2950 transitions. [2024-11-09 18:36:14,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:14,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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 150 [2024-11-09 18:36:14,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:14,145 INFO L225 Difference]: With dead ends: 2384 [2024-11-09 18:36:14,145 INFO L226 Difference]: Without dead ends: 1193 [2024-11-09 18:36:14,147 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 18:36:14,148 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 108 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:14,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 66 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:36:14,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-11-09 18:36:14,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1193. [2024-11-09 18:36:14,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 1192 states have (on average 1.2231543624161074) internal successors, (1458), 1192 states have internal predecessors, (1458), 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 18:36:14,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1458 transitions. [2024-11-09 18:36:14,170 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1458 transitions. Word has length 150 [2024-11-09 18:36:14,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:14,170 INFO L471 AbstractCegarLoop]: Abstraction has 1193 states and 1458 transitions. [2024-11-09 18:36:14,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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 18:36:14,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1458 transitions. [2024-11-09 18:36:14,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 18:36:14,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:14,173 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:36:14,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 18:36:14,173 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:14,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:14,174 INFO L85 PathProgramCache]: Analyzing trace with hash -746204553, now seen corresponding path program 1 times [2024-11-09 18:36:14,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:14,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602967532] [2024-11-09 18:36:14,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:14,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:14,415 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:36:14,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:14,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602967532] [2024-11-09 18:36:14,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602967532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:14,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:14,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:36:14,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163096101] [2024-11-09 18:36:14,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:14,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:36:14,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:14,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:36:14,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:36:14,419 INFO L87 Difference]: Start difference. First operand 1193 states and 1458 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 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 18:36:15,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:15,018 INFO L93 Difference]: Finished difference Result 2780 states and 3358 transitions. [2024-11-09 18:36:15,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:36:15,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 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 155 [2024-11-09 18:36:15,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:15,026 INFO L225 Difference]: With dead ends: 2780 [2024-11-09 18:36:15,026 INFO L226 Difference]: Without dead ends: 1589 [2024-11-09 18:36:15,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:36:15,030 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 245 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:15,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 66 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 18:36:15,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2024-11-09 18:36:15,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1457. [2024-11-09 18:36:15,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 1456 states have (on average 1.1991758241758241) internal successors, (1746), 1456 states have internal predecessors, (1746), 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 18:36:15,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 1746 transitions. [2024-11-09 18:36:15,062 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 1746 transitions. Word has length 155 [2024-11-09 18:36:15,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:15,062 INFO L471 AbstractCegarLoop]: Abstraction has 1457 states and 1746 transitions. [2024-11-09 18:36:15,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 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 18:36:15,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1746 transitions. [2024-11-09 18:36:15,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-09 18:36:15,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:15,066 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:36:15,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 18:36:15,066 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:15,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:15,067 INFO L85 PathProgramCache]: Analyzing trace with hash 2074061605, now seen corresponding path program 1 times [2024-11-09 18:36:15,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:15,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87911904] [2024-11-09 18:36:15,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:15,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:15,651 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 8 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:36:15,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:15,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87911904] [2024-11-09 18:36:15,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87911904] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:36:15,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606110874] [2024-11-09 18:36:15,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:15,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:36:15,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:36:15,655 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 18:36:15,658 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 18:36:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:15,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 18:36:15,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:36:16,042 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 18:36:16,042 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:36:16,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606110874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:16,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:36:16,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-09 18:36:16,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491961871] [2024-11-09 18:36:16,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:16,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:16,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:16,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:16,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:36:16,045 INFO L87 Difference]: Start difference. First operand 1457 states and 1746 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 18:36:16,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:16,419 INFO L93 Difference]: Finished difference Result 2384 states and 2836 transitions. [2024-11-09 18:36:16,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:16,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 172 [2024-11-09 18:36:16,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:16,428 INFO L225 Difference]: With dead ends: 2384 [2024-11-09 18:36:16,428 INFO L226 Difference]: Without dead ends: 2381 [2024-11-09 18:36:16,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:36:16,432 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 36 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:16,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 35 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:36:16,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2024-11-09 18:36:16,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 2381. [2024-11-09 18:36:16,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2381 states, 2380 states have (on average 1.1899159663865546) internal successors, (2832), 2380 states have internal predecessors, (2832), 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 18:36:16,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 2832 transitions. [2024-11-09 18:36:16,501 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 2832 transitions. Word has length 172 [2024-11-09 18:36:16,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:16,502 INFO L471 AbstractCegarLoop]: Abstraction has 2381 states and 2832 transitions. [2024-11-09 18:36:16,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 18:36:16,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 2832 transitions. [2024-11-09 18:36:16,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-09 18:36:16,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:16,509 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:36:16,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 18:36:16,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:36:16,710 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:16,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:16,711 INFO L85 PathProgramCache]: Analyzing trace with hash 859879194, now seen corresponding path program 1 times [2024-11-09 18:36:16,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:16,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4328359] [2024-11-09 18:36:16,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:16,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:16,874 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-09 18:36:16,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:16,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4328359] [2024-11-09 18:36:16,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4328359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:16,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:16,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:36:16,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830363126] [2024-11-09 18:36:16,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:16,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:16,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:16,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:16,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:16,878 INFO L87 Difference]: Start difference. First operand 2381 states and 2832 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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 18:36:17,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:17,281 INFO L93 Difference]: Finished difference Result 5288 states and 6299 transitions. [2024-11-09 18:36:17,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:17,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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 180 [2024-11-09 18:36:17,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:17,291 INFO L225 Difference]: With dead ends: 5288 [2024-11-09 18:36:17,292 INFO L226 Difference]: Without dead ends: 2513 [2024-11-09 18:36:17,295 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 18:36:17,296 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 137 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:17,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 196 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:36:17,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2024-11-09 18:36:17,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2381. [2024-11-09 18:36:17,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2381 states, 2380 states have (on average 1.0970588235294119) internal successors, (2611), 2380 states have internal predecessors, (2611), 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 18:36:17,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 2611 transitions. [2024-11-09 18:36:17,343 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 2611 transitions. Word has length 180 [2024-11-09 18:36:17,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:17,343 INFO L471 AbstractCegarLoop]: Abstraction has 2381 states and 2611 transitions. [2024-11-09 18:36:17,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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 18:36:17,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 2611 transitions. [2024-11-09 18:36:17,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-09 18:36:17,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:17,349 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:36:17,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 18:36:17,349 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:17,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:17,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1902059303, now seen corresponding path program 1 times [2024-11-09 18:36:17,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:17,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412290164] [2024-11-09 18:36:17,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:17,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 100 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 18:36:17,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:17,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412290164] [2024-11-09 18:36:17,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412290164] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:36:17,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756490507] [2024-11-09 18:36:17,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:17,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:36:17,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:36:17,860 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 18:36:17,862 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 18:36:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:17,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 18:36:17,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:36:18,165 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-09 18:36:18,165 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:36:18,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756490507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:18,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:36:18,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-09 18:36:18,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378939693] [2024-11-09 18:36:18,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:18,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:18,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:18,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:18,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:36:18,168 INFO L87 Difference]: Start difference. First operand 2381 states and 2611 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 18:36:18,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:18,519 INFO L93 Difference]: Finished difference Result 3044 states and 3343 transitions. [2024-11-09 18:36:18,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:18,519 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 201 [2024-11-09 18:36:18,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:18,529 INFO L225 Difference]: With dead ends: 3044 [2024-11-09 18:36:18,530 INFO L226 Difference]: Without dead ends: 3041 [2024-11-09 18:36:18,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:36:18,532 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 38 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:18,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 34 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:36:18,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3041 states. [2024-11-09 18:36:18,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3041 to 2513. [2024-11-09 18:36:18,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2513 states, 2512 states have (on average 1.101512738853503) internal successors, (2767), 2512 states have internal predecessors, (2767), 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 18:36:18,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 2767 transitions. [2024-11-09 18:36:18,584 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 2767 transitions. Word has length 201 [2024-11-09 18:36:18,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:18,584 INFO L471 AbstractCegarLoop]: Abstraction has 2513 states and 2767 transitions. [2024-11-09 18:36:18,585 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 18:36:18,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 2767 transitions. [2024-11-09 18:36:18,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-09 18:36:18,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:18,591 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 18:36:18,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 18:36:18,794 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,SelfDestructingSolverStorable10 [2024-11-09 18:36:18,795 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:18,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:18,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1686868609, now seen corresponding path program 1 times [2024-11-09 18:36:18,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:18,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436005864] [2024-11-09 18:36:18,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:18,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:19,336 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 129 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:36:19,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:19,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436005864] [2024-11-09 18:36:19,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436005864] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:36:19,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812307543] [2024-11-09 18:36:19,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:19,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:36:19,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:36:19,357 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 18:36:19,358 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 18:36:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:19,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 18:36:19,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:36:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 18:36:19,631 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:36:19,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812307543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:19,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:36:19,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-09 18:36:19,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107168285] [2024-11-09 18:36:19,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:19,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:19,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:19,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:19,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:36:19,633 INFO L87 Difference]: Start difference. First operand 2513 states and 2767 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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 18:36:19,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:19,957 INFO L93 Difference]: Finished difference Result 2516 states and 2769 transitions. [2024-11-09 18:36:19,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:19,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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 242 [2024-11-09 18:36:19,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:19,966 INFO L225 Difference]: With dead ends: 2516 [2024-11-09 18:36:19,966 INFO L226 Difference]: Without dead ends: 2513 [2024-11-09 18:36:19,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:36:19,968 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 38 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:19,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 34 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:36:19,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2024-11-09 18:36:19,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2381. [2024-11-09 18:36:19,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2381 states, 2380 states have (on average 1.096218487394958) internal successors, (2609), 2380 states have internal predecessors, (2609), 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 18:36:20,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 2609 transitions. [2024-11-09 18:36:20,041 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 2609 transitions. Word has length 242 [2024-11-09 18:36:20,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:20,042 INFO L471 AbstractCegarLoop]: Abstraction has 2381 states and 2609 transitions. [2024-11-09 18:36:20,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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 18:36:20,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 2609 transitions. [2024-11-09 18:36:20,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-09 18:36:20,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:20,050 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2024-11-09 18:36:20,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 18:36:20,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:36:20,255 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:20,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:20,256 INFO L85 PathProgramCache]: Analyzing trace with hash 419274865, now seen corresponding path program 1 times [2024-11-09 18:36:20,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:20,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752211670] [2024-11-09 18:36:20,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:20,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:20,990 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 163 proven. 16 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-09 18:36:20,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:20,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752211670] [2024-11-09 18:36:20,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752211670] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:36:20,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570030025] [2024-11-09 18:36:20,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:20,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:36:20,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:36:20,992 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 18:36:20,994 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 18:36:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:21,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 18:36:21,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:36:21,267 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2024-11-09 18:36:21,267 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:36:21,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570030025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:21,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:36:21,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-09 18:36:21,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344396270] [2024-11-09 18:36:21,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:21,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:21,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:21,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:21,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:36:21,271 INFO L87 Difference]: Start difference. First operand 2381 states and 2609 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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 18:36:21,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:21,678 INFO L93 Difference]: Finished difference Result 5549 states and 6096 transitions. [2024-11-09 18:36:21,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:21,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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 256 [2024-11-09 18:36:21,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:21,680 INFO L225 Difference]: With dead ends: 5549 [2024-11-09 18:36:21,680 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 18:36:21,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:36:21,685 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 16 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:21,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 182 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:36:21,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 18:36:21,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 18:36:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 18:36:21,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 18:36:21,686 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 256 [2024-11-09 18:36:21,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:21,687 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 18:36:21,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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 18:36:21,687 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 18:36:21,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 18:36:21,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 18:36:21,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 18:36:21,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:36:21,896 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:36:21,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 18:36:22,161 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 18:36:22,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:36:22 BoogieIcfgContainer [2024-11-09 18:36:22,173 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 18:36:22,173 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 18:36:22,173 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 18:36:22,174 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 18:36:22,174 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:36:08" (3/4) ... [2024-11-09 18:36:22,176 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 18:36:22,202 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 18:36:22,205 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 18:36:22,206 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 18:36:22,206 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 18:36:22,371 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 18:36:22,371 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 18:36:22,372 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 18:36:22,372 INFO L158 Benchmark]: Toolchain (without parser) took 15748.88ms. Allocated memory was 174.1MB in the beginning and 419.4MB in the end (delta: 245.4MB). Free memory was 116.1MB in the beginning and 146.9MB in the end (delta: -30.8MB). Peak memory consumption was 215.3MB. Max. memory is 16.1GB. [2024-11-09 18:36:22,372 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 174.1MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:36:22,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 588.05ms. Allocated memory is still 174.1MB. Free memory was 116.1MB in the beginning and 85.9MB in the end (delta: 30.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-09 18:36:22,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.03ms. Allocated memory is still 174.1MB. Free memory was 85.9MB in the beginning and 80.0MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 18:36:22,373 INFO L158 Benchmark]: Boogie Preprocessor took 102.77ms. Allocated memory is still 174.1MB. Free memory was 80.0MB in the beginning and 75.4MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 18:36:22,373 INFO L158 Benchmark]: IcfgBuilder took 1257.47ms. Allocated memory was 174.1MB in the beginning and 241.2MB in the end (delta: 67.1MB). Free memory was 75.4MB in the beginning and 150.4MB in the end (delta: -74.9MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. [2024-11-09 18:36:22,374 INFO L158 Benchmark]: TraceAbstraction took 13507.27ms. Allocated memory was 241.2MB in the beginning and 419.4MB in the end (delta: 178.3MB). Free memory was 149.3MB in the beginning and 159.5MB in the end (delta: -10.2MB). Peak memory consumption was 168.1MB. Max. memory is 16.1GB. [2024-11-09 18:36:22,375 INFO L158 Benchmark]: Witness Printer took 198.31ms. Allocated memory is still 419.4MB. Free memory was 159.5MB in the beginning and 146.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 18:36:22,379 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 174.1MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 588.05ms. Allocated memory is still 174.1MB. Free memory was 116.1MB in the beginning and 85.9MB in the end (delta: 30.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.03ms. Allocated memory is still 174.1MB. Free memory was 85.9MB in the beginning and 80.0MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.77ms. Allocated memory is still 174.1MB. Free memory was 80.0MB in the beginning and 75.4MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1257.47ms. Allocated memory was 174.1MB in the beginning and 241.2MB in the end (delta: 67.1MB). Free memory was 75.4MB in the beginning and 150.4MB in the end (delta: -74.9MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13507.27ms. Allocated memory was 241.2MB in the beginning and 419.4MB in the end (delta: 178.3MB). Free memory was 149.3MB in the beginning and 159.5MB in the end (delta: -10.2MB). Peak memory consumption was 168.1MB. Max. memory is 16.1GB. * Witness Printer took 198.31ms. Allocated memory is still 419.4MB. Free memory was 159.5MB in the beginning and 146.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 540]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 201 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.2s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1652 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1652 mSDsluCounter, 908 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 100 mSDsCounter, 736 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4602 IncrementalHoareTripleChecker+Invalid, 5338 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 736 mSolverCounterUnsat, 808 mSDtfsCounter, 4602 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 909 GetRequests, 878 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2513occurred in iteration=11, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 1452 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 3019 NumberOfCodeBlocks, 3019 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3002 ConstructedInterpolants, 0 QuantifiedInterpolants, 11309 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1547 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 1370/1496 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 18:36:22,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE