./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label30.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/Problem14_label30.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 46305506117a7249be58d8d8d8c60453578281c1cbb0dca593851bdc92c5fe11 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:38:04,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:38:04,372 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:38:04,377 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:38:04,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:38:04,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:38:04,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:38:04,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:38:04,416 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:38:04,417 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:38:04,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:38:04,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:38:04,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:38:04,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:38:04,420 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:38:04,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:38:04,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:38:04,421 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:38:04,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:38:04,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:38:04,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:38:04,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:38:04,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:38:04,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:38:04,425 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:38:04,425 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:38:04,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:38:04,426 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:38:04,426 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:38:04,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:38:04,426 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:38:04,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:38:04,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:38:04,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:38:04,427 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:38:04,427 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:38:04,427 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:38:04,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:38:04,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:38:04,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:38:04,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:38:04,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:38:04,429 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 -> 46305506117a7249be58d8d8d8c60453578281c1cbb0dca593851bdc92c5fe11 [2024-11-09 19:38:04,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:38:04,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:38:04,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:38:04,680 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:38:04,680 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:38:04,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label30.c [2024-11-09 19:38:06,041 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:38:06,415 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:38:06,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label30.c [2024-11-09 19:38:06,448 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad589c206/2c60c5248c9843c08b1929c8f8b7529e/FLAG544380743 [2024-11-09 19:38:06,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad589c206/2c60c5248c9843c08b1929c8f8b7529e [2024-11-09 19:38:06,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:38:06,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:38:06,494 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:38:06,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:38:06,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:38:06,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:38:06" (1/1) ... [2024-11-09 19:38:06,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b06830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:06, skipping insertion in model container [2024-11-09 19:38:06,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:38:06" (1/1) ... [2024-11-09 19:38:06,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:38:06,731 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/Problem14_label30.c[4533,4546] [2024-11-09 19:38:06,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:38:06,858 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:38:06,875 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/Problem14_label30.c[4533,4546] [2024-11-09 19:38:06,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:38:06,939 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:38:06,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:06 WrapperNode [2024-11-09 19:38:06,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:38:06,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:38:06,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:38:06,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:38:06,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:06" (1/1) ... [2024-11-09 19:38:06,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:06" (1/1) ... [2024-11-09 19:38:07,021 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 858 [2024-11-09 19:38:07,022 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:38:07,023 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:38:07,023 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:38:07,023 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:38:07,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:06" (1/1) ... [2024-11-09 19:38:07,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:06" (1/1) ... [2024-11-09 19:38:07,042 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:06" (1/1) ... [2024-11-09 19:38:07,083 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 19:38:07,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:06" (1/1) ... [2024-11-09 19:38:07,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:06" (1/1) ... [2024-11-09 19:38:07,107 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:06" (1/1) ... [2024-11-09 19:38:07,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:06" (1/1) ... [2024-11-09 19:38:07,116 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:06" (1/1) ... [2024-11-09 19:38:07,124 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:06" (1/1) ... [2024-11-09 19:38:07,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:38:07,132 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:38:07,133 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:38:07,133 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:38:07,134 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:06" (1/1) ... [2024-11-09 19:38:07,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:38:07,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:38:07,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 19:38:07,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 19:38:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:38:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:38:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:38:07,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:38:07,294 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:38:07,296 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:38:08,265 INFO L? ?]: Removed 236 outVars from TransFormulas that were not future-live. [2024-11-09 19:38:08,265 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:38:08,279 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:38:08,279 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:38:08,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:38:08 BoogieIcfgContainer [2024-11-09 19:38:08,280 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:38:08,281 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:38:08,281 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:38:08,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:38:08,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:38:06" (1/3) ... [2024-11-09 19:38:08,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8dbd0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:38:08, skipping insertion in model container [2024-11-09 19:38:08,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:06" (2/3) ... [2024-11-09 19:38:08,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8dbd0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:38:08, skipping insertion in model container [2024-11-09 19:38:08,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:38:08" (3/3) ... [2024-11-09 19:38:08,286 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label30.c [2024-11-09 19:38:08,299 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:38:08,299 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:38:08,346 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:38:08,351 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;@7889c3ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:38:08,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:38:08,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 248 states, 246 states have (on average 2.186991869918699) internal successors, (538), 247 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:08,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 19:38:08,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:38:08,362 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] [2024-11-09 19:38:08,363 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:38:08,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:38:08,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1045553200, now seen corresponding path program 1 times [2024-11-09 19:38:08,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:38:08,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027875467] [2024-11-09 19:38:08,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:38:08,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:38:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:38:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:38:08,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:38:08,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027875467] [2024-11-09 19:38:08,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027875467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:38:08,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:38:08,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:38:08,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893703954] [2024-11-09 19:38:08,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:38:08,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:38:08,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:38:08,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:38:08,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:38:08,728 INFO L87 Difference]: Start difference. First operand has 248 states, 246 states have (on average 2.186991869918699) internal successors, (538), 247 states have internal predecessors, (538), 0 states have call successors, (0), 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 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:09,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:38:09,599 INFO L93 Difference]: Finished difference Result 675 states and 1545 transitions. [2024-11-09 19:38:09,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:38:09,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2024-11-09 19:38:09,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:38:09,611 INFO L225 Difference]: With dead ends: 675 [2024-11-09 19:38:09,611 INFO L226 Difference]: Without dead ends: 363 [2024-11-09 19:38:09,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:38:09,617 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 276 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:38:09,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 81 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:38:09,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-09 19:38:09,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2024-11-09 19:38:09,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 362 states have (on average 2.2569060773480665) internal successors, (817), 362 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:09,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 817 transitions. [2024-11-09 19:38:09,664 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 817 transitions. Word has length 45 [2024-11-09 19:38:09,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:38:09,665 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 817 transitions. [2024-11-09 19:38:09,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:09,665 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 817 transitions. [2024-11-09 19:38:09,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 19:38:09,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:38:09,668 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:38:09,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:38:09,669 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:38:09,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:38:09,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1206546025, now seen corresponding path program 1 times [2024-11-09 19:38:09,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:38:09,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937693877] [2024-11-09 19:38:09,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:38:09,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:38:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:38:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:38:09,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:38:09,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937693877] [2024-11-09 19:38:09,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937693877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:38:09,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:38:09,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:38:09,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824427275] [2024-11-09 19:38:09,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:38:09,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:38:09,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:38:09,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:38:09,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:38:09,840 INFO L87 Difference]: Start difference. First operand 363 states and 817 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 19:38:10,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:38:10,600 INFO L93 Difference]: Finished difference Result 1082 states and 2445 transitions. [2024-11-09 19:38:10,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:38:10,601 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 19:38:10,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:38:10,605 INFO L225 Difference]: With dead ends: 1082 [2024-11-09 19:38:10,605 INFO L226 Difference]: Without dead ends: 721 [2024-11-09 19:38:10,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:38:10,613 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 245 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:38:10,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 93 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:38:10,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2024-11-09 19:38:10,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 542. [2024-11-09 19:38:10,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 2.1164510166358594) internal successors, (1145), 541 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:10,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1145 transitions. [2024-11-09 19:38:10,638 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1145 transitions. Word has length 111 [2024-11-09 19:38:10,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:38:10,638 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 1145 transitions. [2024-11-09 19:38:10,639 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 19:38:10,639 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1145 transitions. [2024-11-09 19:38:10,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 19:38:10,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:38:10,641 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:38:10,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:38:10,642 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:38:10,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:38:10,642 INFO L85 PathProgramCache]: Analyzing trace with hash 663590657, now seen corresponding path program 1 times [2024-11-09 19:38:10,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:38:10,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076498552] [2024-11-09 19:38:10,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:38:10,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:38:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:38:10,855 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:38:10,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:38:10,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076498552] [2024-11-09 19:38:10,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076498552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:38:10,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:38:10,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:38:10,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879313724] [2024-11-09 19:38:10,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:38:10,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:38:10,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:38:10,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:38:10,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:38:10,858 INFO L87 Difference]: Start difference. First operand 542 states and 1145 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:11,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:38:11,947 INFO L93 Difference]: Finished difference Result 1440 states and 2944 transitions. [2024-11-09 19:38:11,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:38:11,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-11-09 19:38:11,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:38:11,950 INFO L225 Difference]: With dead ends: 1440 [2024-11-09 19:38:11,950 INFO L226 Difference]: Without dead ends: 900 [2024-11-09 19:38:11,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:38:11,971 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 760 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 1428 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:38:11,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 128 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1428 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:38:11,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2024-11-09 19:38:12,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 900. [2024-11-09 19:38:12,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 899 states have (on average 1.9632925472747498) internal successors, (1765), 899 states have internal predecessors, (1765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1765 transitions. [2024-11-09 19:38:12,018 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1765 transitions. Word has length 125 [2024-11-09 19:38:12,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:38:12,019 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1765 transitions. [2024-11-09 19:38:12,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:12,019 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1765 transitions. [2024-11-09 19:38:12,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-09 19:38:12,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:38:12,029 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:38:12,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:38:12,029 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:38:12,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:38:12,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1156662884, now seen corresponding path program 1 times [2024-11-09 19:38:12,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:38:12,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438455215] [2024-11-09 19:38:12,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:38:12,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:38:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:38:12,290 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 19:38:12,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:38:12,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438455215] [2024-11-09 19:38:12,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438455215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:38:12,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:38:12,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:38:12,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927946912] [2024-11-09 19:38:12,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:38:12,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:38:12,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:38:12,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:38:12,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:38:12,293 INFO L87 Difference]: Start difference. First operand 900 states and 1765 transitions. Second operand has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:13,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:38:13,081 INFO L93 Difference]: Finished difference Result 2007 states and 3886 transitions. [2024-11-09 19:38:13,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:38:13,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 206 [2024-11-09 19:38:13,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:38:13,085 INFO L225 Difference]: With dead ends: 2007 [2024-11-09 19:38:13,086 INFO L226 Difference]: Without dead ends: 1079 [2024-11-09 19:38:13,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:38:13,088 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 229 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:38:13,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 125 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:38:13,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2024-11-09 19:38:13,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2024-11-09 19:38:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 1078 states have (on average 1.8079777365491652) internal successors, (1949), 1078 states have internal predecessors, (1949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1949 transitions. [2024-11-09 19:38:13,106 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1949 transitions. Word has length 206 [2024-11-09 19:38:13,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:38:13,106 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1949 transitions. [2024-11-09 19:38:13,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:13,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1949 transitions. [2024-11-09 19:38:13,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-09 19:38:13,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:38:13,108 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2024-11-09 19:38:13,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:38:13,109 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:38:13,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:38:13,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1001365206, now seen corresponding path program 1 times [2024-11-09 19:38:13,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:38:13,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936851479] [2024-11-09 19:38:13,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:38:13,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:38:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:38:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 83 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:38:13,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:38:13,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936851479] [2024-11-09 19:38:13,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936851479] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:38:13,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916320088] [2024-11-09 19:38:13,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:38:13,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:38:13,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:38:13,333 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:38:13,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 19:38:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:38:13,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:38:13,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:38:13,642 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-09 19:38:13,643 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:38:13,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916320088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:38:13,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:38:13,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-09 19:38:13,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285257145] [2024-11-09 19:38:13,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:38:13,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:38:13,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:38:13,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:38:13,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:38:13,646 INFO L87 Difference]: Start difference. First operand 1079 states and 1949 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:38:14,265 INFO L93 Difference]: Finished difference Result 2335 states and 4263 transitions. [2024-11-09 19:38:14,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:38:14,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 218 [2024-11-09 19:38:14,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:38:14,270 INFO L225 Difference]: With dead ends: 2335 [2024-11-09 19:38:14,270 INFO L226 Difference]: Without dead ends: 1258 [2024-11-09 19:38:14,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:38:14,272 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 198 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:38:14,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 50 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:38:14,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2024-11-09 19:38:14,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1079. [2024-11-09 19:38:14,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 1078 states have (on average 1.794990723562152) internal successors, (1935), 1078 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1935 transitions. [2024-11-09 19:38:14,288 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1935 transitions. Word has length 218 [2024-11-09 19:38:14,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:38:14,288 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1935 transitions. [2024-11-09 19:38:14,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:14,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1935 transitions. [2024-11-09 19:38:14,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-09 19:38:14,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:38:14,290 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:38:14,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 19:38:14,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:38:14,492 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:38:14,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:38:14,492 INFO L85 PathProgramCache]: Analyzing trace with hash 962650306, now seen corresponding path program 1 times [2024-11-09 19:38:14,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:38:14,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532370830] [2024-11-09 19:38:14,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:38:14,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:38:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:38:14,660 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:38:14,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:38:14,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532370830] [2024-11-09 19:38:14,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532370830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:38:14,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:38:14,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:38:14,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632745704] [2024-11-09 19:38:14,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:38:14,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:38:14,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:38:14,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:38:14,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:38:14,663 INFO L87 Difference]: Start difference. First operand 1079 states and 1935 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:15,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:38:15,277 INFO L93 Difference]: Finished difference Result 2872 states and 5188 transitions. [2024-11-09 19:38:15,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:38:15,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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 221 [2024-11-09 19:38:15,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:38:15,283 INFO L225 Difference]: With dead ends: 2872 [2024-11-09 19:38:15,283 INFO L226 Difference]: Without dead ends: 1795 [2024-11-09 19:38:15,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:38:15,284 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 226 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:38:15,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 79 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:38:15,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2024-11-09 19:38:15,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1795. [2024-11-09 19:38:15,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1794 states have (on average 1.758082497212932) internal successors, (3154), 1794 states have internal predecessors, (3154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:15,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 3154 transitions. [2024-11-09 19:38:15,306 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 3154 transitions. Word has length 221 [2024-11-09 19:38:15,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:38:15,306 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 3154 transitions. [2024-11-09 19:38:15,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:15,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 3154 transitions. [2024-11-09 19:38:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-09 19:38:15,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:38:15,309 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:38:15,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:38:15,309 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:38:15,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:38:15,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1662471491, now seen corresponding path program 1 times [2024-11-09 19:38:15,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:38:15,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414479718] [2024-11-09 19:38:15,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:38:15,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:38:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:38:15,583 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2024-11-09 19:38:15,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:38:15,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414479718] [2024-11-09 19:38:15,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414479718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:38:15,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:38:15,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:38:15,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087692132] [2024-11-09 19:38:15,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:38:15,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:38:15,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:38:15,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:38:15,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:38:15,585 INFO L87 Difference]: Start difference. First operand 1795 states and 3154 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:16,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:38:16,273 INFO L93 Difference]: Finished difference Result 3648 states and 6389 transitions. [2024-11-09 19:38:16,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:38:16,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 339 [2024-11-09 19:38:16,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:38:16,279 INFO L225 Difference]: With dead ends: 3648 [2024-11-09 19:38:16,279 INFO L226 Difference]: Without dead ends: 1974 [2024-11-09 19:38:16,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:38:16,282 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 255 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:38:16,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 23 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:38:16,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2024-11-09 19:38:16,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1795. [2024-11-09 19:38:16,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1794 states have (on average 1.714046822742475) internal successors, (3075), 1794 states have internal predecessors, (3075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:16,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 3075 transitions. [2024-11-09 19:38:16,304 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 3075 transitions. Word has length 339 [2024-11-09 19:38:16,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:38:16,304 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 3075 transitions. [2024-11-09 19:38:16,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:16,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 3075 transitions. [2024-11-09 19:38:16,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2024-11-09 19:38:16,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:38:16,308 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:38:16,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:38:16,309 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:38:16,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:38:16,309 INFO L85 PathProgramCache]: Analyzing trace with hash 227059908, now seen corresponding path program 1 times [2024-11-09 19:38:16,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:38:16,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394185009] [2024-11-09 19:38:16,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:38:16,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:38:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:38:16,664 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2024-11-09 19:38:16,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:38:16,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394185009] [2024-11-09 19:38:16,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394185009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:38:16,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:38:16,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:38:16,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030588346] [2024-11-09 19:38:16,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:38:16,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:38:16,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:38:16,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:38:16,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:38:16,666 INFO L87 Difference]: Start difference. First operand 1795 states and 3075 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:17,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:38:17,271 INFO L93 Difference]: Finished difference Result 4304 states and 7413 transitions. [2024-11-09 19:38:17,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:38:17,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 435 [2024-11-09 19:38:17,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:38:17,279 INFO L225 Difference]: With dead ends: 4304 [2024-11-09 19:38:17,279 INFO L226 Difference]: Without dead ends: 2690 [2024-11-09 19:38:17,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:38:17,281 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 223 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:38:17,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 363 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:38:17,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2024-11-09 19:38:17,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2153. [2024-11-09 19:38:17,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2153 states, 2152 states have (on average 1.7016728624535316) internal successors, (3662), 2152 states have internal predecessors, (3662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:17,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2153 states to 2153 states and 3662 transitions. [2024-11-09 19:38:17,307 INFO L78 Accepts]: Start accepts. Automaton has 2153 states and 3662 transitions. Word has length 435 [2024-11-09 19:38:17,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:38:17,307 INFO L471 AbstractCegarLoop]: Abstraction has 2153 states and 3662 transitions. [2024-11-09 19:38:17,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:17,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2153 states and 3662 transitions. [2024-11-09 19:38:17,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2024-11-09 19:38:17,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:38:17,342 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:38:17,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:38:17,343 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:38:17,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:38:17,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1825244118, now seen corresponding path program 1 times [2024-11-09 19:38:17,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:38:17,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024117413] [2024-11-09 19:38:17,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:38:17,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:38:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:38:17,643 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2024-11-09 19:38:17,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:38:17,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024117413] [2024-11-09 19:38:17,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024117413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:38:17,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:38:17,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:38:17,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923744508] [2024-11-09 19:38:17,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:38:17,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:38:17,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:38:17,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:38:17,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:38:17,647 INFO L87 Difference]: Start difference. First operand 2153 states and 3662 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:18,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:38:18,233 INFO L93 Difference]: Finished difference Result 4662 states and 8011 transitions. [2024-11-09 19:38:18,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:38:18,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 442 [2024-11-09 19:38:18,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:38:18,242 INFO L225 Difference]: With dead ends: 4662 [2024-11-09 19:38:18,242 INFO L226 Difference]: Without dead ends: 2690 [2024-11-09 19:38:18,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:38:18,245 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 226 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:38:18,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 338 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:38:18,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2024-11-09 19:38:18,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2332. [2024-11-09 19:38:18,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2332 states, 2331 states have (on average 1.7112827112827114) internal successors, (3989), 2331 states have internal predecessors, (3989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 3989 transitions. [2024-11-09 19:38:18,275 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 3989 transitions. Word has length 442 [2024-11-09 19:38:18,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:38:18,276 INFO L471 AbstractCegarLoop]: Abstraction has 2332 states and 3989 transitions. [2024-11-09 19:38:18,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:18,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 3989 transitions. [2024-11-09 19:38:18,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2024-11-09 19:38:18,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:38:18,281 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:38:18,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:38:18,281 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:38:18,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:38:18,282 INFO L85 PathProgramCache]: Analyzing trace with hash 358007750, now seen corresponding path program 1 times [2024-11-09 19:38:18,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:38:18,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684817429] [2024-11-09 19:38:18,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:38:18,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:38:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:38:18,457 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 490 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2024-11-09 19:38:18,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:38:18,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684817429] [2024-11-09 19:38:18,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684817429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:38:18,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:38:18,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:38:18,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081546349] [2024-11-09 19:38:18,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:38:18,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:38:18,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:38:18,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:38:18,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:38:18,459 INFO L87 Difference]: Start difference. First operand 2332 states and 3989 transitions. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:19,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:38:19,027 INFO L93 Difference]: Finished difference Result 5199 states and 8966 transitions. [2024-11-09 19:38:19,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:38:19,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 483 [2024-11-09 19:38:19,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:38:19,035 INFO L225 Difference]: With dead ends: 5199 [2024-11-09 19:38:19,035 INFO L226 Difference]: Without dead ends: 3048 [2024-11-09 19:38:19,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:38:19,038 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 185 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:38:19,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 56 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:38:19,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3048 states. [2024-11-09 19:38:19,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3048 to 2869. [2024-11-09 19:38:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2869 states, 2868 states have (on average 1.7109483960948395) internal successors, (4907), 2868 states have internal predecessors, (4907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:19,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2869 states and 4907 transitions. [2024-11-09 19:38:19,111 INFO L78 Accepts]: Start accepts. Automaton has 2869 states and 4907 transitions. Word has length 483 [2024-11-09 19:38:19,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:38:19,112 INFO L471 AbstractCegarLoop]: Abstraction has 2869 states and 4907 transitions. [2024-11-09 19:38:19,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:19,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2869 states and 4907 transitions. [2024-11-09 19:38:19,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2024-11-09 19:38:19,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:38:19,115 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2024-11-09 19:38:19,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:38:19,115 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:38:19,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:38:19,116 INFO L85 PathProgramCache]: Analyzing trace with hash 999322655, now seen corresponding path program 1 times [2024-11-09 19:38:19,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:38:19,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990171880] [2024-11-09 19:38:19,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:38:19,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:38:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:38:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2024-11-09 19:38:19,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:38:19,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990171880] [2024-11-09 19:38:19,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990171880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:38:19,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:38:19,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:38:19,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528130388] [2024-11-09 19:38:19,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:38:19,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:38:19,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:38:19,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:38:19,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:38:19,570 INFO L87 Difference]: Start difference. First operand 2869 states and 4907 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:20,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:38:20,160 INFO L93 Difference]: Finished difference Result 6273 states and 10818 transitions. [2024-11-09 19:38:20,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:38:20,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 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 598 [2024-11-09 19:38:20,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:38:20,172 INFO L225 Difference]: With dead ends: 6273 [2024-11-09 19:38:20,172 INFO L226 Difference]: Without dead ends: 3585 [2024-11-09 19:38:20,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:38:20,175 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 223 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:38:20,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 358 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:38:20,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3585 states. [2024-11-09 19:38:20,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3585 to 3406. [2024-11-09 19:38:20,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3406 states, 3405 states have (on average 1.7083700440528635) internal successors, (5817), 3405 states have internal predecessors, (5817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:20,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3406 states to 3406 states and 5817 transitions. [2024-11-09 19:38:20,218 INFO L78 Accepts]: Start accepts. Automaton has 3406 states and 5817 transitions. Word has length 598 [2024-11-09 19:38:20,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:38:20,219 INFO L471 AbstractCegarLoop]: Abstraction has 3406 states and 5817 transitions. [2024-11-09 19:38:20,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:20,220 INFO L276 IsEmpty]: Start isEmpty. Operand 3406 states and 5817 transitions. [2024-11-09 19:38:20,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2024-11-09 19:38:20,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:38:20,224 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:38:20,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:38:20,227 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:38:20,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:38:20,227 INFO L85 PathProgramCache]: Analyzing trace with hash -874532880, now seen corresponding path program 1 times [2024-11-09 19:38:20,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:38:20,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093155225] [2024-11-09 19:38:20,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:38:20,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:38:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:38:21,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1554 backedges. 1091 proven. 104 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2024-11-09 19:38:21,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:38:21,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093155225] [2024-11-09 19:38:21,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093155225] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:38:21,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160779936] [2024-11-09 19:38:21,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:38:21,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:38:21,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:38:21,263 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:38:21,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 19:38:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:38:21,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:38:21,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:38:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1554 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2024-11-09 19:38:21,519 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:38:21,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160779936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:38:21,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:38:21,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-09 19:38:21,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016112638] [2024-11-09 19:38:21,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:38:21,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:38:21,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:38:21,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:38:21,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:38:21,521 INFO L87 Difference]: Start difference. First operand 3406 states and 5817 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:22,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:38:22,057 INFO L93 Difference]: Finished difference Result 7347 states and 12629 transitions. [2024-11-09 19:38:22,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:38:22,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 630 [2024-11-09 19:38:22,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:38:22,083 INFO L225 Difference]: With dead ends: 7347 [2024-11-09 19:38:22,090 INFO L226 Difference]: Without dead ends: 4122 [2024-11-09 19:38:22,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 629 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:38:22,093 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 251 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:38:22,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 365 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:38:22,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4122 states. [2024-11-09 19:38:22,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4122 to 3943. [2024-11-09 19:38:22,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3943 states, 3942 states have (on average 1.7097919837645865) internal successors, (6740), 3942 states have internal predecessors, (6740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:22,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3943 states to 3943 states and 6740 transitions. [2024-11-09 19:38:22,155 INFO L78 Accepts]: Start accepts. Automaton has 3943 states and 6740 transitions. Word has length 630 [2024-11-09 19:38:22,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:38:22,157 INFO L471 AbstractCegarLoop]: Abstraction has 3943 states and 6740 transitions. [2024-11-09 19:38:22,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:22,158 INFO L276 IsEmpty]: Start isEmpty. Operand 3943 states and 6740 transitions. [2024-11-09 19:38:22,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2024-11-09 19:38:22,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:38:22,167 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:38:22,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 19:38:22,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 19:38:22,368 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:38:22,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:38:22,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1249492962, now seen corresponding path program 1 times [2024-11-09 19:38:22,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:38:22,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705685680] [2024-11-09 19:38:22,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:38:22,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:38:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:38:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1614 backedges. 1255 proven. 0 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2024-11-09 19:38:22,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:38:22,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705685680] [2024-11-09 19:38:22,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705685680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:38:22,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:38:22,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 19:38:22,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977532246] [2024-11-09 19:38:22,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:38:22,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 19:38:22,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:38:22,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 19:38:22,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:38:22,976 INFO L87 Difference]: Start difference. First operand 3943 states and 6740 transitions. Second operand has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 5 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:24,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:38:24,575 INFO L93 Difference]: Finished difference Result 8779 states and 14987 transitions. [2024-11-09 19:38:24,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 19:38:24,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 5 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 660 [2024-11-09 19:38:24,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:38:24,587 INFO L225 Difference]: With dead ends: 8779 [2024-11-09 19:38:24,587 INFO L226 Difference]: Without dead ends: 5017 [2024-11-09 19:38:24,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:38:24,594 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 621 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 2736 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 2770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:38:24,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 89 Invalid, 2770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2736 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 19:38:24,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5017 states. [2024-11-09 19:38:24,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5017 to 4480. [2024-11-09 19:38:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4480 states, 4479 states have (on average 1.7010493413708416) internal successors, (7619), 4479 states have internal predecessors, (7619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:24,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4480 states to 4480 states and 7619 transitions. [2024-11-09 19:38:24,709 INFO L78 Accepts]: Start accepts. Automaton has 4480 states and 7619 transitions. Word has length 660 [2024-11-09 19:38:24,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:38:24,710 INFO L471 AbstractCegarLoop]: Abstraction has 4480 states and 7619 transitions. [2024-11-09 19:38:24,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 5 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:24,710 INFO L276 IsEmpty]: Start isEmpty. Operand 4480 states and 7619 transitions. [2024-11-09 19:38:24,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 788 [2024-11-09 19:38:24,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:38:24,723 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:38:24,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 19:38:24,724 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:38:24,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:38:24,724 INFO L85 PathProgramCache]: Analyzing trace with hash 117430156, now seen corresponding path program 1 times [2024-11-09 19:38:24,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:38:24,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602812182] [2024-11-09 19:38:24,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:38:24,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:38:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:38:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1790 backedges. 1275 proven. 156 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2024-11-09 19:38:25,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:38:25,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602812182] [2024-11-09 19:38:25,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602812182] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:38:25,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531358756] [2024-11-09 19:38:25,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:38:25,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:38:25,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:38:25,366 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:38:25,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 19:38:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:38:25,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:38:25,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:38:25,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1790 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 1539 trivial. 0 not checked. [2024-11-09 19:38:25,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:38:25,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531358756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:38:25,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:38:25,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-09 19:38:25,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974894566] [2024-11-09 19:38:25,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:38:25,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:38:25,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:38:25,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:38:25,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:38:25,673 INFO L87 Difference]: Start difference. First operand 4480 states and 7619 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:26,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:38:26,242 INFO L93 Difference]: Finished difference Result 5736 states and 9738 transitions. [2024-11-09 19:38:26,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:38:26,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 787 [2024-11-09 19:38:26,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:38:26,254 INFO L225 Difference]: With dead ends: 5736 [2024-11-09 19:38:26,254 INFO L226 Difference]: Without dead ends: 5733 [2024-11-09 19:38:26,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 787 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:38:26,257 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 271 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:38:26,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 26 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:38:26,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5733 states. [2024-11-09 19:38:26,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5733 to 4838. [2024-11-09 19:38:26,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4838 states, 4837 states have (on average 1.7016745916890634) internal successors, (8231), 4837 states have internal predecessors, (8231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:26,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4838 states to 4838 states and 8231 transitions. [2024-11-09 19:38:26,322 INFO L78 Accepts]: Start accepts. Automaton has 4838 states and 8231 transitions. Word has length 787 [2024-11-09 19:38:26,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:38:26,322 INFO L471 AbstractCegarLoop]: Abstraction has 4838 states and 8231 transitions. [2024-11-09 19:38:26,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:26,323 INFO L276 IsEmpty]: Start isEmpty. Operand 4838 states and 8231 transitions. [2024-11-09 19:38:26,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2024-11-09 19:38:26,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:38:26,329 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:38:26,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 19:38:26,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:38:26,533 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:38:26,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:38:26,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1509553666, now seen corresponding path program 1 times [2024-11-09 19:38:26,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:38:26,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907385874] [2024-11-09 19:38:26,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:38:26,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:38:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:38:27,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1880 backedges. 1365 proven. 156 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2024-11-09 19:38:27,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:38:27,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907385874] [2024-11-09 19:38:27,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907385874] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:38:27,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525520703] [2024-11-09 19:38:27,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:38:27,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:38:27,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:38:27,007 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:38:27,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 19:38:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:38:27,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:38:27,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:38:27,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1880 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 1629 trivial. 0 not checked. [2024-11-09 19:38:27,266 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:38:27,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525520703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:38:27,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:38:27,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-09 19:38:27,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193388690] [2024-11-09 19:38:27,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:38:27,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:38:27,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:38:27,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:38:27,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:38:27,268 INFO L87 Difference]: Start difference. First operand 4838 states and 8231 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:27,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:38:27,767 INFO L93 Difference]: Finished difference Result 10566 states and 17976 transitions. [2024-11-09 19:38:27,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:38:27,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 805 [2024-11-09 19:38:27,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:38:27,768 INFO L225 Difference]: With dead ends: 10566 [2024-11-09 19:38:27,772 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 19:38:27,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 805 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:38:27,783 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 251 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:38:27,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 354 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:38:27,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 19:38:27,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 19:38:27,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 19:38:27,784 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 805 [2024-11-09 19:38:27,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:38:27,784 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 19:38:27,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:38:27,784 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 19:38:27,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 19:38:27,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 19:38:27,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 19:38:27,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 19:38:27,995 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:38:28,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 19:38:28,542 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 19:38:28,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:38:28 BoogieIcfgContainer [2024-11-09 19:38:28,558 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 19:38:28,559 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 19:38:28,559 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 19:38:28,559 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 19:38:28,560 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:38:08" (3/4) ... [2024-11-09 19:38:28,562 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 19:38:28,582 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 19:38:28,583 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 19:38:28,584 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 19:38:28,585 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 19:38:28,716 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 19:38:28,716 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 19:38:28,717 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 19:38:28,717 INFO L158 Benchmark]: Toolchain (without parser) took 22238.33ms. Allocated memory was 142.6MB in the beginning and 834.7MB in the end (delta: 692.1MB). Free memory was 70.5MB in the beginning and 300.1MB in the end (delta: -229.5MB). Peak memory consumption was 464.6MB. Max. memory is 16.1GB. [2024-11-09 19:38:28,717 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 105.8MB in the end (delta: 20.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 19:38:28,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.57ms. Allocated memory is still 226.5MB. Free memory was 196.7MB in the beginning and 165.0MB in the end (delta: 31.7MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. [2024-11-09 19:38:28,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.22ms. Allocated memory is still 226.5MB. Free memory was 165.0MB in the beginning and 155.6MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 19:38:28,718 INFO L158 Benchmark]: Boogie Preprocessor took 109.20ms. Allocated memory is still 226.5MB. Free memory was 155.6MB in the beginning and 143.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 19:38:28,718 INFO L158 Benchmark]: IcfgBuilder took 1147.62ms. Allocated memory is still 226.5MB. Free memory was 143.0MB in the beginning and 179.4MB in the end (delta: -36.4MB). Peak memory consumption was 83.1MB. Max. memory is 16.1GB. [2024-11-09 19:38:28,719 INFO L158 Benchmark]: TraceAbstraction took 20277.45ms. Allocated memory was 226.5MB in the beginning and 834.7MB in the end (delta: 608.2MB). Free memory was 178.4MB in the beginning and 317.8MB in the end (delta: -139.5MB). Peak memory consumption was 469.7MB. Max. memory is 16.1GB. [2024-11-09 19:38:28,719 INFO L158 Benchmark]: Witness Printer took 157.42ms. Allocated memory is still 834.7MB. Free memory was 316.8MB in the beginning and 300.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 19:38:28,720 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.15ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 105.8MB in the end (delta: 20.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 446.57ms. Allocated memory is still 226.5MB. Free memory was 196.7MB in the beginning and 165.0MB in the end (delta: 31.7MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.22ms. Allocated memory is still 226.5MB. Free memory was 165.0MB in the beginning and 155.6MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.20ms. Allocated memory is still 226.5MB. Free memory was 155.6MB in the beginning and 143.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * IcfgBuilder took 1147.62ms. Allocated memory is still 226.5MB. Free memory was 143.0MB in the beginning and 179.4MB in the end (delta: -36.4MB). Peak memory consumption was 83.1MB. Max. memory is 16.1GB. * TraceAbstraction took 20277.45ms. Allocated memory was 226.5MB in the beginning and 834.7MB in the end (delta: 608.2MB). Free memory was 178.4MB in the beginning and 317.8MB in the end (delta: -139.5MB). Peak memory consumption was 469.7MB. Max. memory is 16.1GB. * Witness Printer took 157.42ms. Allocated memory is still 834.7MB. Free memory was 316.8MB in the beginning and 300.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 143]: 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, 248 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.7s, OverallIterations: 15, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4440 SdHoareTripleChecker+Valid, 10.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4440 mSDsluCounter, 2528 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 939 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13583 IncrementalHoareTripleChecker+Invalid, 14522 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 939 mSolverCounterUnsat, 2394 mSDtfsCounter, 13583 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2488 GetRequests, 2454 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4838occurred in iteration=14, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 3401 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 8545 NumberOfCodeBlocks, 8545 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 8526 ConstructedInterpolants, 0 QuantifiedInterpolants, 25814 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3077 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 15989/16471 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: 890]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 19:38:28,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE