./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label07.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/Problem11_label07.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 d275ae72fa22fefb6f99ff85ffd06b7323c3e625d2728e4b56df52786497f790 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:20:57,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:20:57,546 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:20:57,550 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:20:57,551 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:20:57,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:20:57,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:20:57,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:20:57,578 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:20:57,578 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:20:57,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:20:57,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:20:57,579 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:20:57,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:20:57,580 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:20:57,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:20:57,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:20:57,581 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:20:57,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:20:57,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:20:57,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:20:57,583 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:20:57,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:20:57,583 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:20:57,584 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:20:57,584 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:20:57,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:20:57,584 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:20:57,585 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:20:57,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:20:57,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:20:57,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:20:57,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:20:57,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:20:57,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:20:57,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:20:57,587 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:20:57,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:20:57,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:20:57,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:20:57,588 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:20:57,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:20:57,589 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 -> d275ae72fa22fefb6f99ff85ffd06b7323c3e625d2728e4b56df52786497f790 [2024-11-09 19:20:57,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:20:57,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:20:57,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:20:57,885 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:20:57,885 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:20:57,887 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label07.c [2024-11-09 19:20:59,356 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:20:59,681 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:20:59,683 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label07.c [2024-11-09 19:20:59,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5b392974/74a0d4c4b301405f99a47af49abeecb0/FLAG4fa14e908 [2024-11-09 19:20:59,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5b392974/74a0d4c4b301405f99a47af49abeecb0 [2024-11-09 19:20:59,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:20:59,940 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:20:59,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:20:59,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:20:59,946 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:20:59,947 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:20:59" (1/1) ... [2024-11-09 19:20:59,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@581ea845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:59, skipping insertion in model container [2024-11-09 19:20:59,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:20:59" (1/1) ... [2024-11-09 19:21:00,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:21:00,236 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/Problem11_label07.c[3406,3419] [2024-11-09 19:21:00,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:21:00,492 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:21:00,514 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/Problem11_label07.c[3406,3419] [2024-11-09 19:21:00,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:21:00,717 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:21:00,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:00 WrapperNode [2024-11-09 19:21:00,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:21:00,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:21:00,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:21:00,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:21:00,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:00" (1/1) ... [2024-11-09 19:21:00,756 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:00" (1/1) ... [2024-11-09 19:21:00,849 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2024-11-09 19:21:00,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:21:00,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:21:00,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:21:00,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:21:00,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:00" (1/1) ... [2024-11-09 19:21:00,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:00" (1/1) ... [2024-11-09 19:21:00,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:00" (1/1) ... [2024-11-09 19:21:00,931 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 19:21:00,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:00" (1/1) ... [2024-11-09 19:21:00,932 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:00" (1/1) ... [2024-11-09 19:21:00,974 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:00" (1/1) ... [2024-11-09 19:21:00,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:00" (1/1) ... [2024-11-09 19:21:00,999 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:00" (1/1) ... [2024-11-09 19:21:01,008 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:00" (1/1) ... [2024-11-09 19:21:01,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:21:01,034 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:21:01,034 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:21:01,035 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:21:01,035 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:00" (1/1) ... [2024-11-09 19:21:01,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:21:01,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:21:01,073 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 19:21:01,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 19:21:01,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:21:01,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:21:01,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:21:01,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:21:01,196 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:21:01,198 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:21:02,992 INFO L? ?]: Removed 248 outVars from TransFormulas that were not future-live. [2024-11-09 19:21:02,993 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:21:03,024 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:21:03,024 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:21:03,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:21:03 BoogieIcfgContainer [2024-11-09 19:21:03,025 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:21:03,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:21:03,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:21:03,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:21:03,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:20:59" (1/3) ... [2024-11-09 19:21:03,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330a964f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:21:03, skipping insertion in model container [2024-11-09 19:21:03,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:21:00" (2/3) ... [2024-11-09 19:21:03,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330a964f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:21:03, skipping insertion in model container [2024-11-09 19:21:03,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:21:03" (3/3) ... [2024-11-09 19:21:03,037 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label07.c [2024-11-09 19:21:03,055 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:21:03,055 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:21:03,136 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:21:03,143 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;@720a689b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:21:03,144 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:21:03,150 INFO L276 IsEmpty]: Start isEmpty. Operand has 286 states, 284 states have (on average 2.1267605633802815) internal successors, (604), 285 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:03,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 19:21:03,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:03,160 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:03,160 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:03,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:03,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1798321622, now seen corresponding path program 1 times [2024-11-09 19:21:03,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:03,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113045586] [2024-11-09 19:21:03,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:03,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:03,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:21:03,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:03,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113045586] [2024-11-09 19:21:03,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113045586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:03,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:03,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:21:03,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72807184] [2024-11-09 19:21:03,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:03,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:03,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:03,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:03,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:03,555 INFO L87 Difference]: Start difference. First operand has 286 states, 284 states have (on average 2.1267605633802815) internal successors, (604), 285 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:04,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:04,967 INFO L93 Difference]: Finished difference Result 767 states and 1708 transitions. [2024-11-09 19:21:04,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:04,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 19:21:04,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:04,980 INFO L225 Difference]: With dead ends: 767 [2024-11-09 19:21:04,980 INFO L226 Difference]: Without dead ends: 416 [2024-11-09 19:21:04,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:04,986 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 324 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:04,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 227 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 19:21:05,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-09 19:21:05,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2024-11-09 19:21:05,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 2.0240963855421685) internal successors, (840), 415 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:05,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 840 transitions. [2024-11-09 19:21:05,045 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 840 transitions. Word has length 25 [2024-11-09 19:21:05,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:05,046 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 840 transitions. [2024-11-09 19:21:05,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:05,046 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 840 transitions. [2024-11-09 19:21:05,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 19:21:05,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:05,049 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:05,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:21:05,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:05,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:05,050 INFO L85 PathProgramCache]: Analyzing trace with hash -157797875, now seen corresponding path program 1 times [2024-11-09 19:21:05,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:05,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491887151] [2024-11-09 19:21:05,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:05,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:05,271 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:21:05,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:05,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491887151] [2024-11-09 19:21:05,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491887151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:05,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:05,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:21:05,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566815519] [2024-11-09 19:21:05,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:05,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:05,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:05,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:05,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:05,275 INFO L87 Difference]: Start difference. First operand 416 states and 840 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:06,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:06,130 INFO L93 Difference]: Finished difference Result 1219 states and 2485 transitions. [2024-11-09 19:21:06,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:06,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 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 94 [2024-11-09 19:21:06,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:06,136 INFO L225 Difference]: With dead ends: 1219 [2024-11-09 19:21:06,136 INFO L226 Difference]: Without dead ends: 805 [2024-11-09 19:21:06,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:06,138 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 261 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:06,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 125 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:21:06,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-11-09 19:21:06,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 794. [2024-11-09 19:21:06,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 1.9722572509457756) internal successors, (1564), 793 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:06,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1564 transitions. [2024-11-09 19:21:06,171 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1564 transitions. Word has length 94 [2024-11-09 19:21:06,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:06,171 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1564 transitions. [2024-11-09 19:21:06,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:06,171 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1564 transitions. [2024-11-09 19:21:06,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 19:21:06,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:06,174 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:06,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:21:06,174 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:06,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:06,175 INFO L85 PathProgramCache]: Analyzing trace with hash 670076691, now seen corresponding path program 1 times [2024-11-09 19:21:06,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:06,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205354056] [2024-11-09 19:21:06,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:06,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:06,468 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:21:06,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:06,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205354056] [2024-11-09 19:21:06,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205354056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:06,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:06,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:21:06,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791590692] [2024-11-09 19:21:06,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:06,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:06,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:06,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:06,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:06,471 INFO L87 Difference]: Start difference. First operand 794 states and 1564 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:07,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:07,483 INFO L93 Difference]: Finished difference Result 2328 states and 4623 transitions. [2024-11-09 19:21:07,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:07,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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 96 [2024-11-09 19:21:07,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:07,492 INFO L225 Difference]: With dead ends: 2328 [2024-11-09 19:21:07,493 INFO L226 Difference]: Without dead ends: 1536 [2024-11-09 19:21:07,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:07,496 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 238 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:07,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 197 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:21:07,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2024-11-09 19:21:07,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1535. [2024-11-09 19:21:07,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1534 states have (on average 1.8363754889178618) internal successors, (2817), 1534 states have internal predecessors, (2817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:07,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2817 transitions. [2024-11-09 19:21:07,534 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2817 transitions. Word has length 96 [2024-11-09 19:21:07,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:07,534 INFO L471 AbstractCegarLoop]: Abstraction has 1535 states and 2817 transitions. [2024-11-09 19:21:07,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2817 transitions. [2024-11-09 19:21:07,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 19:21:07,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:07,546 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:07,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:21:07,546 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:07,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:07,547 INFO L85 PathProgramCache]: Analyzing trace with hash -578354582, now seen corresponding path program 1 times [2024-11-09 19:21:07,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:07,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887335283] [2024-11-09 19:21:07,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:07,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:07,872 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:21:07,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:07,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887335283] [2024-11-09 19:21:07,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887335283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:07,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:07,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:07,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655746171] [2024-11-09 19:21:07,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:07,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:07,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:07,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:07,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:07,882 INFO L87 Difference]: Start difference. First operand 1535 states and 2817 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:08,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:08,901 INFO L93 Difference]: Finished difference Result 3276 states and 6165 transitions. [2024-11-09 19:21:08,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:08,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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 153 [2024-11-09 19:21:08,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:08,911 INFO L225 Difference]: With dead ends: 3276 [2024-11-09 19:21:08,912 INFO L226 Difference]: Without dead ends: 1928 [2024-11-09 19:21:08,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:08,918 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 331 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:08,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 446 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:21:08,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2024-11-09 19:21:08,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1925. [2024-11-09 19:21:08,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1924 states have (on average 1.8633056133056134) internal successors, (3585), 1924 states have internal predecessors, (3585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:08,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 3585 transitions. [2024-11-09 19:21:08,954 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 3585 transitions. Word has length 153 [2024-11-09 19:21:08,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:08,955 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 3585 transitions. [2024-11-09 19:21:08,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:08,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 3585 transitions. [2024-11-09 19:21:08,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-09 19:21:08,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:08,960 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:08,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:21:08,960 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:08,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:08,961 INFO L85 PathProgramCache]: Analyzing trace with hash -34798674, now seen corresponding path program 1 times [2024-11-09 19:21:08,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:08,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145871345] [2024-11-09 19:21:08,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:08,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 19:21:09,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:09,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145871345] [2024-11-09 19:21:09,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145871345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:09,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:09,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:09,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699024524] [2024-11-09 19:21:09,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:09,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:09,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:09,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:09,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:09,233 INFO L87 Difference]: Start difference. First operand 1925 states and 3585 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:10,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:10,157 INFO L93 Difference]: Finished difference Result 4414 states and 8352 transitions. [2024-11-09 19:21:10,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:10,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 209 [2024-11-09 19:21:10,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:10,167 INFO L225 Difference]: With dead ends: 4414 [2024-11-09 19:21:10,168 INFO L226 Difference]: Without dead ends: 2676 [2024-11-09 19:21:10,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:10,171 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 293 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:10,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 516 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:21:10,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2024-11-09 19:21:10,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 2481. [2024-11-09 19:21:10,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2480 states have (on average 1.857258064516129) internal successors, (4606), 2480 states have internal predecessors, (4606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:10,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 4606 transitions. [2024-11-09 19:21:10,216 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 4606 transitions. Word has length 209 [2024-11-09 19:21:10,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:10,216 INFO L471 AbstractCegarLoop]: Abstraction has 2481 states and 4606 transitions. [2024-11-09 19:21:10,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:10,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 4606 transitions. [2024-11-09 19:21:10,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-09 19:21:10,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:10,220 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:21:10,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:21:10,220 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:10,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:10,221 INFO L85 PathProgramCache]: Analyzing trace with hash 589187712, now seen corresponding path program 1 times [2024-11-09 19:21:10,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:10,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300910916] [2024-11-09 19:21:10,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:10,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:10,666 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 27 proven. 16 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 19:21:10,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:10,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300910916] [2024-11-09 19:21:10,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300910916] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:21:10,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891708064] [2024-11-09 19:21:10,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:10,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:21:10,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:21:10,670 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:21:10,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 19:21:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:10,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:21:10,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:21:10,904 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 19:21:10,904 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:21:10,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891708064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:10,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:21:10,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:21:10,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860844318] [2024-11-09 19:21:10,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:10,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:10,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:10,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:10,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:21:10,909 INFO L87 Difference]: Start difference. First operand 2481 states and 4606 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:11,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:11,812 INFO L93 Difference]: Finished difference Result 5895 states and 11019 transitions. [2024-11-09 19:21:11,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:11,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 215 [2024-11-09 19:21:11,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:11,831 INFO L225 Difference]: With dead ends: 5895 [2024-11-09 19:21:11,831 INFO L226 Difference]: Without dead ends: 3416 [2024-11-09 19:21:11,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:21:11,840 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 292 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:11,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 514 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:21:11,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2024-11-09 19:21:11,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 3407. [2024-11-09 19:21:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3407 states, 3406 states have (on average 1.835584263065179) internal successors, (6252), 3406 states have internal predecessors, (6252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:11,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3407 states to 3407 states and 6252 transitions. [2024-11-09 19:21:11,903 INFO L78 Accepts]: Start accepts. Automaton has 3407 states and 6252 transitions. Word has length 215 [2024-11-09 19:21:11,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:11,904 INFO L471 AbstractCegarLoop]: Abstraction has 3407 states and 6252 transitions. [2024-11-09 19:21:11,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:11,905 INFO L276 IsEmpty]: Start isEmpty. Operand 3407 states and 6252 transitions. [2024-11-09 19:21:11,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-09 19:21:11,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:11,910 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:21:11,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 19:21:12,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 19:21:12,114 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:12,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:12,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1728064505, now seen corresponding path program 1 times [2024-11-09 19:21:12,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:12,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687384400] [2024-11-09 19:21:12,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:12,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:12,517 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 19:21:12,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:12,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687384400] [2024-11-09 19:21:12,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687384400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:12,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:12,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:12,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030659356] [2024-11-09 19:21:12,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:12,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:12,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:12,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:12,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:12,520 INFO L87 Difference]: Start difference. First operand 3407 states and 6252 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:13,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:13,423 INFO L93 Difference]: Finished difference Result 6826 states and 12527 transitions. [2024-11-09 19:21:13,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:13,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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 287 [2024-11-09 19:21:13,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:13,435 INFO L225 Difference]: With dead ends: 6826 [2024-11-09 19:21:13,436 INFO L226 Difference]: Without dead ends: 3421 [2024-11-09 19:21:13,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:13,441 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 257 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:13,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 459 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:21:13,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3421 states. [2024-11-09 19:21:13,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3421 to 3037. [2024-11-09 19:21:13,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3037 states, 3036 states have (on average 1.8076416337285903) internal successors, (5488), 3036 states have internal predecessors, (5488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:13,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3037 states to 3037 states and 5488 transitions. [2024-11-09 19:21:13,533 INFO L78 Accepts]: Start accepts. Automaton has 3037 states and 5488 transitions. Word has length 287 [2024-11-09 19:21:13,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:13,533 INFO L471 AbstractCegarLoop]: Abstraction has 3037 states and 5488 transitions. [2024-11-09 19:21:13,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:13,534 INFO L276 IsEmpty]: Start isEmpty. Operand 3037 states and 5488 transitions. [2024-11-09 19:21:13,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2024-11-09 19:21:13,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:13,539 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:13,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:21:13,540 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:13,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:13,540 INFO L85 PathProgramCache]: Analyzing trace with hash 721552671, now seen corresponding path program 1 times [2024-11-09 19:21:13,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:13,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374415147] [2024-11-09 19:21:13,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:13,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:13,741 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 19:21:13,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:13,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374415147] [2024-11-09 19:21:13,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374415147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:13,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:13,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:13,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710281359] [2024-11-09 19:21:13,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:13,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:13,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:13,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:13,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:13,744 INFO L87 Difference]: Start difference. First operand 3037 states and 5488 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:14,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:14,651 INFO L93 Difference]: Finished difference Result 6049 states and 10941 transitions. [2024-11-09 19:21:14,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:14,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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 288 [2024-11-09 19:21:14,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:14,662 INFO L225 Difference]: With dead ends: 6049 [2024-11-09 19:21:14,662 INFO L226 Difference]: Without dead ends: 3014 [2024-11-09 19:21:14,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:14,666 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 281 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:14,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 152 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:21:14,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2024-11-09 19:21:14,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 3012. [2024-11-09 19:21:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3012 states, 3011 states have (on average 1.764530056459648) internal successors, (5313), 3011 states have internal predecessors, (5313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 3012 states and 5313 transitions. [2024-11-09 19:21:14,746 INFO L78 Accepts]: Start accepts. Automaton has 3012 states and 5313 transitions. Word has length 288 [2024-11-09 19:21:14,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:14,746 INFO L471 AbstractCegarLoop]: Abstraction has 3012 states and 5313 transitions. [2024-11-09 19:21:14,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:14,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3012 states and 5313 transitions. [2024-11-09 19:21:14,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-11-09 19:21:14,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:14,752 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:21:14,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:21:14,753 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:14,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:14,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1976650699, now seen corresponding path program 1 times [2024-11-09 19:21:14,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:14,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240112045] [2024-11-09 19:21:14,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:14,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:14,964 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-11-09 19:21:14,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:14,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240112045] [2024-11-09 19:21:14,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240112045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:14,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:14,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:14,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310155767] [2024-11-09 19:21:14,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:14,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:14,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:14,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:14,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:14,969 INFO L87 Difference]: Start difference. First operand 3012 states and 5313 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:15,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:15,915 INFO L93 Difference]: Finished difference Result 6946 states and 12252 transitions. [2024-11-09 19:21:15,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:15,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 293 [2024-11-09 19:21:15,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:15,928 INFO L225 Difference]: With dead ends: 6946 [2024-11-09 19:21:15,928 INFO L226 Difference]: Without dead ends: 3936 [2024-11-09 19:21:15,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:15,932 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 318 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:15,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 149 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:21:15,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3936 states. [2024-11-09 19:21:15,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3936 to 2081. [2024-11-09 19:21:15,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2081 states, 2080 states have (on average 1.7764423076923077) internal successors, (3695), 2080 states have internal predecessors, (3695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:15,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 3695 transitions. [2024-11-09 19:21:15,971 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 3695 transitions. Word has length 293 [2024-11-09 19:21:15,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:15,971 INFO L471 AbstractCegarLoop]: Abstraction has 2081 states and 3695 transitions. [2024-11-09 19:21:15,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:15,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 3695 transitions. [2024-11-09 19:21:15,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-09 19:21:15,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:15,977 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:21:15,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:21:15,978 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:15,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:15,978 INFO L85 PathProgramCache]: Analyzing trace with hash -326142152, now seen corresponding path program 1 times [2024-11-09 19:21:15,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:15,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720359318] [2024-11-09 19:21:15,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:15,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:16,411 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:21:16,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:16,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720359318] [2024-11-09 19:21:16,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720359318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:16,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:16,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:21:16,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808749550] [2024-11-09 19:21:16,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:16,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:21:16,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:16,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:21:16,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:21:16,415 INFO L87 Difference]: Start difference. First operand 2081 states and 3695 transitions. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:17,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:17,770 INFO L93 Difference]: Finished difference Result 6389 states and 11374 transitions. [2024-11-09 19:21:17,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:21:17,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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 332 [2024-11-09 19:21:17,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:17,789 INFO L225 Difference]: With dead ends: 6389 [2024-11-09 19:21:17,789 INFO L226 Difference]: Without dead ends: 4310 [2024-11-09 19:21:17,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:21:17,793 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 506 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1536 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:17,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 73 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1536 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 19:21:17,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4310 states. [2024-11-09 19:21:17,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4310 to 3753. [2024-11-09 19:21:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3753 states, 3752 states have (on average 1.7643923240938166) internal successors, (6620), 3752 states have internal predecessors, (6620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:17,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 6620 transitions. [2024-11-09 19:21:17,849 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 6620 transitions. Word has length 332 [2024-11-09 19:21:17,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:17,849 INFO L471 AbstractCegarLoop]: Abstraction has 3753 states and 6620 transitions. [2024-11-09 19:21:17,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:17,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 6620 transitions. [2024-11-09 19:21:17,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2024-11-09 19:21:17,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:17,859 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:21:17,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:21:17,860 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:17,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:17,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1035821925, now seen corresponding path program 1 times [2024-11-09 19:21:17,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:17,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977800159] [2024-11-09 19:21:17,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:17,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:18,342 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-09 19:21:18,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:18,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977800159] [2024-11-09 19:21:18,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977800159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:18,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:18,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:21:18,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659751370] [2024-11-09 19:21:18,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:18,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:21:18,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:18,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:21:18,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:21:18,345 INFO L87 Difference]: Start difference. First operand 3753 states and 6620 transitions. Second operand has 4 states, 4 states have (on average 75.75) internal successors, (303), 4 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:19,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:19,586 INFO L93 Difference]: Finished difference Result 8801 states and 15514 transitions. [2024-11-09 19:21:19,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:21:19,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.75) internal successors, (303), 4 states have internal predecessors, (303), 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 407 [2024-11-09 19:21:19,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:19,602 INFO L225 Difference]: With dead ends: 8801 [2024-11-09 19:21:19,603 INFO L226 Difference]: Without dead ends: 5050 [2024-11-09 19:21:19,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:21:19,608 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 506 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1535 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:19,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 73 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1535 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:21:19,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5050 states. [2024-11-09 19:21:19,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5050 to 3753. [2024-11-09 19:21:19,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3753 states, 3752 states have (on average 1.7643923240938166) internal successors, (6620), 3752 states have internal predecessors, (6620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:19,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 6620 transitions. [2024-11-09 19:21:19,676 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 6620 transitions. Word has length 407 [2024-11-09 19:21:19,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:19,676 INFO L471 AbstractCegarLoop]: Abstraction has 3753 states and 6620 transitions. [2024-11-09 19:21:19,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.75) internal successors, (303), 4 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:19,677 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 6620 transitions. [2024-11-09 19:21:19,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2024-11-09 19:21:19,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:19,686 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:21:19,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:21:19,687 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:19,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:19,687 INFO L85 PathProgramCache]: Analyzing trace with hash 505911991, now seen corresponding path program 1 times [2024-11-09 19:21:19,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:19,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43858913] [2024-11-09 19:21:19,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:19,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:20,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1168 backedges. 823 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-11-09 19:21:20,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:20,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43858913] [2024-11-09 19:21:20,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43858913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:20,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:20,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:20,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049660526] [2024-11-09 19:21:20,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:20,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:21:20,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:20,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:21:20,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:21:20,230 INFO L87 Difference]: Start difference. First operand 3753 states and 6620 transitions. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:21,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:21,504 INFO L93 Difference]: Finished difference Result 11965 states and 21156 transitions. [2024-11-09 19:21:21,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:21:21,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 3 states have internal predecessors, (432), 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 660 [2024-11-09 19:21:21,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:21,520 INFO L225 Difference]: With dead ends: 11965 [2024-11-09 19:21:21,521 INFO L226 Difference]: Without dead ends: 8214 [2024-11-09 19:21:21,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:21:21,527 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 462 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:21,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 90 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:21:21,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8214 states. [2024-11-09 19:21:21,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8214 to 7842. [2024-11-09 19:21:21,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7842 states, 7841 states have (on average 1.7561535518428772) internal successors, (13770), 7841 states have internal predecessors, (13770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:21,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7842 states to 7842 states and 13770 transitions. [2024-11-09 19:21:21,659 INFO L78 Accepts]: Start accepts. Automaton has 7842 states and 13770 transitions. Word has length 660 [2024-11-09 19:21:21,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:21,659 INFO L471 AbstractCegarLoop]: Abstraction has 7842 states and 13770 transitions. [2024-11-09 19:21:21,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:21,660 INFO L276 IsEmpty]: Start isEmpty. Operand 7842 states and 13770 transitions. [2024-11-09 19:21:21,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2024-11-09 19:21:21,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:21,677 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:21,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:21:21,677 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:21,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:21,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1185266253, now seen corresponding path program 1 times [2024-11-09 19:21:21,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:21,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673954442] [2024-11-09 19:21:21,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:21,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:22,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 928 proven. 0 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2024-11-09 19:21:22,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:22,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673954442] [2024-11-09 19:21:22,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673954442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:22,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:22,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:22,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923625224] [2024-11-09 19:21:22,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:22,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:22,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:22,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:22,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:22,164 INFO L87 Difference]: Start difference. First operand 7842 states and 13770 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:23,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:23,014 INFO L93 Difference]: Finished difference Result 17532 states and 30836 transitions. [2024-11-09 19:21:23,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:23,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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 729 [2024-11-09 19:21:23,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:23,031 INFO L225 Difference]: With dead ends: 17532 [2024-11-09 19:21:23,031 INFO L226 Difference]: Without dead ends: 8765 [2024-11-09 19:21:23,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:23,041 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 316 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:23,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 486 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:21:23,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8765 states. [2024-11-09 19:21:23,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8765 to 8765. [2024-11-09 19:21:23,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8765 states, 8764 states have (on average 1.7382473756275674) internal successors, (15234), 8764 states have internal predecessors, (15234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:23,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8765 states to 8765 states and 15234 transitions. [2024-11-09 19:21:23,158 INFO L78 Accepts]: Start accepts. Automaton has 8765 states and 15234 transitions. Word has length 729 [2024-11-09 19:21:23,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:23,158 INFO L471 AbstractCegarLoop]: Abstraction has 8765 states and 15234 transitions. [2024-11-09 19:21:23,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:23,159 INFO L276 IsEmpty]: Start isEmpty. Operand 8765 states and 15234 transitions. [2024-11-09 19:21:23,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2024-11-09 19:21:23,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:23,174 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2024-11-09 19:21:23,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 19:21:23,175 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:23,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:23,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1341098875, now seen corresponding path program 1 times [2024-11-09 19:21:23,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:23,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53654536] [2024-11-09 19:21:23,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:23,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:23,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1928 backedges. 1400 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2024-11-09 19:21:23,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:23,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53654536] [2024-11-09 19:21:23,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53654536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:23,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:23,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:23,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965459777] [2024-11-09 19:21:23,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:23,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:23,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:23,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:23,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:23,685 INFO L87 Difference]: Start difference. First operand 8765 states and 15234 transitions. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:24,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:24,472 INFO L93 Difference]: Finished difference Result 18264 states and 31720 transitions. [2024-11-09 19:21:24,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:24,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 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 829 [2024-11-09 19:21:24,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:24,475 INFO L225 Difference]: With dead ends: 18264 [2024-11-09 19:21:24,475 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 19:21:24,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:24,486 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 183 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:24,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 448 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:21:24,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 19:21:24,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 19:21:24,487 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 19:21:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 19:21:24,487 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 829 [2024-11-09 19:21:24,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:24,487 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 19:21:24,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:24,487 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 19:21:24,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 19:21:24,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 19:21:24,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 19:21:24,494 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:24,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 19:21:25,836 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 19:21:25,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:21:25 BoogieIcfgContainer [2024-11-09 19:21:25,862 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 19:21:25,862 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 19:21:25,862 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 19:21:25,863 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 19:21:25,863 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:21:03" (3/4) ... [2024-11-09 19:21:25,865 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 19:21:25,897 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 19:21:25,899 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 19:21:25,900 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 19:21:25,901 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 19:21:26,102 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 19:21:26,103 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 19:21:26,103 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 19:21:26,104 INFO L158 Benchmark]: Toolchain (without parser) took 26163.73ms. Allocated memory was 180.4MB in the beginning and 645.9MB in the end (delta: 465.6MB). Free memory was 122.2MB in the beginning and 326.4MB in the end (delta: -204.2MB). Peak memory consumption was 262.6MB. Max. memory is 16.1GB. [2024-11-09 19:21:26,104 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 121.6MB. Free memory is still 92.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 19:21:26,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 777.31ms. Allocated memory is still 180.4MB. Free memory was 121.6MB in the beginning and 141.5MB in the end (delta: -19.9MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. [2024-11-09 19:21:26,104 INFO L158 Benchmark]: Boogie Procedure Inliner took 130.26ms. Allocated memory is still 180.4MB. Free memory was 141.5MB in the beginning and 123.9MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 19:21:26,105 INFO L158 Benchmark]: Boogie Preprocessor took 182.62ms. Allocated memory is still 180.4MB. Free memory was 123.9MB in the beginning and 99.5MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 19:21:26,105 INFO L158 Benchmark]: IcfgBuilder took 1991.60ms. Allocated memory was 180.4MB in the beginning and 255.9MB in the end (delta: 75.5MB). Free memory was 99.5MB in the beginning and 190.3MB in the end (delta: -90.9MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. [2024-11-09 19:21:26,106 INFO L158 Benchmark]: TraceAbstraction took 22834.24ms. Allocated memory was 255.9MB in the beginning and 645.9MB in the end (delta: 390.1MB). Free memory was 189.3MB in the beginning and 346.3MB in the end (delta: -157.1MB). Peak memory consumption was 302.2MB. Max. memory is 16.1GB. [2024-11-09 19:21:26,106 INFO L158 Benchmark]: Witness Printer took 240.78ms. Allocated memory is still 645.9MB. Free memory was 346.3MB in the beginning and 326.4MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 19:21:26,107 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.53ms. Allocated memory is still 121.6MB. Free memory is still 92.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 777.31ms. Allocated memory is still 180.4MB. Free memory was 121.6MB in the beginning and 141.5MB in the end (delta: -19.9MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 130.26ms. Allocated memory is still 180.4MB. Free memory was 141.5MB in the beginning and 123.9MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 182.62ms. Allocated memory is still 180.4MB. Free memory was 123.9MB in the beginning and 99.5MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1991.60ms. Allocated memory was 180.4MB in the beginning and 255.9MB in the end (delta: 75.5MB). Free memory was 99.5MB in the beginning and 190.3MB in the end (delta: -90.9MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. * TraceAbstraction took 22834.24ms. Allocated memory was 255.9MB in the beginning and 645.9MB in the end (delta: 390.1MB). Free memory was 189.3MB in the beginning and 346.3MB in the end (delta: -157.1MB). Peak memory consumption was 302.2MB. Max. memory is 16.1GB. * Witness Printer took 240.78ms. Allocated memory is still 645.9MB. Free memory was 346.3MB in the beginning and 326.4MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. 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: 85]: 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, 286 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.4s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4568 SdHoareTripleChecker+Valid, 13.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4568 mSDsluCounter, 3955 SdHoareTripleChecker+Invalid, 11.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 400 mSDsCounter, 1683 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13234 IncrementalHoareTripleChecker+Invalid, 14917 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1683 mSolverCounterUnsat, 3555 mSDtfsCounter, 13234 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 256 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8765occurred in iteration=13, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 4686 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 4832 NumberOfCodeBlocks, 4832 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4817 ConstructedInterpolants, 0 QuantifiedInterpolants, 10081 SizeOfPredicates, 0 NumberOfNonLiveVariables, 324 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 6471/6487 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: 1044]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 19:21:26,141 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