./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label59.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 b318f94936d789f3e225c0b031e22ed136ba6b0572610da57c85f0ad4ebaa0a1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:13:02,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:13:02,300 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:13:02,304 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:13:02,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:13:02,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:13:02,330 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:13:02,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:13:02,331 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:13:02,331 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:13:02,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:13:02,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:13:02,332 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:13:02,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:13:02,333 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:13:02,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:13:02,334 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:13:02,337 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:13:02,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:13:02,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:13:02,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:13:02,338 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:13:02,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:13:02,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:13:02,342 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:13:02,342 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:13:02,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:13:02,343 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:13:02,343 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:13:02,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:13:02,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:13:02,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:13:02,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:13:02,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:13:02,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:13:02,345 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:13:02,345 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:13:02,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:13:02,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:13:02,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:13:02,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:13:02,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:13:02,346 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 -> b318f94936d789f3e225c0b031e22ed136ba6b0572610da57c85f0ad4ebaa0a1 [2024-11-08 11:13:02,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:13:02,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:13:02,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:13:02,623 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:13:02,624 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:13:02,625 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label59.c [2024-11-08 11:13:04,063 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:13:04,349 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:13:04,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label59.c [2024-11-08 11:13:04,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8875a322/3d7ba2958f4e44b2a08af442f360cad5/FLAG69666dc50 [2024-11-08 11:13:04,398 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8875a322/3d7ba2958f4e44b2a08af442f360cad5 [2024-11-08 11:13:04,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:13:04,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:13:04,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:13:04,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:13:04,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:13:04,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:13:04" (1/1) ... [2024-11-08 11:13:04,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f9a7cca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:04, skipping insertion in model container [2024-11-08 11:13:04,411 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:13:04" (1/1) ... [2024-11-08 11:13:04,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:13:04,747 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label59.c[8515,8528] [2024-11-08 11:13:04,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:13:04,958 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:13:04,995 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label59.c[8515,8528] [2024-11-08 11:13:05,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:13:05,163 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:13:05,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:05 WrapperNode [2024-11-08 11:13:05,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:13:05,166 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:13:05,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:13:05,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:13:05,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:05" (1/1) ... [2024-11-08 11:13:05,216 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:05" (1/1) ... [2024-11-08 11:13:05,313 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-08 11:13:05,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:13:05,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:13:05,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:13:05,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:13:05,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:05" (1/1) ... [2024-11-08 11:13:05,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:05" (1/1) ... [2024-11-08 11:13:05,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:05" (1/1) ... [2024-11-08 11:13:05,391 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-08 11:13:05,392 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:05" (1/1) ... [2024-11-08 11:13:05,392 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:05" (1/1) ... [2024-11-08 11:13:05,427 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:05" (1/1) ... [2024-11-08 11:13:05,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:05" (1/1) ... [2024-11-08 11:13:05,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:05" (1/1) ... [2024-11-08 11:13:05,467 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:05" (1/1) ... [2024-11-08 11:13:05,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:13:05,489 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:13:05,490 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:13:05,490 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:13:05,491 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:05" (1/1) ... [2024-11-08 11:13:05,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:13:05,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:13:05,522 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-08 11:13:05,526 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-08 11:13:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:13:05,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:13:05,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:13:05,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:13:05,622 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:13:05,623 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:13:07,037 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-08 11:13:07,037 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:13:07,063 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:13:07,063 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:13:07,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:13:07 BoogieIcfgContainer [2024-11-08 11:13:07,064 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:13:07,068 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:13:07,068 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:13:07,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:13:07,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:13:04" (1/3) ... [2024-11-08 11:13:07,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61af98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:13:07, skipping insertion in model container [2024-11-08 11:13:07,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:05" (2/3) ... [2024-11-08 11:13:07,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61af98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:13:07, skipping insertion in model container [2024-11-08 11:13:07,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:13:07" (3/3) ... [2024-11-08 11:13:07,074 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label59.c [2024-11-08 11:13:07,090 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:13:07,091 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:13:07,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:13:07,175 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;@504bd4a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:13:07,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:13:07,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:07,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-08 11:13:07,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:07,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:07,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:07,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:07,199 INFO L85 PathProgramCache]: Analyzing trace with hash 118092897, now seen corresponding path program 1 times [2024-11-08 11:13:07,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:07,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262759090] [2024-11-08 11:13:07,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:07,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:07,632 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-08 11:13:07,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:07,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262759090] [2024-11-08 11:13:07,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262759090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:07,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:07,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:13:07,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081905714] [2024-11-08 11:13:07,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:07,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:07,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:07,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:07,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:07,677 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 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-08 11:13:08,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:08,766 INFO L93 Difference]: Finished difference Result 763 states and 1352 transitions. [2024-11-08 11:13:08,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:08,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-11-08 11:13:08,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:08,783 INFO L225 Difference]: With dead ends: 763 [2024-11-08 11:13:08,783 INFO L226 Difference]: Without dead ends: 416 [2024-11-08 11:13:08,787 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-08 11:13:08,790 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 214 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:08,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 89 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:13:08,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-08 11:13:08,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 408. [2024-11-08 11:13:08,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 1.6142506142506143) internal successors, (657), 407 states have internal predecessors, (657), 0 states have call successors, (0), 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-08 11:13:08,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 657 transitions. [2024-11-08 11:13:08,858 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 657 transitions. Word has length 59 [2024-11-08 11:13:08,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:08,859 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 657 transitions. [2024-11-08 11:13:08,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 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-08 11:13:08,861 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 657 transitions. [2024-11-08 11:13:08,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 11:13:08,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:08,866 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, 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] [2024-11-08 11:13:08,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:13:08,867 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:08,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:08,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1894877470, now seen corresponding path program 1 times [2024-11-08 11:13:08,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:08,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057291185] [2024-11-08 11:13:08,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:08,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:09,083 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:13:09,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:09,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057291185] [2024-11-08 11:13:09,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057291185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:09,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:09,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:13:09,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854196094] [2024-11-08 11:13:09,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:09,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:09,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:09,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:09,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:09,090 INFO L87 Difference]: Start difference. First operand 408 states and 657 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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-08 11:13:09,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:09,753 INFO L93 Difference]: Finished difference Result 1193 states and 1931 transitions. [2024-11-08 11:13:09,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:09,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-11-08 11:13:09,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:09,759 INFO L225 Difference]: With dead ends: 1193 [2024-11-08 11:13:09,759 INFO L226 Difference]: Without dead ends: 787 [2024-11-08 11:13:09,761 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-08 11:13:09,762 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 143 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:09,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 153 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:13:09,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-11-08 11:13:09,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 783. [2024-11-08 11:13:09,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 1.4398976982097187) internal successors, (1126), 782 states have internal predecessors, (1126), 0 states have call successors, (0), 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-08 11:13:09,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1126 transitions. [2024-11-08 11:13:09,800 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1126 transitions. Word has length 124 [2024-11-08 11:13:09,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:09,801 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1126 transitions. [2024-11-08 11:13:09,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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-08 11:13:09,801 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1126 transitions. [2024-11-08 11:13:09,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 11:13:09,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:09,804 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, 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] [2024-11-08 11:13:09,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:13:09,804 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:09,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:09,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1494454920, now seen corresponding path program 1 times [2024-11-08 11:13:09,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:09,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970923058] [2024-11-08 11:13:09,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:09,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:10,013 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:13:10,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:10,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970923058] [2024-11-08 11:13:10,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970923058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:10,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:10,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:13:10,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768898034] [2024-11-08 11:13:10,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:10,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:10,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:10,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:10,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:10,022 INFO L87 Difference]: Start difference. First operand 783 states and 1126 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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-08 11:13:10,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:10,827 INFO L93 Difference]: Finished difference Result 1948 states and 2803 transitions. [2024-11-08 11:13:10,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:10,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2024-11-08 11:13:10,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:10,834 INFO L225 Difference]: With dead ends: 1948 [2024-11-08 11:13:10,835 INFO L226 Difference]: Without dead ends: 1167 [2024-11-08 11:13:10,836 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-08 11:13:10,839 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 144 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:10,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 116 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:13:10,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2024-11-08 11:13:10,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1154. [2024-11-08 11:13:10,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 1.3399826539462272) internal successors, (1545), 1153 states have internal predecessors, (1545), 0 states have call successors, (0), 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-08 11:13:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1545 transitions. [2024-11-08 11:13:10,868 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1545 transitions. Word has length 127 [2024-11-08 11:13:10,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:10,868 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1545 transitions. [2024-11-08 11:13:10,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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-08 11:13:10,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1545 transitions. [2024-11-08 11:13:10,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 11:13:10,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:10,871 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, 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] [2024-11-08 11:13:10,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:13:10,872 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:10,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:10,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1334026776, now seen corresponding path program 1 times [2024-11-08 11:13:10,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:10,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691120569] [2024-11-08 11:13:10,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:10,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:11,190 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:13:11,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:11,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691120569] [2024-11-08 11:13:11,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691120569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:11,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:11,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:13:11,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807507389] [2024-11-08 11:13:11,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:11,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:11,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:11,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:11,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:11,194 INFO L87 Difference]: Start difference. First operand 1154 states and 1545 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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-08 11:13:11,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:11,929 INFO L93 Difference]: Finished difference Result 2676 states and 3531 transitions. [2024-11-08 11:13:11,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:11,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2024-11-08 11:13:11,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:11,935 INFO L225 Difference]: With dead ends: 2676 [2024-11-08 11:13:11,935 INFO L226 Difference]: Without dead ends: 1524 [2024-11-08 11:13:11,937 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-08 11:13:11,938 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:11,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 189 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:13:11,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2024-11-08 11:13:11,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1523. [2024-11-08 11:13:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1523 states, 1522 states have (on average 1.269382391590013) internal successors, (1932), 1522 states have internal predecessors, (1932), 0 states have call successors, (0), 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-08 11:13:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1932 transitions. [2024-11-08 11:13:11,965 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1932 transitions. Word has length 128 [2024-11-08 11:13:11,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:11,965 INFO L471 AbstractCegarLoop]: Abstraction has 1523 states and 1932 transitions. [2024-11-08 11:13:11,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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-08 11:13:11,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1932 transitions. [2024-11-08 11:13:11,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 11:13:11,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:11,968 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:11,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:13:11,968 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:11,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:11,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1749899371, now seen corresponding path program 1 times [2024-11-08 11:13:11,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:11,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709720468] [2024-11-08 11:13:11,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:11,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:12,114 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:13:12,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:12,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709720468] [2024-11-08 11:13:12,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709720468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:12,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:12,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:13:12,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804131837] [2024-11-08 11:13:12,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:12,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:12,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:12,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:12,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:12,120 INFO L87 Difference]: Start difference. First operand 1523 states and 1932 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 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-08 11:13:12,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:12,915 INFO L93 Difference]: Finished difference Result 3968 states and 5154 transitions. [2024-11-08 11:13:12,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:12,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 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 186 [2024-11-08 11:13:12,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:12,926 INFO L225 Difference]: With dead ends: 3968 [2024-11-08 11:13:12,926 INFO L226 Difference]: Without dead ends: 2631 [2024-11-08 11:13:12,929 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-08 11:13:12,929 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 115 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:12,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 154 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:13:12,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2024-11-08 11:13:12,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2631. [2024-11-08 11:13:12,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2631 states, 2630 states have (on average 1.2133079847908745) internal successors, (3191), 2630 states have internal predecessors, (3191), 0 states have call successors, (0), 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-08 11:13:12,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 3191 transitions. [2024-11-08 11:13:12,988 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 3191 transitions. Word has length 186 [2024-11-08 11:13:12,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:12,988 INFO L471 AbstractCegarLoop]: Abstraction has 2631 states and 3191 transitions. [2024-11-08 11:13:12,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 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-08 11:13:12,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 3191 transitions. [2024-11-08 11:13:12,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-08 11:13:12,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:12,992 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:12,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:13:12,993 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:12,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:12,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1893767947, now seen corresponding path program 1 times [2024-11-08 11:13:12,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:12,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537564664] [2024-11-08 11:13:12,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:12,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:13:13,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:13,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537564664] [2024-11-08 11:13:13,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537564664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:13,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:13,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:13,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031029944] [2024-11-08 11:13:13,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:13,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:13:13,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:13,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:13:13,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:13:13,403 INFO L87 Difference]: Start difference. First operand 2631 states and 3191 transitions. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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-08 11:13:14,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:14,722 INFO L93 Difference]: Finished difference Result 7118 states and 8850 transitions. [2024-11-08 11:13:14,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:13:14,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 202 [2024-11-08 11:13:14,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:14,738 INFO L225 Difference]: With dead ends: 7118 [2024-11-08 11:13:14,738 INFO L226 Difference]: Without dead ends: 4673 [2024-11-08 11:13:14,742 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-08 11:13:14,743 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 245 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:14,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 79 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 11:13:14,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4673 states. [2024-11-08 11:13:14,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4673 to 4295. [2024-11-08 11:13:14,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4295 states, 4294 states have (on average 1.231020027945971) internal successors, (5286), 4294 states have internal predecessors, (5286), 0 states have call successors, (0), 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-08 11:13:14,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4295 states to 4295 states and 5286 transitions. [2024-11-08 11:13:14,820 INFO L78 Accepts]: Start accepts. Automaton has 4295 states and 5286 transitions. Word has length 202 [2024-11-08 11:13:14,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:14,821 INFO L471 AbstractCegarLoop]: Abstraction has 4295 states and 5286 transitions. [2024-11-08 11:13:14,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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-08 11:13:14,821 INFO L276 IsEmpty]: Start isEmpty. Operand 4295 states and 5286 transitions. [2024-11-08 11:13:14,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-08 11:13:14,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:14,825 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:13:14,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:13:14,825 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:14,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:14,826 INFO L85 PathProgramCache]: Analyzing trace with hash -878115989, now seen corresponding path program 1 times [2024-11-08 11:13:14,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:14,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893995416] [2024-11-08 11:13:14,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:14,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:15,079 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:13:15,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:15,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893995416] [2024-11-08 11:13:15,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893995416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:15,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:15,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:15,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162250562] [2024-11-08 11:13:15,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:15,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:15,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:15,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:15,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:15,083 INFO L87 Difference]: Start difference. First operand 4295 states and 5286 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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-08 11:13:15,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:15,795 INFO L93 Difference]: Finished difference Result 9519 states and 11889 transitions. [2024-11-08 11:13:15,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:15,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2024-11-08 11:13:15,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:15,811 INFO L225 Difference]: With dead ends: 9519 [2024-11-08 11:13:15,811 INFO L226 Difference]: Without dead ends: 5594 [2024-11-08 11:13:15,816 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-08 11:13:15,817 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 135 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:15,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 331 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:13:15,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5594 states. [2024-11-08 11:13:15,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5594 to 5399. [2024-11-08 11:13:15,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5399 states, 5398 states have (on average 1.2182289736939607) internal successors, (6576), 5398 states have internal predecessors, (6576), 0 states have call successors, (0), 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-08 11:13:15,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5399 states to 5399 states and 6576 transitions. [2024-11-08 11:13:15,906 INFO L78 Accepts]: Start accepts. Automaton has 5399 states and 6576 transitions. Word has length 239 [2024-11-08 11:13:15,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:15,907 INFO L471 AbstractCegarLoop]: Abstraction has 5399 states and 6576 transitions. [2024-11-08 11:13:15,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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-08 11:13:15,908 INFO L276 IsEmpty]: Start isEmpty. Operand 5399 states and 6576 transitions. [2024-11-08 11:13:15,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-08 11:13:15,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:15,911 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:15,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:13:15,911 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:15,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:15,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1869280923, now seen corresponding path program 1 times [2024-11-08 11:13:15,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:15,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764631196] [2024-11-08 11:13:15,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:15,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:16,232 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-08 11:13:16,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:16,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764631196] [2024-11-08 11:13:16,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764631196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:16,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:16,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:16,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896068723] [2024-11-08 11:13:16,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:16,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:16,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:16,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:16,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:16,236 INFO L87 Difference]: Start difference. First operand 5399 states and 6576 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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-08 11:13:17,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:17,025 INFO L93 Difference]: Finished difference Result 14317 states and 17683 transitions. [2024-11-08 11:13:17,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:17,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 240 [2024-11-08 11:13:17,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:17,052 INFO L225 Difference]: With dead ends: 14317 [2024-11-08 11:13:17,052 INFO L226 Difference]: Without dead ends: 9288 [2024-11-08 11:13:17,057 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-08 11:13:17,058 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 167 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:17,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 331 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:13:17,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9288 states. [2024-11-08 11:13:17,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9288 to 8184. [2024-11-08 11:13:17,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8184 states, 8183 states have (on average 1.2134913845777833) internal successors, (9930), 8183 states have internal predecessors, (9930), 0 states have call successors, (0), 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-08 11:13:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8184 states to 8184 states and 9930 transitions. [2024-11-08 11:13:17,235 INFO L78 Accepts]: Start accepts. Automaton has 8184 states and 9930 transitions. Word has length 240 [2024-11-08 11:13:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:17,235 INFO L471 AbstractCegarLoop]: Abstraction has 8184 states and 9930 transitions. [2024-11-08 11:13:17,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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-08 11:13:17,236 INFO L276 IsEmpty]: Start isEmpty. Operand 8184 states and 9930 transitions. [2024-11-08 11:13:17,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-08 11:13:17,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:17,242 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:13:17,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:13:17,242 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:17,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:17,243 INFO L85 PathProgramCache]: Analyzing trace with hash -2080681397, now seen corresponding path program 1 times [2024-11-08 11:13:17,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:17,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077769403] [2024-11-08 11:13:17,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:17,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:13:17,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:17,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077769403] [2024-11-08 11:13:17,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077769403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:17,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:17,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:17,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920859832] [2024-11-08 11:13:17,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:17,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:13:17,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:17,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:13:17,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:13:17,661 INFO L87 Difference]: Start difference. First operand 8184 states and 9930 transitions. Second operand has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 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-08 11:13:18,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:18,905 INFO L93 Difference]: Finished difference Result 17850 states and 21799 transitions. [2024-11-08 11:13:18,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:13:18,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 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 261 [2024-11-08 11:13:18,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:18,931 INFO L225 Difference]: With dead ends: 17850 [2024-11-08 11:13:18,931 INFO L226 Difference]: Without dead ends: 10036 [2024-11-08 11:13:18,940 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-08 11:13:18,940 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 230 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:18,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 144 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 11:13:18,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10036 states. [2024-11-08 11:13:19,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10036 to 9658. [2024-11-08 11:13:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9658 states, 9657 states have (on average 1.2026509267888579) internal successors, (11614), 9657 states have internal predecessors, (11614), 0 states have call successors, (0), 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-08 11:13:19,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9658 states to 9658 states and 11614 transitions. [2024-11-08 11:13:19,081 INFO L78 Accepts]: Start accepts. Automaton has 9658 states and 11614 transitions. Word has length 261 [2024-11-08 11:13:19,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:19,081 INFO L471 AbstractCegarLoop]: Abstraction has 9658 states and 11614 transitions. [2024-11-08 11:13:19,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 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-08 11:13:19,082 INFO L276 IsEmpty]: Start isEmpty. Operand 9658 states and 11614 transitions. [2024-11-08 11:13:19,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-11-08 11:13:19,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:19,090 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:13:19,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:13:19,090 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:19,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:19,091 INFO L85 PathProgramCache]: Analyzing trace with hash -2113401050, now seen corresponding path program 1 times [2024-11-08 11:13:19,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:19,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201382090] [2024-11-08 11:13:19,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:19,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:19,852 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 128 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:13:19,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:19,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201382090] [2024-11-08 11:13:19,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201382090] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:13:19,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946040276] [2024-11-08 11:13:19,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:19,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:13:19,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:13:19,855 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-08 11:13:19,856 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-08 11:13:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:20,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 11:13:20,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:13:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 128 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:13:20,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:13:20,516 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-08 11:13:20,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946040276] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 11:13:20,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 11:13:20,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 5 [2024-11-08 11:13:20,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676034002] [2024-11-08 11:13:20,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:20,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:20,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:20,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:20,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:13:20,519 INFO L87 Difference]: Start difference. First operand 9658 states and 11614 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:21,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:21,522 INFO L93 Difference]: Finished difference Result 18385 states and 22011 transitions. [2024-11-08 11:13:21,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:21,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 313 [2024-11-08 11:13:21,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:21,537 INFO L225 Difference]: With dead ends: 18385 [2024-11-08 11:13:21,538 INFO L226 Difference]: Without dead ends: 9097 [2024-11-08 11:13:21,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:13:21,547 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 161 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:21,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 308 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 11:13:21,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9097 states. [2024-11-08 11:13:21,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9097 to 8358. [2024-11-08 11:13:21,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8358 states, 8357 states have (on average 1.1808065095129832) internal successors, (9868), 8357 states have internal predecessors, (9868), 0 states have call successors, (0), 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-08 11:13:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8358 states to 8358 states and 9868 transitions. [2024-11-08 11:13:21,646 INFO L78 Accepts]: Start accepts. Automaton has 8358 states and 9868 transitions. Word has length 313 [2024-11-08 11:13:21,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:21,646 INFO L471 AbstractCegarLoop]: Abstraction has 8358 states and 9868 transitions. [2024-11-08 11:13:21,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:21,647 INFO L276 IsEmpty]: Start isEmpty. Operand 8358 states and 9868 transitions. [2024-11-08 11:13:21,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2024-11-08 11:13:21,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:21,655 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, 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, 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-08 11:13:21,672 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-08 11:13:21,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 11:13:21,856 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:21,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:21,856 INFO L85 PathProgramCache]: Analyzing trace with hash 658760884, now seen corresponding path program 1 times [2024-11-08 11:13:21,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:21,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472589666] [2024-11-08 11:13:21,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:21,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:22,215 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-11-08 11:13:22,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:22,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472589666] [2024-11-08 11:13:22,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472589666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:22,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:22,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:22,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209569232] [2024-11-08 11:13:22,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:22,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:22,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:22,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:22,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:22,218 INFO L87 Difference]: Start difference. First operand 8358 states and 9868 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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-08 11:13:22,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:22,985 INFO L93 Difference]: Finished difference Result 17639 states and 20898 transitions. [2024-11-08 11:13:22,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:22,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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 381 [2024-11-08 11:13:22,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:23,000 INFO L225 Difference]: With dead ends: 17639 [2024-11-08 11:13:23,000 INFO L226 Difference]: Without dead ends: 9467 [2024-11-08 11:13:23,008 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-08 11:13:23,009 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 107 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:23,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 361 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:13:23,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9467 states. [2024-11-08 11:13:23,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9467 to 9278. [2024-11-08 11:13:23,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9278 states, 9277 states have (on average 1.1745176242319715) internal successors, (10896), 9277 states have internal predecessors, (10896), 0 states have call successors, (0), 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-08 11:13:23,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9278 states to 9278 states and 10896 transitions. [2024-11-08 11:13:23,113 INFO L78 Accepts]: Start accepts. Automaton has 9278 states and 10896 transitions. Word has length 381 [2024-11-08 11:13:23,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:23,114 INFO L471 AbstractCegarLoop]: Abstraction has 9278 states and 10896 transitions. [2024-11-08 11:13:23,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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-08 11:13:23,114 INFO L276 IsEmpty]: Start isEmpty. Operand 9278 states and 10896 transitions. [2024-11-08 11:13:23,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2024-11-08 11:13:23,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:23,123 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, 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, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:13:23,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 11:13:23,124 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:23,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:23,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1793054198, now seen corresponding path program 1 times [2024-11-08 11:13:23,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:23,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397308012] [2024-11-08 11:13:23,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:23,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:23,404 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-11-08 11:13:23,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:23,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397308012] [2024-11-08 11:13:23,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397308012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:23,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:23,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:23,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337021800] [2024-11-08 11:13:23,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:23,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:23,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:23,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:23,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:23,407 INFO L87 Difference]: Start difference. First operand 9278 states and 10896 transitions. Second operand has 3 states, 3 states have (on average 65.0) 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-08 11:13:24,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:24,094 INFO L93 Difference]: Finished difference Result 19840 states and 23280 transitions. [2024-11-08 11:13:24,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:24,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) 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 386 [2024-11-08 11:13:24,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:24,111 INFO L225 Difference]: With dead ends: 19840 [2024-11-08 11:13:24,112 INFO L226 Difference]: Without dead ends: 10934 [2024-11-08 11:13:24,121 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-08 11:13:24,122 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 162 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:24,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 317 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:13:24,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10934 states. [2024-11-08 11:13:24,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10934 to 7785. [2024-11-08 11:13:24,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7785 states, 7784 states have (on average 1.1379753340184995) internal successors, (8858), 7784 states have internal predecessors, (8858), 0 states have call successors, (0), 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-08 11:13:24,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7785 states to 7785 states and 8858 transitions. [2024-11-08 11:13:24,222 INFO L78 Accepts]: Start accepts. Automaton has 7785 states and 8858 transitions. Word has length 386 [2024-11-08 11:13:24,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:24,223 INFO L471 AbstractCegarLoop]: Abstraction has 7785 states and 8858 transitions. [2024-11-08 11:13:24,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) 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-08 11:13:24,223 INFO L276 IsEmpty]: Start isEmpty. Operand 7785 states and 8858 transitions. [2024-11-08 11:13:24,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2024-11-08 11:13:24,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:24,232 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, 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, 2, 2, 2, 2, 2, 2, 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-08 11:13:24,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 11:13:24,233 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:24,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:24,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1378379559, now seen corresponding path program 1 times [2024-11-08 11:13:24,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:24,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856872833] [2024-11-08 11:13:24,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:24,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:24,597 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-08 11:13:24,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:24,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856872833] [2024-11-08 11:13:24,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856872833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:24,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:24,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:24,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286008810] [2024-11-08 11:13:24,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:24,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:24,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:24,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:24,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:24,601 INFO L87 Difference]: Start difference. First operand 7785 states and 8858 transitions. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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-08 11:13:25,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:25,295 INFO L93 Difference]: Finished difference Result 17417 states and 19899 transitions. [2024-11-08 11:13:25,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:25,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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 401 [2024-11-08 11:13:25,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:25,314 INFO L225 Difference]: With dead ends: 17417 [2024-11-08 11:13:25,315 INFO L226 Difference]: Without dead ends: 10004 [2024-11-08 11:13:25,323 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-08 11:13:25,324 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 142 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:25,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 132 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:13:25,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10004 states. [2024-11-08 11:13:25,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10004 to 9634. [2024-11-08 11:13:25,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9634 states, 9633 states have (on average 1.1337070486868057) internal successors, (10921), 9633 states have internal predecessors, (10921), 0 states have call successors, (0), 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-08 11:13:25,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9634 states to 9634 states and 10921 transitions. [2024-11-08 11:13:25,547 INFO L78 Accepts]: Start accepts. Automaton has 9634 states and 10921 transitions. Word has length 401 [2024-11-08 11:13:25,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:25,548 INFO L471 AbstractCegarLoop]: Abstraction has 9634 states and 10921 transitions. [2024-11-08 11:13:25,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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-08 11:13:25,548 INFO L276 IsEmpty]: Start isEmpty. Operand 9634 states and 10921 transitions. [2024-11-08 11:13:25,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2024-11-08 11:13:25,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:25,562 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:13:25,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 11:13:25,563 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:25,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:25,564 INFO L85 PathProgramCache]: Analyzing trace with hash -384632590, now seen corresponding path program 1 times [2024-11-08 11:13:25,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:25,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264797813] [2024-11-08 11:13:25,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:25,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2024-11-08 11:13:26,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:26,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264797813] [2024-11-08 11:13:26,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264797813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:26,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:26,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:26,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957515545] [2024-11-08 11:13:26,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:26,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:26,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:26,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:26,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:26,256 INFO L87 Difference]: Start difference. First operand 9634 states and 10921 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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-08 11:13:26,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:26,886 INFO L93 Difference]: Finished difference Result 20182 states and 22883 transitions. [2024-11-08 11:13:26,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:26,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 411 [2024-11-08 11:13:26,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:26,888 INFO L225 Difference]: With dead ends: 20182 [2024-11-08 11:13:26,888 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 11:13:26,898 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-08 11:13:26,899 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 164 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:26,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 312 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:13:26,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 11:13:26,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 11:13:26,900 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-08 11:13:26,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 11:13:26,901 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 411 [2024-11-08 11:13:26,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:26,901 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 11:13:26,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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-08 11:13:26,901 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 11:13:26,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 11:13:26,904 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 11:13:26,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 11:13:26,912 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:26,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 11:13:27,834 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 11:13:27,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:13:27 BoogieIcfgContainer [2024-11-08 11:13:27,848 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 11:13:27,849 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 11:13:27,849 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 11:13:27,849 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 11:13:27,849 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:13:07" (3/4) ... [2024-11-08 11:13:27,852 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 11:13:27,875 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 11:13:27,877 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 11:13:27,878 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 11:13:27,879 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 11:13:28,038 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 11:13:28,039 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 11:13:28,039 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 11:13:28,040 INFO L158 Benchmark]: Toolchain (without parser) took 23638.47ms. Allocated memory was 182.5MB in the beginning and 604.0MB in the end (delta: 421.5MB). Free memory was 109.3MB in the beginning and 305.8MB in the end (delta: -196.5MB). Peak memory consumption was 226.7MB. Max. memory is 16.1GB. [2024-11-08 11:13:28,040 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 119.5MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 11:13:28,040 INFO L158 Benchmark]: CACSL2BoogieTranslator took 761.60ms. Allocated memory is still 182.5MB. Free memory was 109.3MB in the beginning and 144.5MB in the end (delta: -35.2MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. [2024-11-08 11:13:28,040 INFO L158 Benchmark]: Boogie Procedure Inliner took 148.25ms. Allocated memory is still 182.5MB. Free memory was 143.7MB in the beginning and 126.0MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 11:13:28,040 INFO L158 Benchmark]: Boogie Preprocessor took 173.62ms. Allocated memory is still 182.5MB. Free memory was 126.0MB in the beginning and 100.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 11:13:28,041 INFO L158 Benchmark]: RCFGBuilder took 1574.48ms. Allocated memory is still 182.5MB. Free memory was 100.9MB in the beginning and 87.0MB in the end (delta: 13.9MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. [2024-11-08 11:13:28,041 INFO L158 Benchmark]: TraceAbstraction took 20780.65ms. Allocated memory was 182.5MB in the beginning and 604.0MB in the end (delta: 421.5MB). Free memory was 86.0MB in the beginning and 322.6MB in the end (delta: -236.6MB). Peak memory consumption was 341.2MB. Max. memory is 16.1GB. [2024-11-08 11:13:28,041 INFO L158 Benchmark]: Witness Printer took 190.50ms. Allocated memory is still 604.0MB. Free memory was 322.6MB in the beginning and 305.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 11:13:28,042 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.17ms. Allocated memory is still 119.5MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 761.60ms. Allocated memory is still 182.5MB. Free memory was 109.3MB in the beginning and 144.5MB in the end (delta: -35.2MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 148.25ms. Allocated memory is still 182.5MB. Free memory was 143.7MB in the beginning and 126.0MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 173.62ms. Allocated memory is still 182.5MB. Free memory was 126.0MB in the beginning and 100.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1574.48ms. Allocated memory is still 182.5MB. Free memory was 100.9MB in the beginning and 87.0MB in the end (delta: 13.9MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20780.65ms. Allocated memory was 182.5MB in the beginning and 604.0MB in the end (delta: 421.5MB). Free memory was 86.0MB in the beginning and 322.6MB in the end (delta: -236.6MB). Peak memory consumption was 341.2MB. Max. memory is 16.1GB. * Witness Printer took 190.50ms. Allocated memory is still 604.0MB. Free memory was 322.6MB in the beginning and 305.8MB 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: 193]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.8s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2249 SdHoareTripleChecker+Valid, 11.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2249 mSDsluCounter, 3016 SdHoareTripleChecker+Invalid, 9.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 318 mSDsCounter, 1861 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8798 IncrementalHoareTripleChecker+Invalid, 10659 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1861 mSolverCounterUnsat, 2698 mSDtfsCounter, 8798 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 662 GetRequests, 644 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9658occurred in iteration=9, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 6528 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 3771 NumberOfCodeBlocks, 3771 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4068 ConstructedInterpolants, 0 QuantifiedInterpolants, 7382 SizeOfPredicates, 1 NumberOfNonLiveVariables, 419 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 3066/3180 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((((a23 <= 266) && (a4 == 1)) || ((a25 == 12) && (141 <= a29))) || ((260 <= a29) && (a23 <= 137))) || ((141 <= a29) && (a4 == 1))) || ((a25 == 10) && (a29 <= 130))) || ((a23 <= 138) && (a29 <= 220))) || ((a25 == 12) && (a29 <= 130))) || ((10 <= a25) && (a23 <= 138))) || ((10 <= a25) && (a4 == 1))) RESULT: Ultimate proved your program to be correct! [2024-11-08 11:13:28,065 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