./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label59.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 744695bd97e773bc45009ad8c308621dee61f75b749d2d70fc4d697e39202153 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:36:58,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:36:58,298 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:36:58,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:36:58,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:36:58,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:36:58,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:36:58,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:36:58,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:36:58,333 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:36:58,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:36:58,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:36:58,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:36:58,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:36:58,335 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:36:58,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:36:58,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:36:58,336 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:36:58,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:36:58,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:36:58,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:36:58,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:36:58,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:36:58,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:36:58,344 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:36:58,344 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:36:58,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:36:58,345 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:36:58,345 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:36:58,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:36:58,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:36:58,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:36:58,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:36:58,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:36:58,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:36:58,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:36:58,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:36:58,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:36:58,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:36:58,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:36:58,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:36:58,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:36:58,349 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 -> 744695bd97e773bc45009ad8c308621dee61f75b749d2d70fc4d697e39202153 [2024-11-08 11:36:58,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:36:58,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:36:58,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:36:58,596 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:36:58,597 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:36:58,598 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label59.c [2024-11-08 11:36:59,981 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:37:00,278 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:37:00,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label59.c [2024-11-08 11:37:00,297 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/920746692/1312e6d64b0a4cd4a796e12f6dd6ec4b/FLAG55d1c52cf [2024-11-08 11:37:00,312 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/920746692/1312e6d64b0a4cd4a796e12f6dd6ec4b [2024-11-08 11:37:00,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:37:00,316 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:37:00,317 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:37:00,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:37:00,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:37:00,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:37:00" (1/1) ... [2024-11-08 11:37:00,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c0d9be5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:00, skipping insertion in model container [2024-11-08 11:37:00,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:37:00" (1/1) ... [2024-11-08 11:37:00,386 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:37:00,577 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label59.c[4713,4726] [2024-11-08 11:37:00,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:37:00,834 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:37:00,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label59.c[4713,4726] [2024-11-08 11:37:01,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:37:01,077 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:37:01,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:01 WrapperNode [2024-11-08 11:37:01,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:37:01,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:37:01,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:37:01,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:37:01,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:01" (1/1) ... [2024-11-08 11:37:01,115 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:01" (1/1) ... [2024-11-08 11:37:01,272 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1770 [2024-11-08 11:37:01,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:37:01,277 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:37:01,277 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:37:01,277 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:37:01,290 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:01" (1/1) ... [2024-11-08 11:37:01,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:01" (1/1) ... [2024-11-08 11:37:01,315 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:01" (1/1) ... [2024-11-08 11:37:01,452 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 11:37:01,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:01" (1/1) ... [2024-11-08 11:37:01,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:01" (1/1) ... [2024-11-08 11:37:01,495 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:01" (1/1) ... [2024-11-08 11:37:01,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:01" (1/1) ... [2024-11-08 11:37:01,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:01" (1/1) ... [2024-11-08 11:37:01,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:01" (1/1) ... [2024-11-08 11:37:01,541 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:37:01,542 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:37:01,542 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:37:01,542 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:37:01,543 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:01" (1/1) ... [2024-11-08 11:37:01,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:37:01,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:37:01,572 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 11:37:01,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 11:37:01,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:37:01,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:37:01,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:37:01,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:37:01,683 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:37:01,685 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:37:03,310 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2024-11-08 11:37:03,310 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:37:03,343 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:37:03,343 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:37:03,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:37:03 BoogieIcfgContainer [2024-11-08 11:37:03,344 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:37:03,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:37:03,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:37:03,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:37:03,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:37:00" (1/3) ... [2024-11-08 11:37:03,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a35805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:37:03, skipping insertion in model container [2024-11-08 11:37:03,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:01" (2/3) ... [2024-11-08 11:37:03,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a35805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:37:03, skipping insertion in model container [2024-11-08 11:37:03,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:37:03" (3/3) ... [2024-11-08 11:37:03,353 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label59.c [2024-11-08 11:37:03,367 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:37:03,368 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:37:03,430 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:37:03,437 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;@14692bf9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:37:03,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:37:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.8350253807106598) internal successors, (723), 395 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:03,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 11:37:03,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:03,452 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] [2024-11-08 11:37:03,452 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:03,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:03,457 INFO L85 PathProgramCache]: Analyzing trace with hash 626000386, now seen corresponding path program 1 times [2024-11-08 11:37:03,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:03,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504286630] [2024-11-08 11:37:03,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:03,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:03,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:37:03,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:03,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504286630] [2024-11-08 11:37:03,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504286630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:03,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:03,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:37:03,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589664255] [2024-11-08 11:37:03,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:03,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:37:03,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:03,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:37:03,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:03,731 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.8350253807106598) internal successors, (723), 395 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:05,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:05,115 INFO L93 Difference]: Finished difference Result 1137 states and 2118 transitions. [2024-11-08 11:37:05,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:37:05,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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 44 [2024-11-08 11:37:05,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:05,135 INFO L225 Difference]: With dead ends: 1137 [2024-11-08 11:37:05,136 INFO L226 Difference]: Without dead ends: 662 [2024-11-08 11:37:05,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:05,146 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 342 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:05,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 60 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 11:37:05,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-08 11:37:05,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2024-11-08 11:37:05,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.7639939485627836) internal successors, (1166), 661 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:05,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1166 transitions. [2024-11-08 11:37:05,201 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1166 transitions. Word has length 44 [2024-11-08 11:37:05,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:05,201 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1166 transitions. [2024-11-08 11:37:05,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:05,202 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1166 transitions. [2024-11-08 11:37:05,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 11:37:05,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:05,205 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:05,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:37:05,205 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:05,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:05,206 INFO L85 PathProgramCache]: Analyzing trace with hash -228214936, now seen corresponding path program 1 times [2024-11-08 11:37:05,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:05,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880879899] [2024-11-08 11:37:05,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:05,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:37:05,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:05,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880879899] [2024-11-08 11:37:05,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880879899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:05,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:05,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:37:05,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889307545] [2024-11-08 11:37:05,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:05,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:37:05,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:05,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:37:05,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:05,376 INFO L87 Difference]: Start difference. First operand 662 states and 1166 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:06,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:06,563 INFO L93 Difference]: Finished difference Result 1980 states and 3493 transitions. [2024-11-08 11:37:06,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:37:06,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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 109 [2024-11-08 11:37:06,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:06,568 INFO L225 Difference]: With dead ends: 1980 [2024-11-08 11:37:06,568 INFO L226 Difference]: Without dead ends: 1320 [2024-11-08 11:37:06,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:06,571 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 344 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:06,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 77 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 11:37:06,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2024-11-08 11:37:06,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2024-11-08 11:37:06,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.6656557998483699) internal successors, (2197), 1319 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:06,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 2197 transitions. [2024-11-08 11:37:06,611 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 2197 transitions. Word has length 109 [2024-11-08 11:37:06,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:06,612 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 2197 transitions. [2024-11-08 11:37:06,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:06,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 2197 transitions. [2024-11-08 11:37:06,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 11:37:06,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:06,615 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:06,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:37:06,615 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:06,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:06,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1921470884, now seen corresponding path program 1 times [2024-11-08 11:37:06,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:06,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267231357] [2024-11-08 11:37:06,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:06,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:06,747 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:37:06,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:06,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267231357] [2024-11-08 11:37:06,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267231357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:06,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:06,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:37:06,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047287711] [2024-11-08 11:37:06,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:06,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:37:06,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:06,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:37:06,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:06,750 INFO L87 Difference]: Start difference. First operand 1320 states and 2197 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:08,247 INFO L93 Difference]: Finished difference Result 3625 states and 6017 transitions. [2024-11-08 11:37:08,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:37:08,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 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 112 [2024-11-08 11:37:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:08,256 INFO L225 Difference]: With dead ends: 3625 [2024-11-08 11:37:08,256 INFO L226 Difference]: Without dead ends: 2307 [2024-11-08 11:37:08,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:08,261 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 282 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:08,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 120 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 11:37:08,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2024-11-08 11:37:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2024-11-08 11:37:08,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.5923677363399826) internal successors, (3672), 2306 states have internal predecessors, (3672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3672 transitions. [2024-11-08 11:37:08,297 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3672 transitions. Word has length 112 [2024-11-08 11:37:08,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:08,298 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3672 transitions. [2024-11-08 11:37:08,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:08,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3672 transitions. [2024-11-08 11:37:08,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 11:37:08,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:08,305 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:08,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:37:08,305 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:08,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:08,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1971144876, now seen corresponding path program 1 times [2024-11-08 11:37:08,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:08,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61269130] [2024-11-08 11:37:08,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:08,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:08,491 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:37:08,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:08,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61269130] [2024-11-08 11:37:08,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61269130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:08,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:08,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:37:08,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880943993] [2024-11-08 11:37:08,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:08,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:37:08,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:08,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:37:08,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:37:08,497 INFO L87 Difference]: Start difference. First operand 2307 states and 3672 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:10,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:10,376 INFO L93 Difference]: Finished difference Result 6257 states and 9781 transitions. [2024-11-08 11:37:10,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:37:10,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 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 117 [2024-11-08 11:37:10,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:10,386 INFO L225 Difference]: With dead ends: 6257 [2024-11-08 11:37:10,387 INFO L226 Difference]: Without dead ends: 3952 [2024-11-08 11:37:10,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:37:10,390 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 886 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 2131 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 2386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 2131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:10,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 191 Invalid, 2386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 2131 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 11:37:10,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2024-11-08 11:37:10,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952. [2024-11-08 11:37:10,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3951 states have (on average 1.4312832194381169) internal successors, (5655), 3951 states have internal predecessors, (5655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:10,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 5655 transitions. [2024-11-08 11:37:10,442 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 5655 transitions. Word has length 117 [2024-11-08 11:37:10,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:10,442 INFO L471 AbstractCegarLoop]: Abstraction has 3952 states and 5655 transitions. [2024-11-08 11:37:10,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:10,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 5655 transitions. [2024-11-08 11:37:10,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 11:37:10,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:10,444 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:10,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:37:10,444 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:10,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:10,445 INFO L85 PathProgramCache]: Analyzing trace with hash -912563919, now seen corresponding path program 1 times [2024-11-08 11:37:10,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:10,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124761894] [2024-11-08 11:37:10,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:10,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:10,556 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:37:10,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:10,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124761894] [2024-11-08 11:37:10,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124761894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:10,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:10,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:37:10,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151648] [2024-11-08 11:37:10,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:10,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:37:10,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:10,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:37:10,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:10,562 INFO L87 Difference]: Start difference. First operand 3952 states and 5655 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:11,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:11,655 INFO L93 Difference]: Finished difference Result 7573 states and 10973 transitions. [2024-11-08 11:37:11,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:37:11,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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 131 [2024-11-08 11:37:11,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:11,665 INFO L225 Difference]: With dead ends: 7573 [2024-11-08 11:37:11,665 INFO L226 Difference]: Without dead ends: 3952 [2024-11-08 11:37:11,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:11,671 INFO L432 NwaCegarLoop]: 534 mSDtfsCounter, 340 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:11,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 540 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:37:11,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2024-11-08 11:37:11,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952. [2024-11-08 11:37:11,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3951 states have (on average 1.3153631991900785) internal successors, (5197), 3951 states have internal predecessors, (5197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:11,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 5197 transitions. [2024-11-08 11:37:11,717 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 5197 transitions. Word has length 131 [2024-11-08 11:37:11,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:11,718 INFO L471 AbstractCegarLoop]: Abstraction has 3952 states and 5197 transitions. [2024-11-08 11:37:11,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 5197 transitions. [2024-11-08 11:37:11,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-08 11:37:11,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:11,723 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:37:11,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:37:11,723 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:11,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:11,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1359915327, now seen corresponding path program 1 times [2024-11-08 11:37:11,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:11,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559757836] [2024-11-08 11:37:11,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:11,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:11,878 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-08 11:37:11,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:11,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559757836] [2024-11-08 11:37:11,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559757836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:11,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:11,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:37:11,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275053725] [2024-11-08 11:37:11,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:11,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:37:11,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:11,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:37:11,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:11,880 INFO L87 Difference]: Start difference. First operand 3952 states and 5197 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:12,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:12,895 INFO L93 Difference]: Finished difference Result 8889 states and 11783 transitions. [2024-11-08 11:37:12,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:37:12,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2024-11-08 11:37:12,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:12,905 INFO L225 Difference]: With dead ends: 8889 [2024-11-08 11:37:12,905 INFO L226 Difference]: Without dead ends: 4610 [2024-11-08 11:37:12,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:12,909 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 345 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:12,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:37:12,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2024-11-08 11:37:12,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 4610. [2024-11-08 11:37:12,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4610 states, 4609 states have (on average 1.0772401822521154) internal successors, (4965), 4609 states have internal predecessors, (4965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 4965 transitions. [2024-11-08 11:37:12,953 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 4965 transitions. Word has length 232 [2024-11-08 11:37:12,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:12,954 INFO L471 AbstractCegarLoop]: Abstraction has 4610 states and 4965 transitions. [2024-11-08 11:37:12,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 4965 transitions. [2024-11-08 11:37:12,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2024-11-08 11:37:12,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:12,958 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:12,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:37:12,959 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:12,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:12,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1195091839, now seen corresponding path program 1 times [2024-11-08 11:37:12,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:12,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444556166] [2024-11-08 11:37:12,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:12,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:13,184 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-08 11:37:13,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:13,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444556166] [2024-11-08 11:37:13,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444556166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:13,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:13,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:37:13,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416452890] [2024-11-08 11:37:13,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:13,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:37:13,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:13,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:37:13,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:13,187 INFO L87 Difference]: Start difference. First operand 4610 states and 4965 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:13,908 INFO L93 Difference]: Finished difference Result 12179 states and 13204 transitions. [2024-11-08 11:37:13,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:37:13,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 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 383 [2024-11-08 11:37:13,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:13,925 INFO L225 Difference]: With dead ends: 12179 [2024-11-08 11:37:13,926 INFO L226 Difference]: Without dead ends: 8229 [2024-11-08 11:37:13,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:13,932 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 288 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:13,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 421 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:37:13,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2024-11-08 11:37:14,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 8229. [2024-11-08 11:37:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8229 states, 8228 states have (on average 1.0651434127369956) internal successors, (8764), 8228 states have internal predecessors, (8764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:14,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8764 transitions. [2024-11-08 11:37:14,089 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8764 transitions. Word has length 383 [2024-11-08 11:37:14,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:14,091 INFO L471 AbstractCegarLoop]: Abstraction has 8229 states and 8764 transitions. [2024-11-08 11:37:14,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:14,092 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8764 transitions. [2024-11-08 11:37:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2024-11-08 11:37:14,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:14,097 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:14,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:37:14,097 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:14,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:14,098 INFO L85 PathProgramCache]: Analyzing trace with hash -502550951, now seen corresponding path program 1 times [2024-11-08 11:37:14,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:14,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921475518] [2024-11-08 11:37:14,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:14,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:14,761 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-08 11:37:14,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:14,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921475518] [2024-11-08 11:37:14,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921475518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:14,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:14,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:37:14,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590842608] [2024-11-08 11:37:14,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:14,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:37:14,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:14,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:37:14,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:37:14,765 INFO L87 Difference]: Start difference. First operand 8229 states and 8764 transitions. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:15,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:15,897 INFO L93 Difference]: Finished difference Result 15798 states and 16856 transitions. [2024-11-08 11:37:15,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:37:15,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 3 states have internal predecessors, (452), 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 493 [2024-11-08 11:37:15,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:15,914 INFO L225 Difference]: With dead ends: 15798 [2024-11-08 11:37:15,915 INFO L226 Difference]: Without dead ends: 8229 [2024-11-08 11:37:15,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:37:15,922 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 399 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:15,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 81 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 11:37:15,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2024-11-08 11:37:15,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 8229. [2024-11-08 11:37:15,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8229 states, 8228 states have (on average 1.0587019931939718) internal successors, (8711), 8228 states have internal predecessors, (8711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:15,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8711 transitions. [2024-11-08 11:37:16,000 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8711 transitions. Word has length 493 [2024-11-08 11:37:16,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:16,000 INFO L471 AbstractCegarLoop]: Abstraction has 8229 states and 8711 transitions. [2024-11-08 11:37:16,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:16,001 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8711 transitions. [2024-11-08 11:37:16,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2024-11-08 11:37:16,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:16,011 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:16,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:37:16,011 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:16,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:16,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1835960807, now seen corresponding path program 1 times [2024-11-08 11:37:16,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:16,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168613688] [2024-11-08 11:37:16,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:16,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:16,494 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 611 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-08 11:37:16,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:16,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168613688] [2024-11-08 11:37:16,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168613688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:16,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:16,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:37:16,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854933735] [2024-11-08 11:37:16,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:16,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:37:16,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:16,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:37:16,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:16,497 INFO L87 Difference]: Start difference. First operand 8229 states and 8711 transitions. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:17,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:17,242 INFO L93 Difference]: Finished difference Result 19088 states and 20192 transitions. [2024-11-08 11:37:17,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:37:17,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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 597 [2024-11-08 11:37:17,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:17,259 INFO L225 Difference]: With dead ends: 19088 [2024-11-08 11:37:17,259 INFO L226 Difference]: Without dead ends: 11519 [2024-11-08 11:37:17,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:17,267 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 223 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:17,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 36 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:37:17,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11519 states. [2024-11-08 11:37:17,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11519 to 10861. [2024-11-08 11:37:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10861 states, 10860 states have (on average 1.0458563535911602) internal successors, (11358), 10860 states have internal predecessors, (11358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:17,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 11358 transitions. [2024-11-08 11:37:17,405 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 11358 transitions. Word has length 597 [2024-11-08 11:37:17,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:17,406 INFO L471 AbstractCegarLoop]: Abstraction has 10861 states and 11358 transitions. [2024-11-08 11:37:17,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:17,407 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 11358 transitions. [2024-11-08 11:37:17,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2024-11-08 11:37:17,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:17,416 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:17,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:37:17,417 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:17,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:17,417 INFO L85 PathProgramCache]: Analyzing trace with hash 515894490, now seen corresponding path program 1 times [2024-11-08 11:37:17,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:17,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741352625] [2024-11-08 11:37:17,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:17,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:17,720 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-08 11:37:17,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:17,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741352625] [2024-11-08 11:37:17,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741352625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:17,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:17,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:37:17,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425660296] [2024-11-08 11:37:17,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:17,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:37:17,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:17,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:37:17,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:17,724 INFO L87 Difference]: Start difference. First operand 10861 states and 11358 transitions. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:18,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:18,400 INFO L93 Difference]: Finished difference Result 21062 states and 22047 transitions. [2024-11-08 11:37:18,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:37:18,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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 601 [2024-11-08 11:37:18,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:18,414 INFO L225 Difference]: With dead ends: 21062 [2024-11-08 11:37:18,414 INFO L226 Difference]: Without dead ends: 10861 [2024-11-08 11:37:18,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:18,420 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 302 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:18,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 419 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:37:18,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10861 states. [2024-11-08 11:37:18,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10861 to 10532. [2024-11-08 11:37:18,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10532 states, 10531 states have (on average 1.040736872091919) internal successors, (10960), 10531 states have internal predecessors, (10960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:18,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10532 states to 10532 states and 10960 transitions. [2024-11-08 11:37:18,579 INFO L78 Accepts]: Start accepts. Automaton has 10532 states and 10960 transitions. Word has length 601 [2024-11-08 11:37:18,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:18,580 INFO L471 AbstractCegarLoop]: Abstraction has 10532 states and 10960 transitions. [2024-11-08 11:37:18,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:18,580 INFO L276 IsEmpty]: Start isEmpty. Operand 10532 states and 10960 transitions. [2024-11-08 11:37:18,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 998 [2024-11-08 11:37:18,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:18,590 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:18,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:37:18,590 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:18,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:18,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2059075993, now seen corresponding path program 1 times [2024-11-08 11:37:18,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:18,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526844042] [2024-11-08 11:37:18,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:18,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:20,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2197 backedges. 1167 proven. 156 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2024-11-08 11:37:20,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:20,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526844042] [2024-11-08 11:37:20,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526844042] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:37:20,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447039875] [2024-11-08 11:37:20,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:20,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:37:20,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:37:20,203 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:37:20,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 11:37:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:20,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 1181 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:37:20,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:37:20,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2197 backedges. 1276 proven. 0 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2024-11-08 11:37:20,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:37:20,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447039875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:20,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:37:20,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-08 11:37:20,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187973359] [2024-11-08 11:37:20,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:20,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:37:20,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:20,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:37:20,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:37:20,694 INFO L87 Difference]: Start difference. First operand 10532 states and 10960 transitions. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:21,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:21,390 INFO L93 Difference]: Finished difference Result 23036 states and 24042 transitions. [2024-11-08 11:37:21,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:37:21,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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 997 [2024-11-08 11:37:21,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:21,405 INFO L225 Difference]: With dead ends: 23036 [2024-11-08 11:37:21,405 INFO L226 Difference]: Without dead ends: 13164 [2024-11-08 11:37:21,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1001 GetRequests, 996 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:37:21,415 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 199 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:21,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 95 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:37:21,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2024-11-08 11:37:21,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 13164. [2024-11-08 11:37:21,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 1.0369216743903364) internal successors, (13649), 13163 states have internal predecessors, (13649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:21,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13649 transitions. [2024-11-08 11:37:21,521 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13649 transitions. Word has length 997 [2024-11-08 11:37:21,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:21,522 INFO L471 AbstractCegarLoop]: Abstraction has 13164 states and 13649 transitions. [2024-11-08 11:37:21,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:21,522 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13649 transitions. [2024-11-08 11:37:21,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1008 [2024-11-08 11:37:21,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:21,535 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:37:21,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 11:37:21,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 11:37:21,736 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:21,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:21,737 INFO L85 PathProgramCache]: Analyzing trace with hash -213669757, now seen corresponding path program 1 times [2024-11-08 11:37:21,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:21,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524727907] [2024-11-08 11:37:21,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:21,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1941 backedges. 1231 proven. 0 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2024-11-08 11:37:23,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:23,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524727907] [2024-11-08 11:37:23,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524727907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:23,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:23,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:37:23,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351368571] [2024-11-08 11:37:23,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:23,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:37:23,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:23,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:37:23,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:37:23,071 INFO L87 Difference]: Start difference. First operand 13164 states and 13649 transitions. Second operand has 4 states, 4 states have (on average 167.0) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:24,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:24,283 INFO L93 Difference]: Finished difference Result 25997 states and 26965 transitions. [2024-11-08 11:37:24,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:37:24,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 167.0) internal successors, (668), 3 states have internal predecessors, (668), 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 1007 [2024-11-08 11:37:24,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:24,300 INFO L225 Difference]: With dead ends: 25997 [2024-11-08 11:37:24,300 INFO L226 Difference]: Without dead ends: 13164 [2024-11-08 11:37:24,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:37:24,312 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 268 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:24,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 113 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 11:37:24,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2024-11-08 11:37:24,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 13164. [2024-11-08 11:37:24,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 1.0365418217731521) internal successors, (13644), 13163 states have internal predecessors, (13644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:24,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13644 transitions. [2024-11-08 11:37:24,436 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13644 transitions. Word has length 1007 [2024-11-08 11:37:24,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:24,437 INFO L471 AbstractCegarLoop]: Abstraction has 13164 states and 13644 transitions. [2024-11-08 11:37:24,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 167.0) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:24,437 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13644 transitions. [2024-11-08 11:37:24,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1069 [2024-11-08 11:37:24,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:24,451 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:24,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 11:37:24,451 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:24,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:24,451 INFO L85 PathProgramCache]: Analyzing trace with hash 434228981, now seen corresponding path program 1 times [2024-11-08 11:37:24,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:24,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990066019] [2024-11-08 11:37:24,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:24,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:24,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2063 backedges. 1360 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-08 11:37:24,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:24,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990066019] [2024-11-08 11:37:24,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990066019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:24,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:24,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:37:24,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526671888] [2024-11-08 11:37:24,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:24,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:37:24,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:24,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:37:24,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:24,960 INFO L87 Difference]: Start difference. First operand 13164 states and 13644 transitions. Second operand has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:25,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:25,636 INFO L93 Difference]: Finished difference Result 28300 states and 29369 transitions. [2024-11-08 11:37:25,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:37:25,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 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 1068 [2024-11-08 11:37:25,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:25,655 INFO L225 Difference]: With dead ends: 28300 [2024-11-08 11:37:25,655 INFO L226 Difference]: Without dead ends: 15796 [2024-11-08 11:37:25,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:25,665 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:25,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 430 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:37:25,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15796 states. [2024-11-08 11:37:25,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15796 to 15467. [2024-11-08 11:37:25,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15467 states, 15466 states have (on average 1.0318117160222424) internal successors, (15958), 15466 states have internal predecessors, (15958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:25,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15467 states to 15467 states and 15958 transitions. [2024-11-08 11:37:25,782 INFO L78 Accepts]: Start accepts. Automaton has 15467 states and 15958 transitions. Word has length 1068 [2024-11-08 11:37:25,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:25,783 INFO L471 AbstractCegarLoop]: Abstraction has 15467 states and 15958 transitions. [2024-11-08 11:37:25,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:25,784 INFO L276 IsEmpty]: Start isEmpty. Operand 15467 states and 15958 transitions. [2024-11-08 11:37:25,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1070 [2024-11-08 11:37:25,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:25,797 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:25,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 11:37:25,798 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:25,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:25,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1732422690, now seen corresponding path program 1 times [2024-11-08 11:37:25,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:25,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915260194] [2024-11-08 11:37:25,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:25,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2068 backedges. 254 proven. 1075 refuted. 0 times theorem prover too weak. 739 trivial. 0 not checked. [2024-11-08 11:37:26,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:26,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915260194] [2024-11-08 11:37:26,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915260194] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:37:26,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971275322] [2024-11-08 11:37:26,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:26,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:37:26,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:37:26,821 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:37:26,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 11:37:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:27,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 1255 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:37:27,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:37:27,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2068 backedges. 964 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 11:37:27,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:37:27,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971275322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:27,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:37:27,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-08 11:37:27,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885787240] [2024-11-08 11:37:27,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:27,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:37:27,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:27,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:37:27,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:37:27,389 INFO L87 Difference]: Start difference. First operand 15467 states and 15958 transitions. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:28,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:28,078 INFO L93 Difference]: Finished difference Result 30274 states and 31252 transitions. [2024-11-08 11:37:28,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:37:28,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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 1069 [2024-11-08 11:37:28,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:28,094 INFO L225 Difference]: With dead ends: 30274 [2024-11-08 11:37:28,095 INFO L226 Difference]: Without dead ends: 15467 [2024-11-08 11:37:28,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1074 GetRequests, 1070 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:37:28,104 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 95 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:28,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 377 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:37:28,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15467 states. [2024-11-08 11:37:28,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15467 to 15138. [2024-11-08 11:37:28,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15138 states, 15137 states have (on average 1.0271520116271389) internal successors, (15548), 15137 states have internal predecessors, (15548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:28,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15138 states to 15138 states and 15548 transitions. [2024-11-08 11:37:28,223 INFO L78 Accepts]: Start accepts. Automaton has 15138 states and 15548 transitions. Word has length 1069 [2024-11-08 11:37:28,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:28,224 INFO L471 AbstractCegarLoop]: Abstraction has 15138 states and 15548 transitions. [2024-11-08 11:37:28,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:28,224 INFO L276 IsEmpty]: Start isEmpty. Operand 15138 states and 15548 transitions. [2024-11-08 11:37:28,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1221 [2024-11-08 11:37:28,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:28,241 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:28,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 11:37:28,442 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,SelfDestructingSolverStorable13 [2024-11-08 11:37:28,442 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:28,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:28,443 INFO L85 PathProgramCache]: Analyzing trace with hash -3763904, now seen corresponding path program 1 times [2024-11-08 11:37:28,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:28,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246827594] [2024-11-08 11:37:28,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:28,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:29,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3220 backedges. 808 proven. 0 refuted. 0 times theorem prover too weak. 2412 trivial. 0 not checked. [2024-11-08 11:37:29,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:29,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246827594] [2024-11-08 11:37:29,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246827594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:29,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:29,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:37:29,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318710229] [2024-11-08 11:37:29,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:29,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:37:29,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:29,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:37:29,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:29,225 INFO L87 Difference]: Start difference. First operand 15138 states and 15548 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:29,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:29,928 INFO L93 Difference]: Finished difference Result 32906 states and 33860 transitions. [2024-11-08 11:37:29,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:37:29,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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 1220 [2024-11-08 11:37:29,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:29,945 INFO L225 Difference]: With dead ends: 32906 [2024-11-08 11:37:29,945 INFO L226 Difference]: Without dead ends: 16125 [2024-11-08 11:37:29,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:29,955 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 273 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:29,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 412 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:37:29,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16125 states. [2024-11-08 11:37:30,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16125 to 14151. [2024-11-08 11:37:30,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14151 states, 14150 states have (on average 1.0254416961130741) internal successors, (14510), 14150 states have internal predecessors, (14510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:30,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14510 transitions. [2024-11-08 11:37:30,065 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 14510 transitions. Word has length 1220 [2024-11-08 11:37:30,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:30,066 INFO L471 AbstractCegarLoop]: Abstraction has 14151 states and 14510 transitions. [2024-11-08 11:37:30,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:30,066 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 14510 transitions. [2024-11-08 11:37:30,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1349 [2024-11-08 11:37:30,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:30,081 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:30,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 11:37:30,082 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:30,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:30,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1201747577, now seen corresponding path program 1 times [2024-11-08 11:37:30,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:30,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181532793] [2024-11-08 11:37:30,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:30,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:31,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3559 backedges. 759 proven. 1424 refuted. 0 times theorem prover too weak. 1376 trivial. 0 not checked. [2024-11-08 11:37:31,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:31,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181532793] [2024-11-08 11:37:31,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181532793] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:37:31,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652962748] [2024-11-08 11:37:31,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:31,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:37:31,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:37:31,426 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:37:31,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 11:37:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:31,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 1578 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:37:31,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:37:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3559 backedges. 766 proven. 0 refuted. 0 times theorem prover too weak. 2793 trivial. 0 not checked. [2024-11-08 11:37:31,864 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:37:31,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652962748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:31,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:37:31,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-08 11:37:31,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327357731] [2024-11-08 11:37:31,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:31,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:37:31,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:31,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:37:31,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:37:31,866 INFO L87 Difference]: Start difference. First operand 14151 states and 14510 transitions. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:32,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:32,557 INFO L93 Difference]: Finished difference Result 28627 states and 29358 transitions. [2024-11-08 11:37:32,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:37:32,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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 1348 [2024-11-08 11:37:32,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:32,559 INFO L225 Difference]: With dead ends: 28627 [2024-11-08 11:37:32,560 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 11:37:32,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1353 GetRequests, 1349 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:37:32,571 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 281 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:32,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 374 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:37:32,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 11:37:32,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 11:37:32,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:32,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 11:37:32,572 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1348 [2024-11-08 11:37:32,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:32,572 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 11:37:32,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:32,572 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 11:37:32,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 11:37:32,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 11:37:32,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 11:37:32,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:37:32,783 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:32,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 11:37:33,315 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 11:37:33,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:37:33 BoogieIcfgContainer [2024-11-08 11:37:33,328 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 11:37:33,329 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 11:37:33,329 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 11:37:33,329 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 11:37:33,329 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:37:03" (3/4) ... [2024-11-08 11:37:33,331 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 11:37:33,366 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-08 11:37:33,372 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 11:37:33,373 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 11:37:33,377 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 11:37:33,554 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 11:37:33,554 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 11:37:33,554 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 11:37:33,555 INFO L158 Benchmark]: Toolchain (without parser) took 33238.78ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 79.9MB in the beginning and 850.8MB in the end (delta: -770.9MB). Peak memory consumption was 615.3MB. Max. memory is 16.1GB. [2024-11-08 11:37:33,556 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 142.6MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 11:37:33,556 INFO L158 Benchmark]: CACSL2BoogieTranslator took 761.13ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 79.9MB in the beginning and 126.8MB in the end (delta: -46.9MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2024-11-08 11:37:33,556 INFO L158 Benchmark]: Boogie Procedure Inliner took 197.42ms. Allocated memory is still 207.6MB. Free memory was 126.8MB in the beginning and 155.9MB in the end (delta: -29.1MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2024-11-08 11:37:33,557 INFO L158 Benchmark]: Boogie Preprocessor took 264.16ms. Allocated memory is still 207.6MB. Free memory was 155.9MB in the beginning and 127.2MB in the end (delta: 28.7MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2024-11-08 11:37:33,557 INFO L158 Benchmark]: RCFGBuilder took 1802.25ms. Allocated memory was 207.6MB in the beginning and 352.3MB in the end (delta: 144.7MB). Free memory was 127.2MB in the beginning and 276.2MB in the end (delta: -149.0MB). Peak memory consumption was 172.0MB. Max. memory is 16.1GB. [2024-11-08 11:37:33,558 INFO L158 Benchmark]: TraceAbstraction took 29983.00ms. Allocated memory was 352.3MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 276.2MB in the beginning and 877.0MB in the end (delta: -600.8MB). Peak memory consumption was 574.7MB. Max. memory is 16.1GB. [2024-11-08 11:37:33,558 INFO L158 Benchmark]: Witness Printer took 225.84ms. Allocated memory is still 1.5GB. Free memory was 877.0MB in the beginning and 850.8MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 11:37:33,562 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 142.6MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 761.13ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 79.9MB in the beginning and 126.8MB in the end (delta: -46.9MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 197.42ms. Allocated memory is still 207.6MB. Free memory was 126.8MB in the beginning and 155.9MB in the end (delta: -29.1MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 264.16ms. Allocated memory is still 207.6MB. Free memory was 155.9MB in the beginning and 127.2MB in the end (delta: 28.7MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1802.25ms. Allocated memory was 207.6MB in the beginning and 352.3MB in the end (delta: 144.7MB). Free memory was 127.2MB in the beginning and 276.2MB in the end (delta: -149.0MB). Peak memory consumption was 172.0MB. Max. memory is 16.1GB. * TraceAbstraction took 29983.00ms. Allocated memory was 352.3MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 276.2MB in the beginning and 877.0MB in the end (delta: -600.8MB). Peak memory consumption was 574.7MB. Max. memory is 16.1GB. * Witness Printer took 225.84ms. Allocated memory is still 1.5GB. Free memory was 877.0MB in the beginning and 850.8MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. 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: 149]: 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, 396 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.4s, OverallIterations: 16, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5087 SdHoareTripleChecker+Valid, 15.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5087 mSDsluCounter, 3901 SdHoareTripleChecker+Invalid, 12.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 2299 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15370 IncrementalHoareTripleChecker+Invalid, 17669 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2299 mSolverCounterUnsat, 3800 mSDtfsCounter, 15370 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3464 GetRequests, 3434 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15467occurred in iteration=13, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 3619 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 12942 NumberOfCodeBlocks, 12942 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 12923 ConstructedInterpolants, 0 QuantifiedInterpolants, 31284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4014 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 19 InterpolantComputations, 16 PerfectInterpolantSequences, 22219/24874 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: 1783]: Loop Invariant Derived loop invariant: ((((((((a16 <= 8) || (a16 == 9)) || (((0 <= ((long long) 87 + a18)) && (a15 <= 3)) && (a16 == 12))) || (((a15 <= 3) && (a16 == 12)) && (7 <= a12))) || (((a12 <= 5) && (a15 <= 3)) && (a16 == 12))) || (((0 <= ((long long) 87 + a18)) && (a15 <= 3)) && (a16 <= 11))) || (((a15 <= 3) && (7 <= a12)) && (a16 <= 11))) || ((a12 <= 7) && (a16 <= 10))) RESULT: Ultimate proved your program to be correct! [2024-11-08 11:37:33,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE