./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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_label13.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 b0e755b2dd5e51a3c2c6bd6c8ef06f55d3c3a2554217c62da40af9cd808ace64 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 22:02:56,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 22:02:56,681 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 22:02:56,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 22:02:56,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 22:02:56,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 22:02:56,704 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 22:02:56,705 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 22:02:56,705 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 22:02:56,705 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 22:02:56,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 22:02:56,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 22:02:56,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 22:02:56,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 22:02:56,707 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 22:02:56,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 22:02:56,708 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 22:02:56,708 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 22:02:56,708 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 22:02:56,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 22:02:56,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 22:02:56,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 22:02:56,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 22:02:56,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 22:02:56,710 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 22:02:56,710 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 22:02:56,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 22:02:56,711 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 22:02:56,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 22:02:56,712 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 22:02:56,712 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 22:02:56,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 22:02:56,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 22:02:56,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 22:02:56,713 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 22:02:56,713 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 22:02:56,713 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 22:02:56,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 22:02:56,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 22:02:56,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 22:02:56,714 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 22:02:56,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 22:02:56,715 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 -> b0e755b2dd5e51a3c2c6bd6c8ef06f55d3c3a2554217c62da40af9cd808ace64 [2024-11-21 22:02:56,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 22:02:56,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 22:02:56,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 22:02:56,941 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 22:02:56,941 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 22:02:56,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label13.c [2024-11-21 22:02:58,310 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 22:02:58,550 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 22:02:58,551 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label13.c [2024-11-21 22:02:58,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c29137240/03bbc2c9557149ce9e774ade461bb2da/FLAG701813f43 [2024-11-21 22:02:58,882 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c29137240/03bbc2c9557149ce9e774ade461bb2da [2024-11-21 22:02:58,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 22:02:58,887 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 22:02:58,888 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 22:02:58,888 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 22:02:58,893 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 22:02:58,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:02:58" (1/1) ... [2024-11-21 22:02:58,894 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@396d871a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:58, skipping insertion in model container [2024-11-21 22:02:58,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:02:58" (1/1) ... [2024-11-21 22:02:58,956 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 22:02:59,164 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_label13.c[4853,4866] [2024-11-21 22:02:59,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 22:02:59,347 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 22:02:59,366 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_label13.c[4853,4866] [2024-11-21 22:02:59,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 22:02:59,468 INFO L204 MainTranslator]: Completed translation [2024-11-21 22:02:59,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:59 WrapperNode [2024-11-21 22:02:59,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 22:02:59,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 22:02:59,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 22:02:59,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 22:02:59,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:59" (1/1) ... [2024-11-21 22:02:59,492 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:59" (1/1) ... [2024-11-21 22:02:59,552 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-21 22:02:59,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 22:02:59,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 22:02:59,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 22:02:59,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 22:02:59,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:59" (1/1) ... [2024-11-21 22:02:59,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:59" (1/1) ... [2024-11-21 22:02:59,578 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:59" (1/1) ... [2024-11-21 22:02:59,636 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-21 22:02:59,638 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:59" (1/1) ... [2024-11-21 22:02:59,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:59" (1/1) ... [2024-11-21 22:02:59,672 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:59" (1/1) ... [2024-11-21 22:02:59,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:59" (1/1) ... [2024-11-21 22:02:59,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:59" (1/1) ... [2024-11-21 22:02:59,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:59" (1/1) ... [2024-11-21 22:02:59,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 22:02:59,724 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 22:02:59,724 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 22:02:59,724 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 22:02:59,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:59" (1/1) ... [2024-11-21 22:02:59,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 22:02:59,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:02:59,752 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-21 22:02:59,754 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-21 22:02:59,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 22:02:59,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 22:02:59,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 22:02:59,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 22:02:59,906 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 22:02:59,908 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 22:03:01,082 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-21 22:03:01,083 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 22:03:01,100 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 22:03:01,102 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-21 22:03:01,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:03:01 BoogieIcfgContainer [2024-11-21 22:03:01,102 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 22:03:01,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 22:03:01,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 22:03:01,107 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 22:03:01,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:02:58" (1/3) ... [2024-11-21 22:03:01,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b92190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:03:01, skipping insertion in model container [2024-11-21 22:03:01,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:59" (2/3) ... [2024-11-21 22:03:01,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b92190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:03:01, skipping insertion in model container [2024-11-21 22:03:01,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:03:01" (3/3) ... [2024-11-21 22:03:01,111 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label13.c [2024-11-21 22:03:01,123 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 22:03:01,123 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 22:03:01,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 22:03:01,184 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;@1a88ba40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 22:03:01,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 22:03:01,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 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-21 22:03:01,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-21 22:03:01,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:03:01,194 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:03:01,195 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:03:01,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:03:01,199 INFO L85 PathProgramCache]: Analyzing trace with hash 2113343065, now seen corresponding path program 1 times [2024-11-21 22:03:01,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:03:01,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699145269] [2024-11-21 22:03:01,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:01,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:03:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:01,501 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-21 22:03:01,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:03:01,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699145269] [2024-11-21 22:03:01,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699145269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:03:01,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:03:01,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:03:01,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109238522] [2024-11-21 22:03:01,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:03:01,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:03:01,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:03:01,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:03:01,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:01,576 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 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 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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-21 22:03:02,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:03:02,506 INFO L93 Difference]: Finished difference Result 769 states and 1360 transitions. [2024-11-21 22:03:02,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:03:02,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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 33 [2024-11-21 22:03:02,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:03:02,518 INFO L225 Difference]: With dead ends: 769 [2024-11-21 22:03:02,518 INFO L226 Difference]: Without dead ends: 422 [2024-11-21 22:03:02,521 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-21 22:03:02,523 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 207 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-21 22:03:02,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 163 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-21 22:03:02,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-11-21 22:03:02,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 412. [2024-11-21 22:03:02,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.5231143552311435) internal successors, (626), 411 states have internal predecessors, (626), 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-21 22:03:02,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 626 transitions. [2024-11-21 22:03:02,564 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 626 transitions. Word has length 33 [2024-11-21 22:03:02,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:03:02,564 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 626 transitions. [2024-11-21 22:03:02,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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-21 22:03:02,564 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 626 transitions. [2024-11-21 22:03:02,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-21 22:03:02,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:03:02,567 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 22:03:02,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 22:03:02,567 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:03:02,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:03:02,568 INFO L85 PathProgramCache]: Analyzing trace with hash 242619611, now seen corresponding path program 1 times [2024-11-21 22:03:02,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:03:02,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120130632] [2024-11-21 22:03:02,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:02,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:03:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:02,707 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:03:02,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:03:02,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120130632] [2024-11-21 22:03:02,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120130632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:03:02,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:03:02,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:03:02,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184876587] [2024-11-21 22:03:02,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:03:02,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:03:02,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:03:02,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:03:02,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:02,711 INFO L87 Difference]: Start difference. First operand 412 states and 626 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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-21 22:03:03,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:03:03,373 INFO L93 Difference]: Finished difference Result 1194 states and 1821 transitions. [2024-11-21 22:03:03,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:03:03,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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 99 [2024-11-21 22:03:03,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:03:03,378 INFO L225 Difference]: With dead ends: 1194 [2024-11-21 22:03:03,378 INFO L226 Difference]: Without dead ends: 784 [2024-11-21 22:03:03,379 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-21 22:03:03,381 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 175 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 22:03:03,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 154 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 22:03:03,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2024-11-21 22:03:03,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2024-11-21 22:03:03,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 783 states have (on average 1.3742017879948913) internal successors, (1076), 783 states have internal predecessors, (1076), 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-21 22:03:03,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1076 transitions. [2024-11-21 22:03:03,422 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1076 transitions. Word has length 99 [2024-11-21 22:03:03,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:03:03,422 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1076 transitions. [2024-11-21 22:03:03,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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-21 22:03:03,423 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1076 transitions. [2024-11-21 22:03:03,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-21 22:03:03,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:03:03,425 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 22:03:03,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 22:03:03,425 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:03:03,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:03:03,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1008967451, now seen corresponding path program 1 times [2024-11-21 22:03:03,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:03:03,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124286775] [2024-11-21 22:03:03,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:03,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:03:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:03,730 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:03:03,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:03:03,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124286775] [2024-11-21 22:03:03,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124286775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:03:03,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:03:03,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:03:03,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116445342] [2024-11-21 22:03:03,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:03:03,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:03:03,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:03:03,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:03:03,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:03,732 INFO L87 Difference]: Start difference. First operand 784 states and 1076 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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-21 22:03:04,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:03:04,350 INFO L93 Difference]: Finished difference Result 1936 states and 2599 transitions. [2024-11-21 22:03:04,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:03:04,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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 103 [2024-11-21 22:03:04,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:03:04,355 INFO L225 Difference]: With dead ends: 1936 [2024-11-21 22:03:04,356 INFO L226 Difference]: Without dead ends: 1154 [2024-11-21 22:03:04,356 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-21 22:03:04,357 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 22:03:04,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 22:03:04,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-11-21 22:03:04,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1153. [2024-11-21 22:03:04,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1152 states have (on average 1.2699652777777777) internal successors, (1463), 1152 states have internal predecessors, (1463), 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-21 22:03:04,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1463 transitions. [2024-11-21 22:03:04,376 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1463 transitions. Word has length 103 [2024-11-21 22:03:04,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:03:04,376 INFO L471 AbstractCegarLoop]: Abstraction has 1153 states and 1463 transitions. [2024-11-21 22:03:04,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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-21 22:03:04,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1463 transitions. [2024-11-21 22:03:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-21 22:03:04,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:03:04,379 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 22:03:04,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 22:03:04,379 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:03:04,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:03:04,380 INFO L85 PathProgramCache]: Analyzing trace with hash -2053609444, now seen corresponding path program 1 times [2024-11-21 22:03:04,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:03:04,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69057791] [2024-11-21 22:03:04,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:04,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:03:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:03:04,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:03:04,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69057791] [2024-11-21 22:03:04,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69057791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:03:04,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:03:04,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:03:04,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536040969] [2024-11-21 22:03:04,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:03:04,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:03:04,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:03:04,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:03:04,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:04,706 INFO L87 Difference]: Start difference. First operand 1153 states and 1463 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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-21 22:03:05,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:03:05,296 INFO L93 Difference]: Finished difference Result 2679 states and 3481 transitions. [2024-11-21 22:03:05,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:03:05,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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 145 [2024-11-21 22:03:05,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:03:05,301 INFO L225 Difference]: With dead ends: 2679 [2024-11-21 22:03:05,301 INFO L226 Difference]: Without dead ends: 1712 [2024-11-21 22:03:05,302 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-21 22:03:05,303 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 173 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 22:03:05,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 332 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 22:03:05,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2024-11-21 22:03:05,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1521. [2024-11-21 22:03:05,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1520 states have (on average 1.255921052631579) internal successors, (1909), 1520 states have internal predecessors, (1909), 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-21 22:03:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1909 transitions. [2024-11-21 22:03:05,321 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1909 transitions. Word has length 145 [2024-11-21 22:03:05,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:03:05,321 INFO L471 AbstractCegarLoop]: Abstraction has 1521 states and 1909 transitions. [2024-11-21 22:03:05,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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-21 22:03:05,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1909 transitions. [2024-11-21 22:03:05,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-21 22:03:05,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:03:05,324 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-21 22:03:05,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 22:03:05,324 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:03:05,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:03:05,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2108128152, now seen corresponding path program 1 times [2024-11-21 22:03:05,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:03:05,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144488053] [2024-11-21 22:03:05,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:05,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:03:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:05,541 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-21 22:03:05,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:03:05,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144488053] [2024-11-21 22:03:05,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144488053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:03:05,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:03:05,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:03:05,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060403249] [2024-11-21 22:03:05,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:03:05,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:03:05,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:03:05,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:03:05,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:05,543 INFO L87 Difference]: Start difference. First operand 1521 states and 1909 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:06,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:03:06,175 INFO L93 Difference]: Finished difference Result 3597 states and 4559 transitions. [2024-11-21 22:03:06,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:03:06,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 215 [2024-11-21 22:03:06,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:03:06,181 INFO L225 Difference]: With dead ends: 3597 [2024-11-21 22:03:06,181 INFO L226 Difference]: Without dead ends: 2078 [2024-11-21 22:03:06,183 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-21 22:03:06,184 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 164 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 22:03:06,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 391 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 22:03:06,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2024-11-21 22:03:06,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 1889. [2024-11-21 22:03:06,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1888 states have (on average 1.2473516949152543) internal successors, (2355), 1888 states have internal predecessors, (2355), 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-21 22:03:06,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2355 transitions. [2024-11-21 22:03:06,207 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2355 transitions. Word has length 215 [2024-11-21 22:03:06,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:03:06,207 INFO L471 AbstractCegarLoop]: Abstraction has 1889 states and 2355 transitions. [2024-11-21 22:03:06,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:06,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2355 transitions. [2024-11-21 22:03:06,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-21 22:03:06,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:03:06,210 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-21 22:03:06,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 22:03:06,210 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:03:06,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:03:06,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1531624061, now seen corresponding path program 1 times [2024-11-21 22:03:06,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:03:06,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453682324] [2024-11-21 22:03:06,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:06,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:03:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:06,465 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:03:06,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:03:06,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453682324] [2024-11-21 22:03:06,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453682324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:03:06,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:03:06,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:03:06,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301770152] [2024-11-21 22:03:06,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:03:06,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:03:06,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:03:06,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:03:06,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:06,467 INFO L87 Difference]: Start difference. First operand 1889 states and 2355 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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-21 22:03:07,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:03:07,350 INFO L93 Difference]: Finished difference Result 5075 states and 6326 transitions. [2024-11-21 22:03:07,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:03:07,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 242 [2024-11-21 22:03:07,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:03:07,361 INFO L225 Difference]: With dead ends: 5075 [2024-11-21 22:03:07,361 INFO L226 Difference]: Without dead ends: 3188 [2024-11-21 22:03:07,363 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-21 22:03:07,364 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 121 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-21 22:03:07,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 142 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-21 22:03:07,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3188 states. [2024-11-21 22:03:07,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3188 to 3186. [2024-11-21 22:03:07,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3186 states, 3185 states have (on average 1.2156985871271586) internal successors, (3872), 3185 states have internal predecessors, (3872), 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-21 22:03:07,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 3872 transitions. [2024-11-21 22:03:07,406 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 3872 transitions. Word has length 242 [2024-11-21 22:03:07,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:03:07,407 INFO L471 AbstractCegarLoop]: Abstraction has 3186 states and 3872 transitions. [2024-11-21 22:03:07,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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-21 22:03:07,408 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 3872 transitions. [2024-11-21 22:03:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-21 22:03:07,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:03:07,410 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-21 22:03:07,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 22:03:07,410 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:03:07,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:03:07,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1612994281, now seen corresponding path program 1 times [2024-11-21 22:03:07,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:03:07,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197292490] [2024-11-21 22:03:07,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:07,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:03:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:08,087 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 127 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:03:08,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:03:08,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197292490] [2024-11-21 22:03:08,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197292490] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 22:03:08,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050065359] [2024-11-21 22:03:08,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:08,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:03:08,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:03:08,091 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-21 22:03:08,093 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-21 22:03:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:08,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 22:03:08,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 22:03:08,571 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-21 22:03:08,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 22:03:08,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050065359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:03:08,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 22:03:08,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-21 22:03:08,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601857657] [2024-11-21 22:03:08,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:03:08,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 22:03:08,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:03:08,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 22:03:08,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-21 22:03:08,573 INFO L87 Difference]: Start difference. First operand 3186 states and 3872 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:09,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:03:09,437 INFO L93 Difference]: Finished difference Result 9517 states and 11337 transitions. [2024-11-21 22:03:09,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 22:03:09,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 251 [2024-11-21 22:03:09,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:03:09,451 INFO L225 Difference]: With dead ends: 9517 [2024-11-21 22:03:09,452 INFO L226 Difference]: Without dead ends: 6333 [2024-11-21 22:03:09,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-21 22:03:09,455 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 291 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-21 22:03:09,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 192 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-21 22:03:09,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6333 states. [2024-11-21 22:03:09,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6333 to 4667. [2024-11-21 22:03:09,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4667 states, 4666 states have (on average 1.1939562794684955) internal successors, (5571), 4666 states have internal predecessors, (5571), 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-21 22:03:09,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4667 states to 4667 states and 5571 transitions. [2024-11-21 22:03:09,540 INFO L78 Accepts]: Start accepts. Automaton has 4667 states and 5571 transitions. Word has length 251 [2024-11-21 22:03:09,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:03:09,540 INFO L471 AbstractCegarLoop]: Abstraction has 4667 states and 5571 transitions. [2024-11-21 22:03:09,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:09,541 INFO L276 IsEmpty]: Start isEmpty. Operand 4667 states and 5571 transitions. [2024-11-21 22:03:09,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-21 22:03:09,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:03:09,543 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-21 22:03:09,550 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-21 22:03:09,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:03:09,748 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:03:09,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:03:09,749 INFO L85 PathProgramCache]: Analyzing trace with hash 526105738, now seen corresponding path program 1 times [2024-11-21 22:03:09,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:03:09,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961328899] [2024-11-21 22:03:09,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:09,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:03:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:09,970 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-21 22:03:09,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:03:09,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961328899] [2024-11-21 22:03:09,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961328899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:03:09,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:03:09,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:03:09,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119183130] [2024-11-21 22:03:09,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:03:09,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:03:09,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:03:09,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:03:09,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:09,972 INFO L87 Difference]: Start difference. First operand 4667 states and 5571 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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-21 22:03:10,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:03:10,484 INFO L93 Difference]: Finished difference Result 5957 states and 7065 transitions. [2024-11-21 22:03:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:03:10,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 252 [2024-11-21 22:03:10,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:03:10,498 INFO L225 Difference]: With dead ends: 5957 [2024-11-21 22:03:10,498 INFO L226 Difference]: Without dead ends: 5955 [2024-11-21 22:03:10,500 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-21 22:03:10,500 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 192 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 22:03:10,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 154 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 22:03:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5955 states. [2024-11-21 22:03:10,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5955 to 5771. [2024-11-21 22:03:10,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5771 states, 5770 states have (on average 1.1880415944540728) internal successors, (6855), 5770 states have internal predecessors, (6855), 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-21 22:03:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5771 states to 5771 states and 6855 transitions. [2024-11-21 22:03:10,566 INFO L78 Accepts]: Start accepts. Automaton has 5771 states and 6855 transitions. Word has length 252 [2024-11-21 22:03:10,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:03:10,567 INFO L471 AbstractCegarLoop]: Abstraction has 5771 states and 6855 transitions. [2024-11-21 22:03:10,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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-21 22:03:10,567 INFO L276 IsEmpty]: Start isEmpty. Operand 5771 states and 6855 transitions. [2024-11-21 22:03:10,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-21 22:03:10,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:03:10,569 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:03:10,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 22:03:10,570 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:03:10,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:03:10,570 INFO L85 PathProgramCache]: Analyzing trace with hash 170318718, now seen corresponding path program 1 times [2024-11-21 22:03:10,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:03:10,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394155304] [2024-11-21 22:03:10,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:10,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:03:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:10,969 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 56 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:03:10,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:03:10,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394155304] [2024-11-21 22:03:10,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394155304] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 22:03:10,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591180635] [2024-11-21 22:03:10,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:10,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:03:10,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:03:10,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 22:03:10,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-21 22:03:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:11,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 22:03:11,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 22:03:11,152 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-21 22:03:11,153 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 22:03:11,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591180635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:03:11,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 22:03:11,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-21 22:03:11,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305757559] [2024-11-21 22:03:11,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:03:11,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:03:11,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:03:11,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:03:11,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-21 22:03:11,154 INFO L87 Difference]: Start difference. First operand 5771 states and 6855 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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-21 22:03:11,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:03:11,806 INFO L93 Difference]: Finished difference Result 13197 states and 15677 transitions. [2024-11-21 22:03:11,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:03:11,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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 252 [2024-11-21 22:03:11,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:03:11,822 INFO L225 Difference]: With dead ends: 13197 [2024-11-21 22:03:11,822 INFO L226 Difference]: Without dead ends: 7428 [2024-11-21 22:03:11,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-21 22:03:11,827 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 186 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 22:03:11,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 127 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 22:03:11,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7428 states. [2024-11-21 22:03:11,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7428 to 4655. [2024-11-21 22:03:11,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4655 states, 4654 states have (on average 1.1931671680275033) internal successors, (5553), 4654 states have internal predecessors, (5553), 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-21 22:03:11,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4655 states to 4655 states and 5553 transitions. [2024-11-21 22:03:11,888 INFO L78 Accepts]: Start accepts. Automaton has 4655 states and 5553 transitions. Word has length 252 [2024-11-21 22:03:11,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:03:11,889 INFO L471 AbstractCegarLoop]: Abstraction has 4655 states and 5553 transitions. [2024-11-21 22:03:11,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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-21 22:03:11,889 INFO L276 IsEmpty]: Start isEmpty. Operand 4655 states and 5553 transitions. [2024-11-21 22:03:11,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-21 22:03:11,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:03:11,892 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-21 22:03:11,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-21 22:03:12,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-21 22:03:12,096 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:03:12,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:03:12,097 INFO L85 PathProgramCache]: Analyzing trace with hash -432409783, now seen corresponding path program 1 times [2024-11-21 22:03:12,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:03:12,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347073659] [2024-11-21 22:03:12,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:12,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:03:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:12,347 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-11-21 22:03:12,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:03:12,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347073659] [2024-11-21 22:03:12,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347073659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:03:12,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:03:12,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:03:12,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380543915] [2024-11-21 22:03:12,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:03:12,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:03:12,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:03:12,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:03:12,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:12,349 INFO L87 Difference]: Start difference. First operand 4655 states and 5553 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:12,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:03:12,989 INFO L93 Difference]: Finished difference Result 9304 states and 11101 transitions. [2024-11-21 22:03:12,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:03:12,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 263 [2024-11-21 22:03:12,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:03:12,990 INFO L225 Difference]: With dead ends: 9304 [2024-11-21 22:03:12,990 INFO L226 Difference]: Without dead ends: 0 [2024-11-21 22:03:12,995 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-21 22:03:12,995 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 202 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 22:03:12,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 303 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 22:03:12,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-21 22:03:12,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-21 22:03:12,996 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-21 22:03:12,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-21 22:03:12,996 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 263 [2024-11-21 22:03:12,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:03:12,997 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-21 22:03:12,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:12,997 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-21 22:03:12,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-21 22:03:12,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 22:03:13,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-21 22:03:13,002 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:03:13,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-21 22:03:13,073 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 22:03:13,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:03:13 BoogieIcfgContainer [2024-11-21 22:03:13,087 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 22:03:13,088 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 22:03:13,088 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 22:03:13,088 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 22:03:13,088 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:03:01" (3/4) ... [2024-11-21 22:03:13,090 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-21 22:03:13,106 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-21 22:03:13,107 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-21 22:03:13,107 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-21 22:03:13,108 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-21 22:03:13,282 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-21 22:03:13,282 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-21 22:03:13,282 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 22:03:13,283 INFO L158 Benchmark]: Toolchain (without parser) took 14396.48ms. Allocated memory was 176.2MB in the beginning and 610.3MB in the end (delta: 434.1MB). Free memory was 101.2MB in the beginning and 499.4MB in the end (delta: -398.2MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2024-11-21 22:03:13,283 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory was 132.9MB in the beginning and 132.7MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 22:03:13,283 INFO L158 Benchmark]: CACSL2BoogieTranslator took 581.26ms. Allocated memory is still 176.2MB. Free memory was 101.1MB in the beginning and 100.3MB in the end (delta: 754.5kB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-11-21 22:03:13,284 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.09ms. Allocated memory is still 176.2MB. Free memory was 100.3MB in the beginning and 82.7MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-21 22:03:13,284 INFO L158 Benchmark]: Boogie Preprocessor took 169.73ms. Allocated memory is still 176.2MB. Free memory was 82.7MB in the beginning and 57.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-21 22:03:13,284 INFO L158 Benchmark]: RCFGBuilder took 1378.67ms. Allocated memory was 176.2MB in the beginning and 285.2MB in the end (delta: 109.1MB). Free memory was 57.5MB in the beginning and 145.0MB in the end (delta: -87.5MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. [2024-11-21 22:03:13,285 INFO L158 Benchmark]: TraceAbstraction took 11982.45ms. Allocated memory was 285.2MB in the beginning and 610.3MB in the end (delta: 325.1MB). Free memory was 143.9MB in the beginning and 516.2MB in the end (delta: -372.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 22:03:13,285 INFO L158 Benchmark]: Witness Printer took 194.77ms. Allocated memory is still 610.3MB. Free memory was 516.2MB in the beginning and 499.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-21 22:03:13,286 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.18ms. Allocated memory is still 176.2MB. Free memory was 132.9MB in the beginning and 132.7MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 581.26ms. Allocated memory is still 176.2MB. Free memory was 101.1MB in the beginning and 100.3MB in the end (delta: 754.5kB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.09ms. Allocated memory is still 176.2MB. Free memory was 100.3MB in the beginning and 82.7MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 169.73ms. Allocated memory is still 176.2MB. Free memory was 82.7MB in the beginning and 57.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1378.67ms. Allocated memory was 176.2MB in the beginning and 285.2MB in the end (delta: 109.1MB). Free memory was 57.5MB in the beginning and 145.0MB in the end (delta: -87.5MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11982.45ms. Allocated memory was 285.2MB in the beginning and 610.3MB in the end (delta: 325.1MB). Free memory was 143.9MB in the beginning and 516.2MB in the end (delta: -372.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 194.77ms. Allocated memory is still 610.3MB. Free memory was 516.2MB in the beginning and 499.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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: 115]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.8s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1830 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1830 mSDsluCounter, 2148 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 254 mSDsCounter, 934 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6025 IncrementalHoareTripleChecker+Invalid, 6959 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 934 mSolverCounterUnsat, 1894 mSDtfsCounter, 6025 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 533 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5771occurred in iteration=8, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 5016 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 2358 NumberOfCodeBlocks, 2358 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2346 ConstructedInterpolants, 0 QuantifiedInterpolants, 10060 SizeOfPredicates, 0 NumberOfNonLiveVariables, 720 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 1182/1301 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]: Loop Invariant Derived loop invariant: ((((((a25 == 12) || (96 < a23)) || (a25 < 11)) || (a25 == 11)) || (a4 != 1)) || (a29 < 246)) RESULT: Ultimate proved your program to be correct! [2024-11-21 22:03:13,316 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