./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label22.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label22.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b6203532a9ef5ba90e15dbd2d5728025b7640a6606e85e563b08b8dcbd8cbea0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 18:37:41,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 18:37:41,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 18:37:41,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 18:37:41,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 18:37:41,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 18:37:41,412 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 18:37:41,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 18:37:41,413 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 18:37:41,416 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 18:37:41,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 18:37:41,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 18:37:41,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 18:37:41,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 18:37:41,417 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 18:37:41,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 18:37:41,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 18:37:41,417 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 18:37:41,418 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 18:37:41,418 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 18:37:41,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 18:37:41,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 18:37:41,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 18:37:41,420 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 18:37:41,420 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 18:37:41,420 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 18:37:41,421 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 18:37:41,421 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 18:37:41,421 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 18:37:41,421 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 18:37:41,421 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 18:37:41,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 18:37:41,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:37:41,422 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 18:37:41,422 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 18:37:41,422 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 18:37:41,422 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 18:37:41,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 18:37:41,423 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 18:37:41,423 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 18:37:41,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 18:37:41,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 18:37:41,424 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 -> b6203532a9ef5ba90e15dbd2d5728025b7640a6606e85e563b08b8dcbd8cbea0 [2024-11-09 18:37:41,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:37:41,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:37:41,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:37:41,692 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:37:41,692 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:37:41,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label22.c [2024-11-09 18:37:43,002 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:37:43,237 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:37:43,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label22.c [2024-11-09 18:37:43,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a97cbe28e/a424d82878cc4966a12b62e9853847e1/FLAG7a9c5af46 [2024-11-09 18:37:43,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a97cbe28e/a424d82878cc4966a12b62e9853847e1 [2024-11-09 18:37:43,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:37:43,279 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:37:43,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:37:43,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:37:43,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:37:43,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:37:43" (1/1) ... [2024-11-09 18:37:43,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f534456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:43, skipping insertion in model container [2024-11-09 18:37:43,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:37:43" (1/1) ... [2024-11-09 18:37:43,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:37:43,609 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/Problem02_label22.c[16445,16458] [2024-11-09 18:37:43,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:37:43,678 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:37:43,754 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/Problem02_label22.c[16445,16458] [2024-11-09 18:37:43,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:37:43,792 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:37:43,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:43 WrapperNode [2024-11-09 18:37:43,792 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:37:43,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:37:43,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:37:43,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:37:43,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:43" (1/1) ... [2024-11-09 18:37:43,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:43" (1/1) ... [2024-11-09 18:37:43,854 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-09 18:37:43,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:37:43,855 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:37:43,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:37:43,855 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:37:43,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:43" (1/1) ... [2024-11-09 18:37:43,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:43" (1/1) ... [2024-11-09 18:37:43,872 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:43" (1/1) ... [2024-11-09 18:37:43,895 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 18:37:43,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:43" (1/1) ... [2024-11-09 18:37:43,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:43" (1/1) ... [2024-11-09 18:37:43,918 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:43" (1/1) ... [2024-11-09 18:37:43,923 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:43" (1/1) ... [2024-11-09 18:37:43,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:43" (1/1) ... [2024-11-09 18:37:43,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:43" (1/1) ... [2024-11-09 18:37:43,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:37:43,939 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:37:43,939 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:37:43,939 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:37:43,940 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:43" (1/1) ... [2024-11-09 18:37:43,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:37:43,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:37:43,973 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 18:37:43,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 18:37:44,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:37:44,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 18:37:44,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:37:44,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:37:44,124 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:37:44,126 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:37:44,876 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-09 18:37:44,879 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:37:44,928 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:37:44,928 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 18:37:44,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:37:44 BoogieIcfgContainer [2024-11-09 18:37:44,929 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:37:44,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:37:44,935 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:37:44,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:37:44,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:37:43" (1/3) ... [2024-11-09 18:37:44,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217d2093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:37:44, skipping insertion in model container [2024-11-09 18:37:44,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:43" (2/3) ... [2024-11-09 18:37:44,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217d2093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:37:44, skipping insertion in model container [2024-11-09 18:37:44,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:37:44" (3/3) ... [2024-11-09 18:37:44,940 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label22.c [2024-11-09 18:37:44,953 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:37:44,954 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:37:45,016 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:37:45,022 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;@479b1639, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:37:45,022 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:37:45,029 INFO L276 IsEmpty]: Start isEmpty. Operand has 230 states, 228 states have (on average 1.6578947368421053) internal successors, (378), 229 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:45,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 18:37:45,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:45,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:37:45,041 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:45,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:45,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1468232787, now seen corresponding path program 1 times [2024-11-09 18:37:45,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:45,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807487979] [2024-11-09 18:37:45,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:45,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:45,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:45,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:45,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807487979] [2024-11-09 18:37:45,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807487979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:45,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:45,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:37:45,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125969655] [2024-11-09 18:37:45,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:45,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:45,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:45,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:45,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:45,720 INFO L87 Difference]: Start difference. First operand has 230 states, 228 states have (on average 1.6578947368421053) internal successors, (378), 229 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-09 18:37:46,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:46,474 INFO L93 Difference]: Finished difference Result 602 states and 1036 transitions. [2024-11-09 18:37:46,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:46,476 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-09 18:37:46,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:46,485 INFO L225 Difference]: With dead ends: 602 [2024-11-09 18:37:46,486 INFO L226 Difference]: Without dead ends: 308 [2024-11-09 18:37:46,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:46,495 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 147 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:46,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 93 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 18:37:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-09 18:37:46,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-11-09 18:37:46,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.521172638436482) internal successors, (467), 307 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:46,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 467 transitions. [2024-11-09 18:37:46,540 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 467 transitions. Word has length 99 [2024-11-09 18:37:46,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:46,540 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 467 transitions. [2024-11-09 18:37:46,541 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-09 18:37:46,541 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 467 transitions. [2024-11-09 18:37:46,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 18:37:46,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:46,544 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:37:46,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 18:37:46,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:46,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:46,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1995159832, now seen corresponding path program 1 times [2024-11-09 18:37:46,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:46,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379696178] [2024-11-09 18:37:46,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:46,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:46,635 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:46,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:46,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379696178] [2024-11-09 18:37:46,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379696178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:46,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:46,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:37:46,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788357818] [2024-11-09 18:37:46,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:46,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:46,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:46,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:46,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:46,638 INFO L87 Difference]: Start difference. First operand 308 states and 467 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:47,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:47,034 INFO L93 Difference]: Finished difference Result 911 states and 1384 transitions. [2024-11-09 18:37:47,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:47,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-11-09 18:37:47,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:47,037 INFO L225 Difference]: With dead ends: 911 [2024-11-09 18:37:47,037 INFO L226 Difference]: Without dead ends: 605 [2024-11-09 18:37:47,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:47,043 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 194 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:47,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 75 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:37:47,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-09 18:37:47,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 601. [2024-11-09 18:37:47,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 600 states have (on average 1.4733333333333334) internal successors, (884), 600 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 884 transitions. [2024-11-09 18:37:47,076 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 884 transitions. Word has length 111 [2024-11-09 18:37:47,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:47,076 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 884 transitions. [2024-11-09 18:37:47,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:47,076 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 884 transitions. [2024-11-09 18:37:47,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 18:37:47,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:47,086 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:37:47,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 18:37:47,087 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:47,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:47,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1783667620, now seen corresponding path program 1 times [2024-11-09 18:37:47,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:47,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835255084] [2024-11-09 18:37:47,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:47,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:47,241 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 18:37:47,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:47,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835255084] [2024-11-09 18:37:47,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835255084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:47,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:47,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:37:47,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400090955] [2024-11-09 18:37:47,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:47,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:47,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:47,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:47,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:47,247 INFO L87 Difference]: Start difference. First operand 601 states and 884 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:47,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:47,422 INFO L93 Difference]: Finished difference Result 1049 states and 1550 transitions. [2024-11-09 18:37:47,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:47,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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 116 [2024-11-09 18:37:47,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:47,424 INFO L225 Difference]: With dead ends: 1049 [2024-11-09 18:37:47,424 INFO L226 Difference]: Without dead ends: 450 [2024-11-09 18:37:47,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:47,426 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 201 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:47,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 25 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:37:47,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-09 18:37:47,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2024-11-09 18:37:47,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 1.4209354120267261) internal successors, (638), 449 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:47,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 638 transitions. [2024-11-09 18:37:47,433 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 638 transitions. Word has length 116 [2024-11-09 18:37:47,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:47,434 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 638 transitions. [2024-11-09 18:37:47,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:47,434 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 638 transitions. [2024-11-09 18:37:47,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 18:37:47,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:47,435 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 18:37:47,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 18:37:47,435 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:47,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:47,436 INFO L85 PathProgramCache]: Analyzing trace with hash 974501687, now seen corresponding path program 1 times [2024-11-09 18:37:47,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:47,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220682464] [2024-11-09 18:37:47,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:47,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:47,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:47,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220682464] [2024-11-09 18:37:47,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220682464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:47,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:47,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:37:47,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719351556] [2024-11-09 18:37:47,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:47,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:47,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:47,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:47,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:47,565 INFO L87 Difference]: Start difference. First operand 450 states and 638 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:47,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:47,874 INFO L93 Difference]: Finished difference Result 1338 states and 1900 transitions. [2024-11-09 18:37:47,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:47,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-11-09 18:37:47,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:47,876 INFO L225 Difference]: With dead ends: 1338 [2024-11-09 18:37:47,877 INFO L226 Difference]: Without dead ends: 890 [2024-11-09 18:37:47,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:47,878 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 149 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:47,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 89 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:37:47,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-11-09 18:37:47,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 882. [2024-11-09 18:37:47,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 1.3700340522133938) internal successors, (1207), 881 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:47,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1207 transitions. [2024-11-09 18:37:47,888 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1207 transitions. Word has length 118 [2024-11-09 18:37:47,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:47,889 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1207 transitions. [2024-11-09 18:37:47,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:47,889 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1207 transitions. [2024-11-09 18:37:47,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 18:37:47,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:47,890 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:37:47,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 18:37:47,891 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:47,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:47,891 INFO L85 PathProgramCache]: Analyzing trace with hash -926172543, now seen corresponding path program 1 times [2024-11-09 18:37:47,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:47,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183412531] [2024-11-09 18:37:47,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:47,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:47,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:47,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183412531] [2024-11-09 18:37:47,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183412531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:47,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:47,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:37:47,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156328237] [2024-11-09 18:37:47,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:47,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:47,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:47,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:47,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:47,946 INFO L87 Difference]: Start difference. First operand 882 states and 1207 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:48,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:48,286 INFO L93 Difference]: Finished difference Result 2611 states and 3578 transitions. [2024-11-09 18:37:48,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:48,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2024-11-09 18:37:48,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:48,290 INFO L225 Difference]: With dead ends: 2611 [2024-11-09 18:37:48,290 INFO L226 Difference]: Without dead ends: 1731 [2024-11-09 18:37:48,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:48,294 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 159 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:48,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 65 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:37:48,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2024-11-09 18:37:48,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1731. [2024-11-09 18:37:48,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1731 states, 1730 states have (on average 1.2936416184971098) internal successors, (2238), 1730 states have internal predecessors, (2238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:48,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2238 transitions. [2024-11-09 18:37:48,318 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2238 transitions. Word has length 122 [2024-11-09 18:37:48,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:48,319 INFO L471 AbstractCegarLoop]: Abstraction has 1731 states and 2238 transitions. [2024-11-09 18:37:48,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:48,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2238 transitions. [2024-11-09 18:37:48,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 18:37:48,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:48,322 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-09 18:37:48,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 18:37:48,322 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:48,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:48,322 INFO L85 PathProgramCache]: Analyzing trace with hash -378546437, now seen corresponding path program 1 times [2024-11-09 18:37:48,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:48,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046853863] [2024-11-09 18:37:48,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:48,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:48,436 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:48,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:48,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046853863] [2024-11-09 18:37:48,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046853863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:48,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:48,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:37:48,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849023992] [2024-11-09 18:37:48,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:48,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:48,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:48,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:48,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:48,439 INFO L87 Difference]: Start difference. First operand 1731 states and 2238 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:48,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:48,867 INFO L93 Difference]: Finished difference Result 4305 states and 5559 transitions. [2024-11-09 18:37:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:48,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2024-11-09 18:37:48,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:48,874 INFO L225 Difference]: With dead ends: 4305 [2024-11-09 18:37:48,875 INFO L226 Difference]: Without dead ends: 2576 [2024-11-09 18:37:48,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:48,878 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 138 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:48,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 76 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:37:48,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2024-11-09 18:37:48,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 2576. [2024-11-09 18:37:48,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2576 states, 2575 states have (on average 1.2236893203883494) internal successors, (3151), 2575 states have internal predecessors, (3151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 3151 transitions. [2024-11-09 18:37:48,914 INFO L78 Accepts]: Start accepts. Automaton has 2576 states and 3151 transitions. Word has length 123 [2024-11-09 18:37:48,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:48,914 INFO L471 AbstractCegarLoop]: Abstraction has 2576 states and 3151 transitions. [2024-11-09 18:37:48,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:48,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 3151 transitions. [2024-11-09 18:37:48,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 18:37:48,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:48,917 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:37:48,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 18:37:48,918 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:48,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:48,918 INFO L85 PathProgramCache]: Analyzing trace with hash -486646681, now seen corresponding path program 1 times [2024-11-09 18:37:48,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:48,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624741577] [2024-11-09 18:37:48,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:48,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:49,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:49,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624741577] [2024-11-09 18:37:49,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624741577] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:37:49,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947927816] [2024-11-09 18:37:49,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:49,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:37:49,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:37:49,190 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:37:49,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 18:37:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:49,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 18:37:49,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:37:49,427 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:37:49,427 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:37:49,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947927816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:49,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:37:49,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 18:37:49,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467470581] [2024-11-09 18:37:49,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:49,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:49,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:49,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:49,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:37:49,429 INFO L87 Difference]: Start difference. First operand 2576 states and 3151 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:49,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:49,763 INFO L93 Difference]: Finished difference Result 5148 states and 6298 transitions. [2024-11-09 18:37:49,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:49,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2024-11-09 18:37:49,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:49,771 INFO L225 Difference]: With dead ends: 5148 [2024-11-09 18:37:49,771 INFO L226 Difference]: Without dead ends: 2574 [2024-11-09 18:37:49,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:37:49,776 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 63 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:49,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 217 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:37:49,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2024-11-09 18:37:49,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 2433. [2024-11-09 18:37:49,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2433 states, 2432 states have (on average 1.1529605263157894) internal successors, (2804), 2432 states have internal predecessors, (2804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:49,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 2804 transitions. [2024-11-09 18:37:49,805 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 2804 transitions. Word has length 128 [2024-11-09 18:37:49,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:49,805 INFO L471 AbstractCegarLoop]: Abstraction has 2433 states and 2804 transitions. [2024-11-09 18:37:49,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:49,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 2804 transitions. [2024-11-09 18:37:49,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 18:37:49,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:49,808 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:37:49,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 18:37:50,008 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-09 18:37:50,009 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:50,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:50,010 INFO L85 PathProgramCache]: Analyzing trace with hash -243395419, now seen corresponding path program 1 times [2024-11-09 18:37:50,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:50,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352632004] [2024-11-09 18:37:50,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:50,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:50,110 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:50,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:50,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352632004] [2024-11-09 18:37:50,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352632004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:50,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:50,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:37:50,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064174229] [2024-11-09 18:37:50,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:50,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:50,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:50,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:50,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:50,112 INFO L87 Difference]: Start difference. First operand 2433 states and 2804 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:50,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:50,435 INFO L93 Difference]: Finished difference Result 5141 states and 5952 transitions. [2024-11-09 18:37:50,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:50,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2024-11-09 18:37:50,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:50,441 INFO L225 Difference]: With dead ends: 5141 [2024-11-09 18:37:50,441 INFO L226 Difference]: Without dead ends: 2710 [2024-11-09 18:37:50,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:50,444 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:50,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 41 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:37:50,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2710 states. [2024-11-09 18:37:50,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2710 to 2710. [2024-11-09 18:37:50,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2710 states, 2709 states have (on average 1.1498708010335916) internal successors, (3115), 2709 states have internal predecessors, (3115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:50,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3115 transitions. [2024-11-09 18:37:50,490 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3115 transitions. Word has length 137 [2024-11-09 18:37:50,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:50,491 INFO L471 AbstractCegarLoop]: Abstraction has 2710 states and 3115 transitions. [2024-11-09 18:37:50,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:50,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3115 transitions. [2024-11-09 18:37:50,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 18:37:50,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:50,497 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:37:50,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 18:37:50,497 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:50,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:50,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1516155857, now seen corresponding path program 1 times [2024-11-09 18:37:50,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:50,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209170167] [2024-11-09 18:37:50,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:50,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:50,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:50,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209170167] [2024-11-09 18:37:50,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209170167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:50,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:50,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:37:50,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361626253] [2024-11-09 18:37:50,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:50,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:50,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:50,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:50,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:50,615 INFO L87 Difference]: Start difference. First operand 2710 states and 3115 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:51,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:51,072 INFO L93 Difference]: Finished difference Result 5276 states and 6071 transitions. [2024-11-09 18:37:51,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:51,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2024-11-09 18:37:51,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:51,082 INFO L225 Difference]: With dead ends: 5276 [2024-11-09 18:37:51,082 INFO L226 Difference]: Without dead ends: 2568 [2024-11-09 18:37:51,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:51,090 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 129 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:51,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 240 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:37:51,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2024-11-09 18:37:51,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2421. [2024-11-09 18:37:51,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2421 states, 2420 states have (on average 1.1165289256198347) internal successors, (2702), 2420 states have internal predecessors, (2702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 2702 transitions. [2024-11-09 18:37:51,168 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 2702 transitions. Word has length 141 [2024-11-09 18:37:51,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:51,168 INFO L471 AbstractCegarLoop]: Abstraction has 2421 states and 2702 transitions. [2024-11-09 18:37:51,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:51,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 2702 transitions. [2024-11-09 18:37:51,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-09 18:37:51,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:51,175 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-09 18:37:51,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 18:37:51,176 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:51,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:51,176 INFO L85 PathProgramCache]: Analyzing trace with hash -915895309, now seen corresponding path program 1 times [2024-11-09 18:37:51,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:51,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409968332] [2024-11-09 18:37:51,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:51,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:37:51,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:51,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409968332] [2024-11-09 18:37:51,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409968332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:51,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:51,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:37:51,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887370502] [2024-11-09 18:37:51,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:51,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:51,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:51,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:51,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:51,394 INFO L87 Difference]: Start difference. First operand 2421 states and 2702 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:51,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:51,842 INFO L93 Difference]: Finished difference Result 3986 states and 4443 transitions. [2024-11-09 18:37:51,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:51,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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 195 [2024-11-09 18:37:51,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:51,851 INFO L225 Difference]: With dead ends: 3986 [2024-11-09 18:37:51,855 INFO L226 Difference]: Without dead ends: 2137 [2024-11-09 18:37:51,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:51,857 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 81 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:51,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 231 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:37:51,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2024-11-09 18:37:51,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 2137. [2024-11-09 18:37:51,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2137 states, 2136 states have (on average 1.097378277153558) internal successors, (2344), 2136 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:51,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 2344 transitions. [2024-11-09 18:37:51,901 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 2344 transitions. Word has length 195 [2024-11-09 18:37:51,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:51,901 INFO L471 AbstractCegarLoop]: Abstraction has 2137 states and 2344 transitions. [2024-11-09 18:37:51,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:51,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 2344 transitions. [2024-11-09 18:37:51,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-09 18:37:51,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:51,908 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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-09 18:37:51,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 18:37:51,908 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:51,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:51,912 INFO L85 PathProgramCache]: Analyzing trace with hash 858379132, now seen corresponding path program 1 times [2024-11-09 18:37:51,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:51,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394838537] [2024-11-09 18:37:51,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:51,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:52,098 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-09 18:37:52,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:52,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394838537] [2024-11-09 18:37:52,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394838537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:52,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:52,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:37:52,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922155641] [2024-11-09 18:37:52,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:52,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:52,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:52,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:52,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:52,105 INFO L87 Difference]: Start difference. First operand 2137 states and 2344 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:52,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:52,561 INFO L93 Difference]: Finished difference Result 2846 states and 3103 transitions. [2024-11-09 18:37:52,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:52,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2024-11-09 18:37:52,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:52,565 INFO L225 Difference]: With dead ends: 2846 [2024-11-09 18:37:52,565 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 18:37:52,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:52,568 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 111 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:52,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 217 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:37:52,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 18:37:52,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 18:37:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:52,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 18:37:52,573 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 204 [2024-11-09 18:37:52,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:52,573 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 18:37:52,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:52,573 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 18:37:52,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 18:37:52,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 18:37:52,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 18:37:52,578 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:37:52,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 18:37:52,851 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 18:37:52,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:37:52 BoogieIcfgContainer [2024-11-09 18:37:52,870 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 18:37:52,870 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 18:37:52,871 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 18:37:52,871 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 18:37:52,871 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:37:44" (3/4) ... [2024-11-09 18:37:52,872 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 18:37:52,891 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 18:37:52,892 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 18:37:52,893 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 18:37:52,897 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 18:37:53,024 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 18:37:53,025 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 18:37:53,025 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 18:37:53,026 INFO L158 Benchmark]: Toolchain (without parser) took 9747.14ms. Allocated memory was 161.5MB in the beginning and 333.4MB in the end (delta: 172.0MB). Free memory was 107.7MB in the beginning and 195.0MB in the end (delta: -87.3MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. [2024-11-09 18:37:53,026 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 100.7MB. Free memory was 61.5MB in the beginning and 61.4MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:37:53,026 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.07ms. Allocated memory is still 161.5MB. Free memory was 107.2MB in the beginning and 121.0MB in the end (delta: -13.8MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-11-09 18:37:53,026 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.13ms. Allocated memory is still 161.5MB. Free memory was 121.0MB in the beginning and 115.7MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 18:37:53,027 INFO L158 Benchmark]: Boogie Preprocessor took 83.73ms. Allocated memory is still 161.5MB. Free memory was 115.7MB in the beginning and 111.4MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 18:37:53,027 INFO L158 Benchmark]: IcfgBuilder took 989.82ms. Allocated memory was 161.5MB in the beginning and 213.9MB in the end (delta: 52.4MB). Free memory was 111.4MB in the beginning and 173.7MB in the end (delta: -62.3MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. [2024-11-09 18:37:53,027 INFO L158 Benchmark]: TraceAbstraction took 7935.69ms. Allocated memory was 213.9MB in the beginning and 333.4MB in the end (delta: 119.5MB). Free memory was 173.7MB in the beginning and 207.6MB in the end (delta: -33.9MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. [2024-11-09 18:37:53,027 INFO L158 Benchmark]: Witness Printer took 154.79ms. Allocated memory is still 333.4MB. Free memory was 207.6MB in the beginning and 195.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 18:37:53,028 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.13ms. Allocated memory is still 100.7MB. Free memory was 61.5MB in the beginning and 61.4MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 513.07ms. Allocated memory is still 161.5MB. Free memory was 107.2MB in the beginning and 121.0MB in the end (delta: -13.8MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.13ms. Allocated memory is still 161.5MB. Free memory was 121.0MB in the beginning and 115.7MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.73ms. Allocated memory is still 161.5MB. Free memory was 115.7MB in the beginning and 111.4MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 989.82ms. Allocated memory was 161.5MB in the beginning and 213.9MB in the end (delta: 52.4MB). Free memory was 111.4MB in the beginning and 173.7MB in the end (delta: -62.3MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7935.69ms. Allocated memory was 213.9MB in the beginning and 333.4MB in the end (delta: 119.5MB). Free memory was 173.7MB in the beginning and 207.6MB in the end (delta: -33.9MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. * Witness Printer took 154.79ms. Allocated memory is still 333.4MB. Free memory was 207.6MB in the beginning and 195.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 473]: 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, 230 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1514 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1514 mSDsluCounter, 1369 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 151 mSDsCounter, 618 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3696 IncrementalHoareTripleChecker+Invalid, 4314 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 618 mSolverCounterUnsat, 1218 mSDtfsCounter, 3696 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2710occurred in iteration=8, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 300 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1622 NumberOfCodeBlocks, 1622 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1610 ConstructedInterpolants, 0 QuantifiedInterpolants, 4316 SizeOfPredicates, 0 NumberOfNonLiveVariables, 254 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 519/537 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: 616]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 18:37:53,068 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