./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label13.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b3e81a6b8b0761a41c3ab08eaf65813a0a29373f8751b3e6d15ff26531d677e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:15:11,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:15:11,298 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:15:11,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:15:11,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:15:11,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:15:11,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:15:11,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:15:11,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:15:11,331 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:15:11,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:15:11,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:15:11,332 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:15:11,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:15:11,334 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:15:11,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:15:11,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:15:11,335 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:15:11,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:15:11,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:15:11,339 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:15:11,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:15:11,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:15:11,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:15:11,340 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:15:11,341 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:15:11,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:15:11,341 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:15:11,341 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:15:11,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:15:11,342 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:15:11,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:15:11,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:15:11,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:15:11,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:15:11,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:15:11,345 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:15:11,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:15:11,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:15:11,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:15:11,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:15:11,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:15:11,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 -> 8b3e81a6b8b0761a41c3ab08eaf65813a0a29373f8751b3e6d15ff26531d677e [2024-10-12 15:15:11,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:15:11,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:15:11,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:15:11,675 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:15:11,675 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:15:11,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label13.c [2024-10-12 15:15:13,170 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:15:13,452 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:15:13,456 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label13.c [2024-10-12 15:15:13,482 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f8e7e1e3/9078bb456fa542ebaf0386f4b2bf444f/FLAG4560cc7e1 [2024-10-12 15:15:13,497 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f8e7e1e3/9078bb456fa542ebaf0386f4b2bf444f [2024-10-12 15:15:13,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:15:13,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:15:13,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:15:13,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:15:13,509 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:15:13,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:15:13" (1/1) ... [2024-10-12 15:15:13,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@464402be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:13, skipping insertion in model container [2024-10-12 15:15:13,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:15:13" (1/1) ... [2024-10-12 15:15:13,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:15:13,898 WARN L248 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/Problem01_label13.c[20841,20854] [2024-10-12 15:15:13,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:15:13,959 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:15:14,057 WARN L248 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/Problem01_label13.c[20841,20854] [2024-10-12 15:15:14,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:15:14,088 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:15:14,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:14 WrapperNode [2024-10-12 15:15:14,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:15:14,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:15:14,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:15:14,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:15:14,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:14" (1/1) ... [2024-10-12 15:15:14,123 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:14" (1/1) ... [2024-10-12 15:15:14,170 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2024-10-12 15:15:14,170 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:15:14,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:15:14,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:15:14,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:15:14,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:14" (1/1) ... [2024-10-12 15:15:14,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:14" (1/1) ... [2024-10-12 15:15:14,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:14" (1/1) ... [2024-10-12 15:15:14,232 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-10-12 15:15:14,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:14" (1/1) ... [2024-10-12 15:15:14,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:14" (1/1) ... [2024-10-12 15:15:14,250 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:14" (1/1) ... [2024-10-12 15:15:14,258 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:14" (1/1) ... [2024-10-12 15:15:14,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:14" (1/1) ... [2024-10-12 15:15:14,267 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:14" (1/1) ... [2024-10-12 15:15:14,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:15:14,275 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:15:14,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:15:14,275 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:15:14,276 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:14" (1/1) ... [2024-10-12 15:15:14,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:15:14,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:15:14,318 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-10-12 15:15:14,322 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-10-12 15:15:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:15:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:15:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:15:14,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:15:14,461 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:15:14,463 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:15:15,450 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-10-12 15:15:15,450 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:15:15,529 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:15:15,531 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:15:15,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:15:15 BoogieIcfgContainer [2024-10-12 15:15:15,532 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:15:15,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:15:15,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:15:15,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:15:15,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:15:13" (1/3) ... [2024-10-12 15:15:15,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ef5e6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:15:15, skipping insertion in model container [2024-10-12 15:15:15,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:14" (2/3) ... [2024-10-12 15:15:15,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ef5e6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:15:15, skipping insertion in model container [2024-10-12 15:15:15,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:15:15" (3/3) ... [2024-10-12 15:15:15,543 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label13.c [2024-10-12 15:15:15,595 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:15:15,595 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:15:15,732 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:15:15,738 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;@69c0b674, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:15:15,738 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:15:15,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 0 states have call successors, (0), 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-10-12 15:15:15,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 15:15:15,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:15,760 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:15:15,761 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:15,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:15,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1096646707, now seen corresponding path program 1 times [2024-10-12 15:15:15,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:15,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613124085] [2024-10-12 15:15:15,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:15,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:16,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:15:16,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:16,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613124085] [2024-10-12 15:15:16,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613124085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:16,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:15:16,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:15:16,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092500841] [2024-10-12 15:15:16,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:16,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:15:16,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:16,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:15:16,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:15:16,242 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 0 states have call successors, (0), 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 2 states, 2 states have (on average 61.0) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:16,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:16,284 INFO L93 Difference]: Finished difference Result 271 states and 529 transitions. [2024-10-12 15:15:16,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:15:16,289 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 61.0) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2024-10-12 15:15:16,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:16,302 INFO L225 Difference]: With dead ends: 271 [2024-10-12 15:15:16,302 INFO L226 Difference]: Without dead ends: 134 [2024-10-12 15:15:16,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:15:16,309 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:16,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:15:16,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-12 15:15:16,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-10-12 15:15:16,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 133 states have internal predecessors, (200), 0 states have call successors, (0), 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-10-12 15:15:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions. [2024-10-12 15:15:16,354 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 122 [2024-10-12 15:15:16,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:16,355 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 200 transitions. [2024-10-12 15:15:16,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 61.0) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:16,356 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions. [2024-10-12 15:15:16,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 15:15:16,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:16,358 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:15:16,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:15:16,359 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:16,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:16,360 INFO L85 PathProgramCache]: Analyzing trace with hash -133340930, now seen corresponding path program 1 times [2024-10-12 15:15:16,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:16,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238636680] [2024-10-12 15:15:16,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:16,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:16,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:15:16,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:16,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238636680] [2024-10-12 15:15:16,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238636680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:16,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:15:16,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:15:16,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133044242] [2024-10-12 15:15:16,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:16,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:15:16,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:16,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:15:16,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:15:16,736 INFO L87 Difference]: Start difference. First operand 134 states and 200 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:17,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:17,317 INFO L93 Difference]: Finished difference Result 398 states and 597 transitions. [2024-10-12 15:15:17,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:15:17,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2024-10-12 15:15:17,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:17,321 INFO L225 Difference]: With dead ends: 398 [2024-10-12 15:15:17,323 INFO L226 Difference]: Without dead ends: 265 [2024-10-12 15:15:17,324 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-10-12 15:15:17,325 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:17,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 17 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:15:17,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-12 15:15:17,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2024-10-12 15:15:17,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.481060606060606) internal successors, (391), 264 states have internal predecessors, (391), 0 states have call successors, (0), 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-10-12 15:15:17,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 391 transitions. [2024-10-12 15:15:17,360 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 391 transitions. Word has length 122 [2024-10-12 15:15:17,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:17,361 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 391 transitions. [2024-10-12 15:15:17,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:17,364 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 391 transitions. [2024-10-12 15:15:17,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-12 15:15:17,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:17,367 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:15:17,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:15:17,369 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:17,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:17,370 INFO L85 PathProgramCache]: Analyzing trace with hash -292395034, now seen corresponding path program 1 times [2024-10-12 15:15:17,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:17,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995034829] [2024-10-12 15:15:17,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:17,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:17,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:15:17,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:17,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995034829] [2024-10-12 15:15:17,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995034829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:17,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:15:17,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:15:17,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737739995] [2024-10-12 15:15:17,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:17,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:15:17,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:17,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:15:17,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:15:17,545 INFO L87 Difference]: Start difference. First operand 265 states and 391 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-10-12 15:15:17,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:17,994 INFO L93 Difference]: Finished difference Result 791 states and 1170 transitions. [2024-10-12 15:15:17,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:15:17,995 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-10-12 15:15:17,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:17,998 INFO L225 Difference]: With dead ends: 791 [2024-10-12 15:15:17,998 INFO L226 Difference]: Without dead ends: 527 [2024-10-12 15:15:18,000 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-10-12 15:15:18,001 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 172 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:18,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 27 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:15:18,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-10-12 15:15:18,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2024-10-12 15:15:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.414448669201521) internal successors, (744), 526 states have internal predecessors, (744), 0 states have call successors, (0), 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-10-12 15:15:18,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 744 transitions. [2024-10-12 15:15:18,048 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 744 transitions. Word has length 127 [2024-10-12 15:15:18,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:18,049 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 744 transitions. [2024-10-12 15:15:18,049 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-10-12 15:15:18,049 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 744 transitions. [2024-10-12 15:15:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-12 15:15:18,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:18,057 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:15:18,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:15:18,057 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:18,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:18,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1611767263, now seen corresponding path program 1 times [2024-10-12 15:15:18,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:18,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226875254] [2024-10-12 15:15:18,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:18,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:15:18,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:18,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226875254] [2024-10-12 15:15:18,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226875254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:18,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:15:18,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:15:18,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569751006] [2024-10-12 15:15:18,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:18,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:15:18,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:18,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:15:18,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:15:18,403 INFO L87 Difference]: Start difference. First operand 527 states and 744 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:18,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:18,813 INFO L93 Difference]: Finished difference Result 1446 states and 2031 transitions. [2024-10-12 15:15:18,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:15:18,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2024-10-12 15:15:18,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:18,818 INFO L225 Difference]: With dead ends: 1446 [2024-10-12 15:15:18,818 INFO L226 Difference]: Without dead ends: 920 [2024-10-12 15:15:18,822 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-10-12 15:15:18,826 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 123 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:18,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 53 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:15:18,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-10-12 15:15:18,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 920. [2024-10-12 15:15:18,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 919 states have (on average 1.2905331882480957) internal successors, (1186), 919 states have internal predecessors, (1186), 0 states have call successors, (0), 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-10-12 15:15:18,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1186 transitions. [2024-10-12 15:15:18,860 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1186 transitions. Word has length 137 [2024-10-12 15:15:18,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:18,860 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1186 transitions. [2024-10-12 15:15:18,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:18,861 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1186 transitions. [2024-10-12 15:15:18,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-12 15:15:18,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:18,864 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 15:15:18,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:15:18,864 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:18,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:18,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1148923439, now seen corresponding path program 1 times [2024-10-12 15:15:18,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:18,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802426982] [2024-10-12 15:15:18,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:18,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:19,097 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 15:15:19,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:19,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802426982] [2024-10-12 15:15:19,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802426982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:19,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:15:19,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:15:19,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215867874] [2024-10-12 15:15:19,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:19,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:15:19,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:19,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:15:19,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:15:19,104 INFO L87 Difference]: Start difference. First operand 920 states and 1186 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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-10-12 15:15:19,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:19,549 INFO L93 Difference]: Finished difference Result 2101 states and 2724 transitions. [2024-10-12 15:15:19,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:15:19,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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 138 [2024-10-12 15:15:19,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:19,555 INFO L225 Difference]: With dead ends: 2101 [2024-10-12 15:15:19,555 INFO L226 Difference]: Without dead ends: 1182 [2024-10-12 15:15:19,557 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-10-12 15:15:19,558 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 129 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:19,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 70 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:15:19,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2024-10-12 15:15:19,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1182. [2024-10-12 15:15:19,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 1.2472480948348856) internal successors, (1473), 1181 states have internal predecessors, (1473), 0 states have call successors, (0), 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-10-12 15:15:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1473 transitions. [2024-10-12 15:15:19,594 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1473 transitions. Word has length 138 [2024-10-12 15:15:19,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:19,595 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1473 transitions. [2024-10-12 15:15:19,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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-10-12 15:15:19,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1473 transitions. [2024-10-12 15:15:19,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-12 15:15:19,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:19,600 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 15:15:19,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:15:19,601 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:19,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:19,601 INFO L85 PathProgramCache]: Analyzing trace with hash 802889239, now seen corresponding path program 1 times [2024-10-12 15:15:19,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:19,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377876022] [2024-10-12 15:15:19,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:19,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:19,845 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:15:19,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:19,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377876022] [2024-10-12 15:15:19,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377876022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:19,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:15:19,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:15:19,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121602346] [2024-10-12 15:15:19,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:19,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:15:19,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:19,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:15:19,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:15:19,848 INFO L87 Difference]: Start difference. First operand 1182 states and 1473 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:20,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:20,482 INFO L93 Difference]: Finished difference Result 3149 states and 3954 transitions. [2024-10-12 15:15:20,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:15:20,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2024-10-12 15:15:20,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:20,489 INFO L225 Difference]: With dead ends: 3149 [2024-10-12 15:15:20,490 INFO L226 Difference]: Without dead ends: 1968 [2024-10-12 15:15:20,492 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-10-12 15:15:20,492 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 259 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:20,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 56 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:15:20,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2024-10-12 15:15:20,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1837. [2024-10-12 15:15:20,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1836 states have (on average 1.221677559912854) internal successors, (2243), 1836 states have internal predecessors, (2243), 0 states have call successors, (0), 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-10-12 15:15:20,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2243 transitions. [2024-10-12 15:15:20,526 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2243 transitions. Word has length 141 [2024-10-12 15:15:20,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:20,527 INFO L471 AbstractCegarLoop]: Abstraction has 1837 states and 2243 transitions. [2024-10-12 15:15:20,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:20,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2243 transitions. [2024-10-12 15:15:20,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-12 15:15:20,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:20,530 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 15:15:20,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 15:15:20,530 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:20,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:20,531 INFO L85 PathProgramCache]: Analyzing trace with hash 682741302, now seen corresponding path program 1 times [2024-10-12 15:15:20,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:20,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650473682] [2024-10-12 15:15:20,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:20,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:20,779 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:15:20,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:20,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650473682] [2024-10-12 15:15:20,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650473682] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:15:20,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724943556] [2024-10-12 15:15:20,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:20,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:15:20,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:15:20,782 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-10-12 15:15:20,783 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-10-12 15:15:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:20,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:15:20,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:15:21,148 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-12 15:15:21,148 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:15:21,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724943556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:21,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:15:21,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-12 15:15:21,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836509931] [2024-10-12 15:15:21,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:21,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:15:21,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:21,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:15:21,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:15:21,151 INFO L87 Difference]: Start difference. First operand 1837 states and 2243 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-10-12 15:15:21,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:21,543 INFO L93 Difference]: Finished difference Result 2232 states and 2703 transitions. [2024-10-12 15:15:21,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:15:21,544 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 159 [2024-10-12 15:15:21,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:21,552 INFO L225 Difference]: With dead ends: 2232 [2024-10-12 15:15:21,552 INFO L226 Difference]: Without dead ends: 2230 [2024-10-12 15:15:21,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:15:21,554 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 31 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:21,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 29 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:15:21,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2024-10-12 15:15:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 1706. [2024-10-12 15:15:21,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1705 states have (on average 1.2263929618768328) internal successors, (2091), 1705 states have internal predecessors, (2091), 0 states have call successors, (0), 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-10-12 15:15:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2091 transitions. [2024-10-12 15:15:21,595 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2091 transitions. Word has length 159 [2024-10-12 15:15:21,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:21,596 INFO L471 AbstractCegarLoop]: Abstraction has 1706 states and 2091 transitions. [2024-10-12 15:15:21,597 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-10-12 15:15:21,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2091 transitions. [2024-10-12 15:15:21,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-10-12 15:15:21,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:21,603 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 15:15:21,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 15:15:21,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:15:21,811 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:21,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:21,811 INFO L85 PathProgramCache]: Analyzing trace with hash 987592781, now seen corresponding path program 1 times [2024-10-12 15:15:21,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:21,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076272055] [2024-10-12 15:15:21,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:21,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 132 proven. 6 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-10-12 15:15:22,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:22,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076272055] [2024-10-12 15:15:22,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076272055] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:15:22,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952053300] [2024-10-12 15:15:22,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:22,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:15:22,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:15:22,284 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:15:22,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 15:15:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:22,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:15:22,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:15:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-12 15:15:22,710 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:15:22,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952053300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:22,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:15:22,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:15:22,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713570286] [2024-10-12 15:15:22,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:22,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:15:22,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:22,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:15:22,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:15:22,713 INFO L87 Difference]: Start difference. First operand 1706 states and 2091 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-10-12 15:15:23,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:23,133 INFO L93 Difference]: Finished difference Result 3802 states and 4639 transitions. [2024-10-12 15:15:23,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:15:23,134 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 227 [2024-10-12 15:15:23,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:23,135 INFO L225 Difference]: With dead ends: 3802 [2024-10-12 15:15:23,135 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 15:15:23,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:15:23,138 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 16 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:23,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 187 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:15:23,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 15:15:23,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 15:15:23,139 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-10-12 15:15:23,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 15:15:23,140 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 227 [2024-10-12 15:15:23,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:23,140 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 15:15:23,140 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-10-12 15:15:23,141 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 15:15:23,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 15:15:23,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:15:23,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 15:15:23,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-12 15:15:23,348 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:15:23,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 15:15:23,435 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:15:23,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:15:23 BoogieIcfgContainer [2024-10-12 15:15:23,452 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:15:23,452 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:15:23,452 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:15:23,452 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:15:23,453 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:15:15" (3/4) ... [2024-10-12 15:15:23,455 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 15:15:23,475 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-12 15:15:23,476 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 15:15:23,477 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 15:15:23,477 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 15:15:23,636 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 15:15:23,636 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 15:15:23,636 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:15:23,637 INFO L158 Benchmark]: Toolchain (without parser) took 10136.11ms. Allocated memory was 172.0MB in the beginning and 360.7MB in the end (delta: 188.7MB). Free memory was 129.8MB in the beginning and 204.6MB in the end (delta: -74.8MB). Peak memory consumption was 113.3MB. Max. memory is 16.1GB. [2024-10-12 15:15:23,638 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 113.2MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:15:23,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 590.89ms. Allocated memory is still 172.0MB. Free memory was 129.4MB in the beginning and 99.6MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-12 15:15:23,638 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.97ms. Allocated memory is still 172.0MB. Free memory was 99.6MB in the beginning and 93.7MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 15:15:23,639 INFO L158 Benchmark]: Boogie Preprocessor took 99.57ms. Allocated memory is still 172.0MB. Free memory was 93.7MB in the beginning and 134.8MB in the end (delta: -41.1MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-10-12 15:15:23,639 INFO L158 Benchmark]: RCFGBuilder took 1257.72ms. Allocated memory is still 172.0MB. Free memory was 134.8MB in the beginning and 128.2MB in the end (delta: 6.6MB). Peak memory consumption was 90.5MB. Max. memory is 16.1GB. [2024-10-12 15:15:23,640 INFO L158 Benchmark]: TraceAbstraction took 7917.02ms. Allocated memory was 172.0MB in the beginning and 360.7MB in the end (delta: 188.7MB). Free memory was 127.2MB in the beginning and 217.2MB in the end (delta: -90.1MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. [2024-10-12 15:15:23,640 INFO L158 Benchmark]: Witness Printer took 184.39ms. Allocated memory is still 360.7MB. Free memory was 217.2MB in the beginning and 204.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 15:15:23,641 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.29ms. Allocated memory is still 113.2MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 590.89ms. Allocated memory is still 172.0MB. Free memory was 129.4MB in the beginning and 99.6MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.97ms. Allocated memory is still 172.0MB. Free memory was 99.6MB in the beginning and 93.7MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.57ms. Allocated memory is still 172.0MB. Free memory was 93.7MB in the beginning and 134.8MB in the end (delta: -41.1MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * RCFGBuilder took 1257.72ms. Allocated memory is still 172.0MB. Free memory was 134.8MB in the beginning and 128.2MB in the end (delta: 6.6MB). Peak memory consumption was 90.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7917.02ms. Allocated memory was 172.0MB in the beginning and 360.7MB in the end (delta: 188.7MB). Free memory was 127.2MB in the beginning and 217.2MB in the end (delta: -90.1MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. * Witness Printer took 184.39ms. Allocated memory is still 360.7MB. Free memory was 217.2MB in the beginning and 204.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 555]: 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, 136 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 758 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 758 mSDsluCounter, 639 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 492 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2477 IncrementalHoareTripleChecker+Invalid, 2969 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 492 mSolverCounterUnsat, 605 mSDtfsCounter, 2477 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 403 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1837occurred in iteration=6, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 655 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1559 NumberOfCodeBlocks, 1559 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1549 ConstructedInterpolants, 0 QuantifiedInterpolants, 3521 SizeOfPredicates, 0 NumberOfNonLiveVariables, 696 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 512/554 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: 593]: Loop Invariant Derived loop invariant: ((((a21 == 1) && (a16 <= 5)) || (a8 < 14)) || ((a21 == 1) && (15 <= a8))) RESULT: Ultimate proved your program to be correct! [2024-10-12 15:15:23,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE