./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label02.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 30f62f9fddfecd916215dd8f1b75b140359bb989ba38a829add2eea4e4b271dc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:58:52,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:58:52,606 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:58:52,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:58:52,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:58:52,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:58:52,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:58:52,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:58:52,640 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:58:52,642 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:58:52,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:58:52,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:58:52,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:58:52,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:58:52,643 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:58:52,643 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:58:52,643 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:58:52,643 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:58:52,644 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:58:52,644 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:58:52,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:58:52,646 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:58:52,646 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:58:52,646 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:58:52,647 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:58:52,647 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:58:52,647 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:58:52,647 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:58:52,647 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:58:52,648 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:58:52,648 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:58:52,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:58:52,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:58:52,648 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:58:52,648 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:58:52,648 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:58:52,648 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:58:52,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:58:52,649 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:58:52,649 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:58:52,649 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:58:52,650 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:58:52,650 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 -> 30f62f9fddfecd916215dd8f1b75b140359bb989ba38a829add2eea4e4b271dc [2024-10-12 15:58:52,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:58:52,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:58:52,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:58:52,861 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:58:52,862 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:58:52,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label02.c [2024-10-12 15:58:54,075 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:58:54,297 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:58:54,297 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label02.c [2024-10-12 15:58:54,313 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fad66d6f/3321defcb5b64b8faba21f3b0feb06b4/FLAGc5d6a3c70 [2024-10-12 15:58:54,326 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fad66d6f/3321defcb5b64b8faba21f3b0feb06b4 [2024-10-12 15:58:54,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:58:54,329 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:58:54,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:58:54,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:58:54,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:58:54,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:58:54" (1/1) ... [2024-10-12 15:58:54,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@205f0b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:54, skipping insertion in model container [2024-10-12 15:58:54,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:58:54" (1/1) ... [2024-10-12 15:58:54,379 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:58:54,578 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label02.c[7865,7878] [2024-10-12 15:58:54,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:58:54,754 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:58:54,783 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label02.c[7865,7878] [2024-10-12 15:58:54,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:58:54,879 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:58:54,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:54 WrapperNode [2024-10-12 15:58:54,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:58:54,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:58:54,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:58:54,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:58:54,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:54" (1/1) ... [2024-10-12 15:58:54,910 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:54" (1/1) ... [2024-10-12 15:58:54,996 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-10-12 15:58:54,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:58:54,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:58:54,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:58:54,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:58:55,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:54" (1/1) ... [2024-10-12 15:58:55,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:54" (1/1) ... [2024-10-12 15:58:55,022 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:54" (1/1) ... [2024-10-12 15:58:55,067 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 15:58:55,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:54" (1/1) ... [2024-10-12 15:58:55,067 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:54" (1/1) ... [2024-10-12 15:58:55,127 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:54" (1/1) ... [2024-10-12 15:58:55,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:54" (1/1) ... [2024-10-12 15:58:55,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:54" (1/1) ... [2024-10-12 15:58:55,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:54" (1/1) ... [2024-10-12 15:58:55,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:58:55,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:58:55,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:58:55,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:58:55,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:54" (1/1) ... [2024-10-12 15:58:55,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:58:55,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:58:55,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 15:58:55,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 15:58:55,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:58:55,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:58:55,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:58:55,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:58:55,330 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:58:55,331 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:58:56,407 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-12 15:58:56,407 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:58:56,449 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:58:56,449 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:58:56,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:58:56 BoogieIcfgContainer [2024-10-12 15:58:56,450 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:58:56,452 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:58:56,452 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:58:56,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:58:56,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:58:54" (1/3) ... [2024-10-12 15:58:56,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5142433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:58:56, skipping insertion in model container [2024-10-12 15:58:56,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:54" (2/3) ... [2024-10-12 15:58:56,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5142433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:58:56, skipping insertion in model container [2024-10-12 15:58:56,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:58:56" (3/3) ... [2024-10-12 15:58:56,457 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label02.c [2024-10-12 15:58:56,482 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:58:56,483 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:58:56,540 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:58:56,545 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;@545c70d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:58:56,546 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:58:56,550 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:56,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 15:58:56,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:56,558 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:56,559 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:56,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:56,563 INFO L85 PathProgramCache]: Analyzing trace with hash -609861129, now seen corresponding path program 1 times [2024-10-12 15:58:56,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:56,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516543265] [2024-10-12 15:58:56,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:56,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:56,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:56,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:56,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516543265] [2024-10-12 15:58:56,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516543265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:56,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:56,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:58:56,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864219207] [2024-10-12 15:58:56,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:56,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:58:56,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:56,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:58:56,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:58:56,747 INFO L87 Difference]: Start difference. First operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:56,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:56,790 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2024-10-12 15:58:56,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:58:56,793 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-12 15:58:56,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:56,801 INFO L225 Difference]: With dead ends: 441 [2024-10-12 15:58:56,801 INFO L226 Difference]: Without dead ends: 219 [2024-10-12 15:58:56,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:58:56,806 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:56,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:58:56,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-12 15:58:56,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-12 15:58:56,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:56,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2024-10-12 15:58:56,849 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 53 [2024-10-12 15:58:56,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:56,849 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2024-10-12 15:58:56,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:56,849 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2024-10-12 15:58:56,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 15:58:56,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:56,850 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:56,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:58:56,851 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:56,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:56,851 INFO L85 PathProgramCache]: Analyzing trace with hash -120741172, now seen corresponding path program 1 times [2024-10-12 15:58:56,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:56,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4890883] [2024-10-12 15:58:56,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:56,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:57,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:57,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:57,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4890883] [2024-10-12 15:58:57,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4890883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:57,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:57,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:58:57,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32633211] [2024-10-12 15:58:57,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:57,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:57,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:57,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:57,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:57,013 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:57,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:57,741 INFO L93 Difference]: Finished difference Result 639 states and 1042 transitions. [2024-10-12 15:58:57,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:57,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-12 15:58:57,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:57,744 INFO L225 Difference]: With dead ends: 639 [2024-10-12 15:58:57,747 INFO L226 Difference]: Without dead ends: 421 [2024-10-12 15:58:57,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:57,749 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 158 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:57,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 120 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:58:57,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-10-12 15:58:57,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 411. [2024-10-12 15:58:57,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.524390243902439) internal successors, (625), 410 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:57,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 625 transitions. [2024-10-12 15:58:57,773 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 625 transitions. Word has length 53 [2024-10-12 15:58:57,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:57,774 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 625 transitions. [2024-10-12 15:58:57,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:57,774 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 625 transitions. [2024-10-12 15:58:57,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-12 15:58:57,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:57,777 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:57,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:58:57,777 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:57,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:57,778 INFO L85 PathProgramCache]: Analyzing trace with hash 537119433, now seen corresponding path program 1 times [2024-10-12 15:58:57,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:57,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137307048] [2024-10-12 15:58:57,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:57,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:57,923 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:57,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:57,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137307048] [2024-10-12 15:58:57,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137307048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:57,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:57,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:58:57,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14569100] [2024-10-12 15:58:57,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:57,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:57,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:57,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:57,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:57,925 INFO L87 Difference]: Start difference. First operand 411 states and 625 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:58,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:58,543 INFO L93 Difference]: Finished difference Result 1193 states and 1820 transitions. [2024-10-12 15:58:58,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:58,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-10-12 15:58:58,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:58,546 INFO L225 Difference]: With dead ends: 1193 [2024-10-12 15:58:58,546 INFO L226 Difference]: Without dead ends: 783 [2024-10-12 15:58:58,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:58,550 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 175 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:58,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 152 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:58:58,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2024-10-12 15:58:58,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2024-10-12 15:58:58,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 1.3746803069053708) internal successors, (1075), 782 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:58,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1075 transitions. [2024-10-12 15:58:58,575 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1075 transitions. Word has length 119 [2024-10-12 15:58:58,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:58,576 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1075 transitions. [2024-10-12 15:58:58,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:58,576 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1075 transitions. [2024-10-12 15:58:58,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-12 15:58:58,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:58,578 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:58,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:58:58,578 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:58,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:58,579 INFO L85 PathProgramCache]: Analyzing trace with hash -430333825, now seen corresponding path program 1 times [2024-10-12 15:58:58,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:58,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585504415] [2024-10-12 15:58:58,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:58,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:58,854 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:58,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:58,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585504415] [2024-10-12 15:58:58,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585504415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:58,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:58,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:58:58,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52654103] [2024-10-12 15:58:58,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:58,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:58,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:58,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:58,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:58,856 INFO L87 Difference]: Start difference. First operand 783 states and 1075 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:59,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:59,368 INFO L93 Difference]: Finished difference Result 1935 states and 2598 transitions. [2024-10-12 15:58:59,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:59,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2024-10-12 15:58:59,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:59,374 INFO L225 Difference]: With dead ends: 1935 [2024-10-12 15:58:59,375 INFO L226 Difference]: Without dead ends: 1153 [2024-10-12 15:58:59,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:59,377 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:59,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 188 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:58:59,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-10-12 15:58:59,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1152. [2024-10-12 15:58:59,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1151 states have (on average 1.2701998262380538) internal successors, (1462), 1151 states have internal predecessors, (1462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:59,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1462 transitions. [2024-10-12 15:58:59,397 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1462 transitions. Word has length 123 [2024-10-12 15:58:59,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:59,397 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1462 transitions. [2024-10-12 15:58:59,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:59,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1462 transitions. [2024-10-12 15:58:59,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-12 15:58:59,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:59,400 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:59,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:58:59,401 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:59,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:59,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1353826200, now seen corresponding path program 1 times [2024-10-12 15:58:59,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:59,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830461576] [2024-10-12 15:58:59,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:59,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:59,584 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-12 15:58:59,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:59,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830461576] [2024-10-12 15:58:59,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830461576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:59,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:59,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:58:59,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296593028] [2024-10-12 15:58:59,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:59,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:59,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:59,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:59,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:59,587 INFO L87 Difference]: Start difference. First operand 1152 states and 1462 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:00,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:00,118 INFO L93 Difference]: Finished difference Result 2493 states and 3188 transitions. [2024-10-12 15:59:00,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:00,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 165 [2024-10-12 15:59:00,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:00,123 INFO L225 Difference]: With dead ends: 2493 [2024-10-12 15:59:00,123 INFO L226 Difference]: Without dead ends: 1526 [2024-10-12 15:59:00,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:00,124 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 106 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:00,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 152 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:59:00,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2024-10-12 15:59:00,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1525. [2024-10-12 15:59:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1524 states have (on average 1.2559055118110236) internal successors, (1914), 1524 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:00,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 1914 transitions. [2024-10-12 15:59:00,142 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 1914 transitions. Word has length 165 [2024-10-12 15:59:00,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:00,143 INFO L471 AbstractCegarLoop]: Abstraction has 1525 states and 1914 transitions. [2024-10-12 15:59:00,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1914 transitions. [2024-10-12 15:59:00,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-12 15:59:00,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:00,146 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:00,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:59:00,147 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:00,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:00,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1991490179, now seen corresponding path program 1 times [2024-10-12 15:59:00,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:00,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969640361] [2024-10-12 15:59:00,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:00,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:00,298 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:59:00,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:00,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969640361] [2024-10-12 15:59:00,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969640361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:00,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:00,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:59:00,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557520174] [2024-10-12 15:59:00,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:00,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:00,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:00,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:00,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:00,301 INFO L87 Difference]: Start difference. First operand 1525 states and 1914 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:00,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:00,842 INFO L93 Difference]: Finished difference Result 2863 states and 3635 transitions. [2024-10-12 15:59:00,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:00,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 180 [2024-10-12 15:59:00,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:00,848 INFO L225 Difference]: With dead ends: 2863 [2024-10-12 15:59:00,848 INFO L226 Difference]: Without dead ends: 1523 [2024-10-12 15:59:00,850 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-10-12 15:59:00,852 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 181 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:00,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 303 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:59:00,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2024-10-12 15:59:00,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1523. [2024-10-12 15:59:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1523 states, 1522 states have (on average 1.2109067017082786) internal successors, (1843), 1522 states have internal predecessors, (1843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1843 transitions. [2024-10-12 15:59:00,874 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1843 transitions. Word has length 180 [2024-10-12 15:59:00,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:00,877 INFO L471 AbstractCegarLoop]: Abstraction has 1523 states and 1843 transitions. [2024-10-12 15:59:00,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:00,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1843 transitions. [2024-10-12 15:59:00,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-10-12 15:59:00,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:00,879 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 15:59:00,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 15:59:00,880 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:00,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:00,880 INFO L85 PathProgramCache]: Analyzing trace with hash -127289061, now seen corresponding path program 1 times [2024-10-12 15:59:00,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:00,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313017116] [2024-10-12 15:59:00,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:00,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:01,039 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-12 15:59:01,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:01,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313017116] [2024-10-12 15:59:01,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313017116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:01,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:01,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:59:01,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613921628] [2024-10-12 15:59:01,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:01,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:01,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:01,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:01,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:01,041 INFO L87 Difference]: Start difference. First operand 1523 states and 1843 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:01,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:01,658 INFO L93 Difference]: Finished difference Result 3602 states and 4426 transitions. [2024-10-12 15:59:01,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:01,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 235 [2024-10-12 15:59:01,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:01,664 INFO L225 Difference]: With dead ends: 3602 [2024-10-12 15:59:01,664 INFO L226 Difference]: Without dead ends: 2264 [2024-10-12 15:59:01,666 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-10-12 15:59:01,666 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 143 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:01,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 383 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:59:01,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2024-10-12 15:59:01,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2075. [2024-10-12 15:59:01,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2075 states, 2074 states have (on average 1.1923818707810994) internal successors, (2473), 2074 states have internal predecessors, (2473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:01,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 2473 transitions. [2024-10-12 15:59:01,689 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 2473 transitions. Word has length 235 [2024-10-12 15:59:01,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:01,689 INFO L471 AbstractCegarLoop]: Abstraction has 2075 states and 2473 transitions. [2024-10-12 15:59:01,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:01,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 2473 transitions. [2024-10-12 15:59:01,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-12 15:59:01,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:01,692 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:01,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:59:01,692 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:01,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:01,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1431254700, now seen corresponding path program 1 times [2024-10-12 15:59:01,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:01,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743825763] [2024-10-12 15:59:01,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:01,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:01,863 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-12 15:59:01,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:01,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743825763] [2024-10-12 15:59:01,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743825763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:01,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:01,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:59:01,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414300885] [2024-10-12 15:59:01,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:01,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:01,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:01,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:01,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:01,865 INFO L87 Difference]: Start difference. First operand 2075 states and 2473 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:02,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:02,480 INFO L93 Difference]: Finished difference Result 4889 states and 5876 transitions. [2024-10-12 15:59:02,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:02,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 241 [2024-10-12 15:59:02,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:02,488 INFO L225 Difference]: With dead ends: 4889 [2024-10-12 15:59:02,488 INFO L226 Difference]: Without dead ends: 2815 [2024-10-12 15:59:02,490 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-10-12 15:59:02,491 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 142 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:02,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 384 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:59:02,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2815 states. [2024-10-12 15:59:02,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2815 to 2810. [2024-10-12 15:59:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2810 states, 2809 states have (on average 1.1737273050907797) internal successors, (3297), 2809 states have internal predecessors, (3297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:02,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 3297 transitions. [2024-10-12 15:59:02,524 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 3297 transitions. Word has length 241 [2024-10-12 15:59:02,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:02,524 INFO L471 AbstractCegarLoop]: Abstraction has 2810 states and 3297 transitions. [2024-10-12 15:59:02,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:02,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 3297 transitions. [2024-10-12 15:59:02,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-10-12 15:59:02,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:02,528 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-12 15:59:02,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 15:59:02,528 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:02,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:02,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1311249506, now seen corresponding path program 1 times [2024-10-12 15:59:02,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:02,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951128574] [2024-10-12 15:59:02,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:02,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:02,754 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:59:02,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:02,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951128574] [2024-10-12 15:59:02,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951128574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:02,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:02,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:59:02,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097748169] [2024-10-12 15:59:02,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:02,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:59:02,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:02,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:59:02,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:59:02,758 INFO L87 Difference]: Start difference. First operand 2810 states and 3297 transitions. Second operand has 4 states, 4 states have (on average 70.0) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:03,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:03,727 INFO L93 Difference]: Finished difference Result 8955 states and 10587 transitions. [2024-10-12 15:59:03,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:59:03,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 280 [2024-10-12 15:59:03,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:03,742 INFO L225 Difference]: With dead ends: 8955 [2024-10-12 15:59:03,742 INFO L226 Difference]: Without dead ends: 6146 [2024-10-12 15:59:03,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:59:03,746 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 256 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:03,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 83 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 15:59:03,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6146 states. [2024-10-12 15:59:03,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6146 to 5960. [2024-10-12 15:59:03,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5960 states, 5959 states have (on average 1.1758684343010573) internal successors, (7007), 5959 states have internal predecessors, (7007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5960 states to 5960 states and 7007 transitions. [2024-10-12 15:59:03,814 INFO L78 Accepts]: Start accepts. Automaton has 5960 states and 7007 transitions. Word has length 280 [2024-10-12 15:59:03,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:03,815 INFO L471 AbstractCegarLoop]: Abstraction has 5960 states and 7007 transitions. [2024-10-12 15:59:03,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:03,815 INFO L276 IsEmpty]: Start isEmpty. Operand 5960 states and 7007 transitions. [2024-10-12 15:59:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2024-10-12 15:59:03,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:03,820 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:03,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 15:59:03,821 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:03,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:03,821 INFO L85 PathProgramCache]: Analyzing trace with hash -2043282544, now seen corresponding path program 1 times [2024-10-12 15:59:03,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:03,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289836294] [2024-10-12 15:59:03,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:03,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:04,001 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-10-12 15:59:04,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:04,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289836294] [2024-10-12 15:59:04,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289836294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:04,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:04,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:59:04,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294126233] [2024-10-12 15:59:04,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:04,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:04,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:04,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:04,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:04,004 INFO L87 Difference]: Start difference. First operand 5960 states and 7007 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:04,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:04,494 INFO L93 Difference]: Finished difference Result 12098 states and 14258 transitions. [2024-10-12 15:59:04,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:04,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 318 [2024-10-12 15:59:04,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:04,509 INFO L225 Difference]: With dead ends: 12098 [2024-10-12 15:59:04,509 INFO L226 Difference]: Without dead ends: 7247 [2024-10-12 15:59:04,513 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-10-12 15:59:04,514 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 167 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:04,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 144 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:59:04,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7247 states. [2024-10-12 15:59:04,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7247 to 4663. [2024-10-12 15:59:04,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4663 states, 4662 states have (on average 1.17996567996568) internal successors, (5501), 4662 states have internal predecessors, (5501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:04,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4663 states to 4663 states and 5501 transitions. [2024-10-12 15:59:04,572 INFO L78 Accepts]: Start accepts. Automaton has 4663 states and 5501 transitions. Word has length 318 [2024-10-12 15:59:04,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:04,573 INFO L471 AbstractCegarLoop]: Abstraction has 4663 states and 5501 transitions. [2024-10-12 15:59:04,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:04,573 INFO L276 IsEmpty]: Start isEmpty. Operand 4663 states and 5501 transitions. [2024-10-12 15:59:04,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-10-12 15:59:04,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:04,579 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:59:04,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 15:59:04,579 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:04,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:04,580 INFO L85 PathProgramCache]: Analyzing trace with hash -757254023, now seen corresponding path program 1 times [2024-10-12 15:59:04,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:04,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165186084] [2024-10-12 15:59:04,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:04,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:05,046 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 171 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:59:05,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:05,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165186084] [2024-10-12 15:59:05,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165186084] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:59:05,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480342832] [2024-10-12 15:59:05,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:05,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:59:05,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:59:05,050 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:59:05,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 15:59:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:05,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 15:59:05,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:59:06,393 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 171 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:59:06,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:59:07,870 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 171 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:59:07,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480342832] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:59:07,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:59:07,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-12 15:59:07,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464196559] [2024-10-12 15:59:07,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:59:07,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 15:59:07,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:07,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 15:59:07,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-12 15:59:07,873 INFO L87 Difference]: Start difference. First operand 4663 states and 5501 transitions. Second operand has 8 states, 8 states have (on average 72.25) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:09,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:09,848 INFO L93 Difference]: Finished difference Result 12138 states and 14291 transitions. [2024-10-12 15:59:09,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 15:59:09,849 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 72.25) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 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 327 [2024-10-12 15:59:09,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:09,866 INFO L225 Difference]: With dead ends: 12138 [2024-10-12 15:59:09,867 INFO L226 Difference]: Without dead ends: 7844 [2024-10-12 15:59:09,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 650 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2024-10-12 15:59:09,871 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 897 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 2791 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 3145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 2791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:09,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 180 Invalid, 3145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 2791 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 15:59:09,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7844 states. [2024-10-12 15:59:09,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7844 to 4476. [2024-10-12 15:59:09,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4476 states, 4475 states have (on average 1.1736312849162012) internal successors, (5252), 4475 states have internal predecessors, (5252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:09,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4476 states to 4476 states and 5252 transitions. [2024-10-12 15:59:09,960 INFO L78 Accepts]: Start accepts. Automaton has 4476 states and 5252 transitions. Word has length 327 [2024-10-12 15:59:09,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:09,960 INFO L471 AbstractCegarLoop]: Abstraction has 4476 states and 5252 transitions. [2024-10-12 15:59:09,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 72.25) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:09,961 INFO L276 IsEmpty]: Start isEmpty. Operand 4476 states and 5252 transitions. [2024-10-12 15:59:09,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-10-12 15:59:09,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:09,968 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:09,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 15:59:10,169 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-10-12 15:59:10,170 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:10,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:10,171 INFO L85 PathProgramCache]: Analyzing trace with hash 476714590, now seen corresponding path program 1 times [2024-10-12 15:59:10,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:10,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829694129] [2024-10-12 15:59:10,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:10,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:10,978 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 188 proven. 148 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-12 15:59:10,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:10,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829694129] [2024-10-12 15:59:10,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829694129] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:59:10,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463174733] [2024-10-12 15:59:10,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:10,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:59:10,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:59:10,981 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:59:10,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 15:59:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:11,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:59:11,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:59:11,174 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-12 15:59:11,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:59:11,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463174733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:11,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:59:11,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-12 15:59:11,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579763128] [2024-10-12 15:59:11,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:11,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:11,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:11,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:11,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-12 15:59:11,180 INFO L87 Difference]: Start difference. First operand 4476 states and 5252 transitions. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:11,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:11,678 INFO L93 Difference]: Finished difference Result 8777 states and 10329 transitions. [2024-10-12 15:59:11,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:11,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 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 347 [2024-10-12 15:59:11,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:11,684 INFO L225 Difference]: With dead ends: 8777 [2024-10-12 15:59:11,684 INFO L226 Difference]: Without dead ends: 4670 [2024-10-12 15:59:11,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-12 15:59:11,688 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 103 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:11,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 321 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:59:11,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2024-10-12 15:59:11,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4476. [2024-10-12 15:59:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4476 states, 4475 states have (on average 1.1427932960893854) internal successors, (5114), 4475 states have internal predecessors, (5114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4476 states to 4476 states and 5114 transitions. [2024-10-12 15:59:11,722 INFO L78 Accepts]: Start accepts. Automaton has 4476 states and 5114 transitions. Word has length 347 [2024-10-12 15:59:11,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:11,722 INFO L471 AbstractCegarLoop]: Abstraction has 4476 states and 5114 transitions. [2024-10-12 15:59:11,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:11,723 INFO L276 IsEmpty]: Start isEmpty. Operand 4476 states and 5114 transitions. [2024-10-12 15:59:11,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-10-12 15:59:11,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:11,727 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:59:11,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 15:59:11,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-12 15:59:11,927 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:11,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:11,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1282069228, now seen corresponding path program 1 times [2024-10-12 15:59:11,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:11,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180724134] [2024-10-12 15:59:11,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:11,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:12,162 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:59:12,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:12,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180724134] [2024-10-12 15:59:12,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180724134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:12,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:12,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:59:12,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985088009] [2024-10-12 15:59:12,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:12,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:12,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:12,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:12,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:12,165 INFO L87 Difference]: Start difference. First operand 4476 states and 5114 transitions. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:12,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:12,742 INFO L93 Difference]: Finished difference Result 11712 states and 13472 transitions. [2024-10-12 15:59:12,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:12,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 355 [2024-10-12 15:59:12,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:12,750 INFO L225 Difference]: With dead ends: 11712 [2024-10-12 15:59:12,751 INFO L226 Difference]: Without dead ends: 7605 [2024-10-12 15:59:12,753 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-10-12 15:59:12,753 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 56 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:12,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 68 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:59:12,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7605 states. [2024-10-12 15:59:12,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7605 to 7600. [2024-10-12 15:59:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7600 states, 7599 states have (on average 1.137781287011449) internal successors, (8646), 7599 states have internal predecessors, (8646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:12,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7600 states to 7600 states and 8646 transitions. [2024-10-12 15:59:12,811 INFO L78 Accepts]: Start accepts. Automaton has 7600 states and 8646 transitions. Word has length 355 [2024-10-12 15:59:12,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:12,812 INFO L471 AbstractCegarLoop]: Abstraction has 7600 states and 8646 transitions. [2024-10-12 15:59:12,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:12,812 INFO L276 IsEmpty]: Start isEmpty. Operand 7600 states and 8646 transitions. [2024-10-12 15:59:12,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-10-12 15:59:12,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:12,817 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:59:12,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 15:59:12,817 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:12,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:12,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1546401200, now seen corresponding path program 1 times [2024-10-12 15:59:12,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:12,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743158844] [2024-10-12 15:59:12,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:12,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:13,349 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-10-12 15:59:13,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:13,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743158844] [2024-10-12 15:59:13,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743158844] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:59:13,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825974274] [2024-10-12 15:59:13,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:13,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:59:13,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:59:13,351 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-10-12 15:59:13,352 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-10-12 15:59:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:13,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:59:13,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:59:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-10-12 15:59:13,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:59:14,727 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-10-12 15:59:14,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825974274] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 15:59:14,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-12 15:59:14,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-10-12 15:59:14,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190594738] [2024-10-12 15:59:14,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:14,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:14,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:14,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:14,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:59:14,730 INFO L87 Difference]: Start difference. First operand 7600 states and 8646 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:15,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:15,405 INFO L93 Difference]: Finished difference Result 17035 states and 19445 transitions. [2024-10-12 15:59:15,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:15,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 358 [2024-10-12 15:59:15,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:15,417 INFO L225 Difference]: With dead ends: 17035 [2024-10-12 15:59:15,418 INFO L226 Difference]: Without dead ends: 9804 [2024-10-12 15:59:15,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 714 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:59:15,424 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 173 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:15,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 117 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:59:15,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9804 states. [2024-10-12 15:59:15,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9804 to 7963. [2024-10-12 15:59:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7963 states, 7962 states have (on average 1.1312484300427028) internal successors, (9007), 7962 states have internal predecessors, (9007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7963 states to 7963 states and 9007 transitions. [2024-10-12 15:59:15,495 INFO L78 Accepts]: Start accepts. Automaton has 7963 states and 9007 transitions. Word has length 358 [2024-10-12 15:59:15,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:15,496 INFO L471 AbstractCegarLoop]: Abstraction has 7963 states and 9007 transitions. [2024-10-12 15:59:15,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:15,496 INFO L276 IsEmpty]: Start isEmpty. Operand 7963 states and 9007 transitions. [2024-10-12 15:59:15,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2024-10-12 15:59:15,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:15,504 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:15,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 15:59:15,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:59:15,705 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:15,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:15,705 INFO L85 PathProgramCache]: Analyzing trace with hash 288525316, now seen corresponding path program 1 times [2024-10-12 15:59:15,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:15,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380922060] [2024-10-12 15:59:15,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:15,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:15,854 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-12 15:59:15,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:15,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380922060] [2024-10-12 15:59:15,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380922060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:15,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:15,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:59:15,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053524295] [2024-10-12 15:59:15,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:15,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:15,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:15,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:15,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:15,857 INFO L87 Difference]: Start difference. First operand 7963 states and 9007 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:16,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:16,370 INFO L93 Difference]: Finished difference Result 17028 states and 19296 transitions. [2024-10-12 15:59:16,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:16,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 445 [2024-10-12 15:59:16,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:16,382 INFO L225 Difference]: With dead ends: 17028 [2024-10-12 15:59:16,382 INFO L226 Difference]: Without dead ends: 9434 [2024-10-12 15:59:16,389 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-10-12 15:59:16,389 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 101 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:16,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 319 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:59:16,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9434 states. [2024-10-12 15:59:16,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9434 to 7586. [2024-10-12 15:59:16,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7586 states, 7585 states have (on average 1.1198417930125246) internal successors, (8494), 7585 states have internal predecessors, (8494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:16,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7586 states to 7586 states and 8494 transitions. [2024-10-12 15:59:16,488 INFO L78 Accepts]: Start accepts. Automaton has 7586 states and 8494 transitions. Word has length 445 [2024-10-12 15:59:16,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:16,488 INFO L471 AbstractCegarLoop]: Abstraction has 7586 states and 8494 transitions. [2024-10-12 15:59:16,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 7586 states and 8494 transitions. [2024-10-12 15:59:16,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2024-10-12 15:59:16,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:16,496 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:16,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 15:59:16,497 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:16,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:16,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2147392072, now seen corresponding path program 1 times [2024-10-12 15:59:16,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:16,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455228976] [2024-10-12 15:59:16,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:16,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:16,847 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-10-12 15:59:16,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:16,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455228976] [2024-10-12 15:59:16,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455228976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:16,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:16,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:59:16,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687770700] [2024-10-12 15:59:16,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:16,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:16,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:16,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:16,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:16,849 INFO L87 Difference]: Start difference. First operand 7586 states and 8494 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:17,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:17,362 INFO L93 Difference]: Finished difference Result 15358 states and 17217 transitions. [2024-10-12 15:59:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:17,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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 479 [2024-10-12 15:59:17,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:17,373 INFO L225 Difference]: With dead ends: 15358 [2024-10-12 15:59:17,373 INFO L226 Difference]: Without dead ends: 7957 [2024-10-12 15:59:17,380 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-10-12 15:59:17,381 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 88 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:17,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 170 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:59:17,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7957 states. [2024-10-12 15:59:17,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7957 to 7954. [2024-10-12 15:59:17,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7954 states, 7953 states have (on average 1.1080095561423362) internal successors, (8812), 7953 states have internal predecessors, (8812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:17,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7954 states to 7954 states and 8812 transitions. [2024-10-12 15:59:17,487 INFO L78 Accepts]: Start accepts. Automaton has 7954 states and 8812 transitions. Word has length 479 [2024-10-12 15:59:17,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:17,488 INFO L471 AbstractCegarLoop]: Abstraction has 7954 states and 8812 transitions. [2024-10-12 15:59:17,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:17,488 INFO L276 IsEmpty]: Start isEmpty. Operand 7954 states and 8812 transitions. [2024-10-12 15:59:17,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2024-10-12 15:59:17,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:17,498 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:17,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 15:59:17,498 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:17,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:17,498 INFO L85 PathProgramCache]: Analyzing trace with hash 425891575, now seen corresponding path program 1 times [2024-10-12 15:59:17,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:17,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655577691] [2024-10-12 15:59:17,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:17,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:17,869 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-10-12 15:59:17,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:17,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655577691] [2024-10-12 15:59:17,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655577691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:17,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:17,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 15:59:17,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446760718] [2024-10-12 15:59:17,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:17,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:59:17,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:17,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:59:17,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:59:17,871 INFO L87 Difference]: Start difference. First operand 7954 states and 8812 transitions. Second operand has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 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-10-12 15:59:18,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:18,666 INFO L93 Difference]: Finished difference Result 17378 states and 19316 transitions. [2024-10-12 15:59:18,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:59:18,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 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 480 [2024-10-12 15:59:18,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:18,676 INFO L225 Difference]: With dead ends: 17378 [2024-10-12 15:59:18,676 INFO L226 Difference]: Without dead ends: 9793 [2024-10-12 15:59:18,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:59:18,682 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 283 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:18,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 164 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:59:18,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9793 states. [2024-10-12 15:59:18,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9793 to 8873. [2024-10-12 15:59:18,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8873 states, 8872 states have (on average 1.1000901713255185) internal successors, (9760), 8872 states have internal predecessors, (9760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8873 states to 8873 states and 9760 transitions. [2024-10-12 15:59:18,751 INFO L78 Accepts]: Start accepts. Automaton has 8873 states and 9760 transitions. Word has length 480 [2024-10-12 15:59:18,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:18,752 INFO L471 AbstractCegarLoop]: Abstraction has 8873 states and 9760 transitions. [2024-10-12 15:59:18,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 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-10-12 15:59:18,752 INFO L276 IsEmpty]: Start isEmpty. Operand 8873 states and 9760 transitions. [2024-10-12 15:59:18,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2024-10-12 15:59:18,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:18,761 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:18,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 15:59:18,761 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:18,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:18,761 INFO L85 PathProgramCache]: Analyzing trace with hash 539324632, now seen corresponding path program 1 times [2024-10-12 15:59:18,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:18,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859811347] [2024-10-12 15:59:18,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:18,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 578 proven. 133 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-12 15:59:19,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:19,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859811347] [2024-10-12 15:59:19,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859811347] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:59:19,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626316469] [2024-10-12 15:59:19,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:19,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:59:19,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:59:19,343 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:59:19,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 15:59:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:19,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:59:19,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:59:19,586 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 659 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-12 15:59:19,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:59:19,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626316469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:19,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:59:19,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-12 15:59:19,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751598394] [2024-10-12 15:59:19,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:19,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:19,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:19,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:19,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:59:19,588 INFO L87 Difference]: Start difference. First operand 8873 states and 9760 transitions. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:20,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:20,057 INFO L93 Difference]: Finished difference Result 18304 states and 20182 transitions. [2024-10-12 15:59:20,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:20,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 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 517 [2024-10-12 15:59:20,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:20,066 INFO L225 Difference]: With dead ends: 18304 [2024-10-12 15:59:20,066 INFO L226 Difference]: Without dead ends: 9800 [2024-10-12 15:59:20,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 517 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:59:20,073 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 93 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:20,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 326 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:59:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9800 states. [2024-10-12 15:59:20,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9800 to 9609. [2024-10-12 15:59:20,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9609 states, 9608 states have (on average 1.0999167360532889) internal successors, (10568), 9608 states have internal predecessors, (10568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:20,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9609 states to 9609 states and 10568 transitions. [2024-10-12 15:59:20,144 INFO L78 Accepts]: Start accepts. Automaton has 9609 states and 10568 transitions. Word has length 517 [2024-10-12 15:59:20,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:20,145 INFO L471 AbstractCegarLoop]: Abstraction has 9609 states and 10568 transitions. [2024-10-12 15:59:20,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:20,146 INFO L276 IsEmpty]: Start isEmpty. Operand 9609 states and 10568 transitions. [2024-10-12 15:59:20,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2024-10-12 15:59:20,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:20,156 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, 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:20,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 15:59:20,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-12 15:59:20,356 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:20,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:20,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1689724126, now seen corresponding path program 1 times [2024-10-12 15:59:20,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:20,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571263665] [2024-10-12 15:59:20,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:20,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 659 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-10-12 15:59:20,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:20,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571263665] [2024-10-12 15:59:20,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571263665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:20,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:20,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:59:20,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667917014] [2024-10-12 15:59:20,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:20,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:20,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:20,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:20,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:20,679 INFO L87 Difference]: Start difference. First operand 9609 states and 10568 transitions. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:21,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:21,291 INFO L93 Difference]: Finished difference Result 20508 states and 22626 transitions. [2024-10-12 15:59:21,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:21,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 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 571 [2024-10-12 15:59:21,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:21,302 INFO L225 Difference]: With dead ends: 20508 [2024-10-12 15:59:21,302 INFO L226 Difference]: Without dead ends: 11268 [2024-10-12 15:59:21,309 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-10-12 15:59:21,310 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 119 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:21,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 71 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:59:21,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11268 states. [2024-10-12 15:59:21,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11268 to 9425. [2024-10-12 15:59:21,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9425 states, 9424 states have (on average 1.0980475382003396) internal successors, (10348), 9424 states have internal predecessors, (10348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9425 states to 9425 states and 10348 transitions. [2024-10-12 15:59:21,432 INFO L78 Accepts]: Start accepts. Automaton has 9425 states and 10348 transitions. Word has length 571 [2024-10-12 15:59:21,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:21,432 INFO L471 AbstractCegarLoop]: Abstraction has 9425 states and 10348 transitions. [2024-10-12 15:59:21,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:21,433 INFO L276 IsEmpty]: Start isEmpty. Operand 9425 states and 10348 transitions. [2024-10-12 15:59:21,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 682 [2024-10-12 15:59:21,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:21,447 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 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-10-12 15:59:21,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 15:59:21,447 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:21,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:21,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1916743252, now seen corresponding path program 1 times [2024-10-12 15:59:21,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:21,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794511104] [2024-10-12 15:59:21,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:21,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:21,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 1189 proven. 0 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2024-10-12 15:59:21,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:21,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794511104] [2024-10-12 15:59:21,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794511104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:21,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:21,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:59:21,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657164193] [2024-10-12 15:59:21,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:21,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:59:21,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:21,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:59:21,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:59:21,887 INFO L87 Difference]: Start difference. First operand 9425 states and 10348 transitions. Second operand has 4 states, 4 states have (on average 89.0) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:22,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:22,606 INFO L93 Difference]: Finished difference Result 20332 states and 22349 transitions. [2024-10-12 15:59:22,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:59:22,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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 681 [2024-10-12 15:59:22,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:22,614 INFO L225 Difference]: With dead ends: 20332 [2024-10-12 15:59:22,614 INFO L226 Difference]: Without dead ends: 11091 [2024-10-12 15:59:22,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:59:22,620 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 230 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:22,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 63 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:59:22,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11091 states. [2024-10-12 15:59:22,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11091 to 8505. [2024-10-12 15:59:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8505 states, 8504 states have (on average 1.0979539040451551) internal successors, (9337), 8504 states have internal predecessors, (9337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:22,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8505 states to 8505 states and 9337 transitions. [2024-10-12 15:59:22,682 INFO L78 Accepts]: Start accepts. Automaton has 8505 states and 9337 transitions. Word has length 681 [2024-10-12 15:59:22,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:22,683 INFO L471 AbstractCegarLoop]: Abstraction has 8505 states and 9337 transitions. [2024-10-12 15:59:22,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:22,683 INFO L276 IsEmpty]: Start isEmpty. Operand 8505 states and 9337 transitions. [2024-10-12 15:59:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2024-10-12 15:59:22,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:22,690 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:22,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 15:59:22,691 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:22,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:22,691 INFO L85 PathProgramCache]: Analyzing trace with hash -449601655, now seen corresponding path program 1 times [2024-10-12 15:59:22,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:22,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540563713] [2024-10-12 15:59:22,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:22,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:23,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2242 backedges. 1055 proven. 0 refuted. 0 times theorem prover too weak. 1187 trivial. 0 not checked. [2024-10-12 15:59:23,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:23,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540563713] [2024-10-12 15:59:23,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540563713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:23,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:23,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:59:23,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763593420] [2024-10-12 15:59:23,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:23,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:59:23,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:23,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:59:23,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:59:23,199 INFO L87 Difference]: Start difference. First operand 8505 states and 9337 transitions. Second operand has 4 states, 4 states have (on average 85.75) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:23,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:23,956 INFO L93 Difference]: Finished difference Result 22724 states and 25043 transitions. [2024-10-12 15:59:23,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:59:23,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.75) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 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 773 [2024-10-12 15:59:23,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:23,967 INFO L225 Difference]: With dead ends: 22724 [2024-10-12 15:59:23,967 INFO L226 Difference]: Without dead ends: 14588 [2024-10-12 15:59:23,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:59:23,973 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 225 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:23,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 100 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:59:23,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14588 states. [2024-10-12 15:59:24,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14588 to 13664. [2024-10-12 15:59:24,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13664 states, 13663 states have (on average 1.0880480128815049) internal successors, (14866), 13663 states have internal predecessors, (14866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:24,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13664 states to 13664 states and 14866 transitions. [2024-10-12 15:59:24,084 INFO L78 Accepts]: Start accepts. Automaton has 13664 states and 14866 transitions. Word has length 773 [2024-10-12 15:59:24,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:24,084 INFO L471 AbstractCegarLoop]: Abstraction has 13664 states and 14866 transitions. [2024-10-12 15:59:24,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.75) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:24,085 INFO L276 IsEmpty]: Start isEmpty. Operand 13664 states and 14866 transitions. [2024-10-12 15:59:24,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 788 [2024-10-12 15:59:24,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:24,096 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:24,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 15:59:24,096 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:24,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:24,097 INFO L85 PathProgramCache]: Analyzing trace with hash 592201254, now seen corresponding path program 1 times [2024-10-12 15:59:24,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:24,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571441393] [2024-10-12 15:59:24,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:24,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:25,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2362 backedges. 1107 proven. 336 refuted. 0 times theorem prover too weak. 919 trivial. 0 not checked. [2024-10-12 15:59:25,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:25,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571441393] [2024-10-12 15:59:25,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571441393] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:59:25,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227008514] [2024-10-12 15:59:25,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:25,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:59:25,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:59:25,274 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:59:25,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 15:59:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:25,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 15:59:25,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:59:25,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2362 backedges. 1429 proven. 380 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2024-10-12 15:59:25,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:59:26,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2362 backedges. 1809 proven. 0 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2024-10-12 15:59:26,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227008514] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 15:59:26,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-12 15:59:26,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 11 [2024-10-12 15:59:26,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184567674] [2024-10-12 15:59:26,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:26,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 15:59:26,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:26,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 15:59:26,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-12 15:59:26,912 INFO L87 Difference]: Start difference. First operand 13664 states and 14866 transitions. Second operand has 5 states, 5 states have (on average 87.6) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:27,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:27,911 INFO L93 Difference]: Finished difference Result 32854 states and 35804 transitions. [2024-10-12 15:59:27,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:59:27,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 787 [2024-10-12 15:59:27,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:27,928 INFO L225 Difference]: With dead ends: 32854 [2024-10-12 15:59:27,928 INFO L226 Difference]: Without dead ends: 19559 [2024-10-12 15:59:27,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1578 GetRequests, 1568 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-12 15:59:27,937 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 244 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:27,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 63 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 15:59:27,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19559 states. [2024-10-12 15:59:28,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19559 to 17164. [2024-10-12 15:59:28,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17164 states, 17163 states have (on average 1.0907184058730992) internal successors, (18720), 17163 states have internal predecessors, (18720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:28,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17164 states to 17164 states and 18720 transitions. [2024-10-12 15:59:28,077 INFO L78 Accepts]: Start accepts. Automaton has 17164 states and 18720 transitions. Word has length 787 [2024-10-12 15:59:28,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:28,078 INFO L471 AbstractCegarLoop]: Abstraction has 17164 states and 18720 transitions. [2024-10-12 15:59:28,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:28,078 INFO L276 IsEmpty]: Start isEmpty. Operand 17164 states and 18720 transitions. [2024-10-12 15:59:28,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 886 [2024-10-12 15:59:28,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:28,090 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, 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, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:28,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 15:59:28,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-12 15:59:28,291 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:28,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:28,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1435390705, now seen corresponding path program 1 times [2024-10-12 15:59:28,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:28,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008374328] [2024-10-12 15:59:28,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:28,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:28,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2967 backedges. 1261 proven. 0 refuted. 0 times theorem prover too weak. 1706 trivial. 0 not checked. [2024-10-12 15:59:28,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:28,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008374328] [2024-10-12 15:59:28,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008374328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:28,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:28,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:59:28,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566594285] [2024-10-12 15:59:28,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:28,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:28,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:28,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:28,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:28,719 INFO L87 Difference]: Start difference. First operand 17164 states and 18720 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:29,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:29,186 INFO L93 Difference]: Finished difference Result 36911 states and 40336 transitions. [2024-10-12 15:59:29,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:29,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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 885 [2024-10-12 15:59:29,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:29,203 INFO L225 Difference]: With dead ends: 36911 [2024-10-12 15:59:29,203 INFO L226 Difference]: Without dead ends: 20116 [2024-10-12 15:59:29,214 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-10-12 15:59:29,214 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 127 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:29,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 130 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:59:29,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20116 states. [2024-10-12 15:59:29,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20116 to 18823. [2024-10-12 15:59:29,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18823 states, 18822 states have (on average 1.091063648921475) internal successors, (20536), 18822 states have internal predecessors, (20536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18823 states to 18823 states and 20536 transitions. [2024-10-12 15:59:29,367 INFO L78 Accepts]: Start accepts. Automaton has 18823 states and 20536 transitions. Word has length 885 [2024-10-12 15:59:29,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:29,367 INFO L471 AbstractCegarLoop]: Abstraction has 18823 states and 20536 transitions. [2024-10-12 15:59:29,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:29,368 INFO L276 IsEmpty]: Start isEmpty. Operand 18823 states and 20536 transitions. [2024-10-12 15:59:29,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 896 [2024-10-12 15:59:29,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:29,382 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, 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, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:29,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 15:59:29,382 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:29,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:29,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1137590584, now seen corresponding path program 1 times [2024-10-12 15:59:29,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:29,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766991125] [2024-10-12 15:59:29,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:29,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:29,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2987 backedges. 1958 proven. 0 refuted. 0 times theorem prover too weak. 1029 trivial. 0 not checked. [2024-10-12 15:59:29,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:29,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766991125] [2024-10-12 15:59:29,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766991125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:29,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:29,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:59:29,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688716342] [2024-10-12 15:59:29,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:29,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:29,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:29,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:29,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:29,834 INFO L87 Difference]: Start difference. First operand 18823 states and 20536 transitions. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:30,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:30,325 INFO L93 Difference]: Finished difference Result 40035 states and 43743 transitions. [2024-10-12 15:59:30,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:30,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 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 895 [2024-10-12 15:59:30,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:30,342 INFO L225 Difference]: With dead ends: 40035 [2024-10-12 15:59:30,342 INFO L226 Difference]: Without dead ends: 21581 [2024-10-12 15:59:30,353 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-10-12 15:59:30,354 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 75 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:30,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 297 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:59:30,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21581 states. [2024-10-12 15:59:30,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21581 to 13109. [2024-10-12 15:59:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13109 states, 13108 states have (on average 1.0817821177906621) internal successors, (14180), 13108 states have internal predecessors, (14180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13109 states to 13109 states and 14180 transitions. [2024-10-12 15:59:30,491 INFO L78 Accepts]: Start accepts. Automaton has 13109 states and 14180 transitions. Word has length 895 [2024-10-12 15:59:30,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:30,492 INFO L471 AbstractCegarLoop]: Abstraction has 13109 states and 14180 transitions. [2024-10-12 15:59:30,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:30,492 INFO L276 IsEmpty]: Start isEmpty. Operand 13109 states and 14180 transitions. [2024-10-12 15:59:30,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1119 [2024-10-12 15:59:30,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:30,504 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:30,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 15:59:30,504 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:30,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:30,504 INFO L85 PathProgramCache]: Analyzing trace with hash -298994276, now seen corresponding path program 1 times [2024-10-12 15:59:30,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:30,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305990457] [2024-10-12 15:59:30,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:30,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:32,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4578 backedges. 2682 proven. 924 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-10-12 15:59:32,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:32,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305990457] [2024-10-12 15:59:32,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305990457] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:59:32,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96449809] [2024-10-12 15:59:32,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:32,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:59:32,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:59:32,281 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:59:32,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 15:59:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:32,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 1430 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:59:32,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:59:32,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4578 backedges. 2903 proven. 0 refuted. 0 times theorem prover too weak. 1675 trivial. 0 not checked. [2024-10-12 15:59:32,734 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:59:32,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96449809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:32,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:59:32,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 15:59:32,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486064957] [2024-10-12 15:59:32,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:32,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:32,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:32,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:32,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:59:32,736 INFO L87 Difference]: Start difference. First operand 13109 states and 14180 transitions. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:33,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:33,092 INFO L93 Difference]: Finished difference Result 18651 states and 20201 transitions. [2024-10-12 15:59:33,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:33,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 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 1118 [2024-10-12 15:59:33,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:33,093 INFO L225 Difference]: With dead ends: 18651 [2024-10-12 15:59:33,093 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 15:59:33,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1126 GetRequests, 1121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:59:33,099 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 88 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:33,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 271 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 15:59:33,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 15:59:33,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 15:59:33,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:33,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 15:59:33,100 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1118 [2024-10-12 15:59:33,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:33,100 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 15:59:33,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:33,101 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 15:59:33,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 15:59:33,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:59:33,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-12 15:59:33,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:59:33,307 INFO L407 BasicCegarLoop]: Path program 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] [2024-10-12 15:59:33,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 15:59:43,264 WARN L286 SmtUtils]: Spent 9.95s on a formula simplification. DAG size of input: 383 DAG size of output: 410 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-12 15:59:44,611 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:59:44,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:59:44 BoogieIcfgContainer [2024-10-12 15:59:44,631 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:59:44,631 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:59:44,631 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:59:44,631 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:59:44,632 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:58:56" (3/4) ... [2024-10-12 15:59:44,633 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 15:59:44,648 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-12 15:59:44,649 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 15:59:44,650 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 15:59:44,650 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 15:59:44,784 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 15:59:44,785 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 15:59:44,785 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:59:44,785 INFO L158 Benchmark]: Toolchain (without parser) took 50456.24ms. Allocated memory was 130.0MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 55.5MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 125.4MB. Max. memory is 16.1GB. [2024-10-12 15:59:44,786 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 130.0MB. Free memory is still 93.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:59:44,786 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.09ms. Allocated memory was 130.0MB in the beginning and 180.4MB in the end (delta: 50.3MB). Free memory was 55.4MB in the beginning and 115.2MB in the end (delta: -59.9MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2024-10-12 15:59:44,786 INFO L158 Benchmark]: Boogie Procedure Inliner took 115.52ms. Allocated memory is still 180.4MB. Free memory was 115.2MB in the beginning and 97.3MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-12 15:59:44,787 INFO L158 Benchmark]: Boogie Preprocessor took 189.08ms. Allocated memory is still 180.4MB. Free memory was 97.3MB in the beginning and 130.1MB in the end (delta: -32.9MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. [2024-10-12 15:59:44,787 INFO L158 Benchmark]: RCFGBuilder took 1263.05ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 130.1MB in the beginning and 106.9MB in the end (delta: 23.2MB). Peak memory consumption was 113.4MB. Max. memory is 16.1GB. [2024-10-12 15:59:44,787 INFO L158 Benchmark]: TraceAbstraction took 48179.33ms. Allocated memory was 262.1MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 106.9MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 890.5MB. Max. memory is 16.1GB. [2024-10-12 15:59:44,787 INFO L158 Benchmark]: Witness Printer took 153.66ms. Allocated memory is still 1.6GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 15:59:44,788 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.11ms. Allocated memory is still 130.0MB. Free memory is still 93.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 549.09ms. Allocated memory was 130.0MB in the beginning and 180.4MB in the end (delta: 50.3MB). Free memory was 55.4MB in the beginning and 115.2MB in the end (delta: -59.9MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 115.52ms. Allocated memory is still 180.4MB. Free memory was 115.2MB in the beginning and 97.3MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 189.08ms. Allocated memory is still 180.4MB. Free memory was 97.3MB in the beginning and 130.1MB in the end (delta: -32.9MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1263.05ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 130.1MB in the beginning and 106.9MB in the end (delta: 23.2MB). Peak memory consumption was 113.4MB. Max. memory is 16.1GB. * TraceAbstraction took 48179.33ms. Allocated memory was 262.1MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 106.9MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 890.5MB. Max. memory is 16.1GB. * Witness Printer took 153.66ms. Allocated memory is still 1.6GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 178]: 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, 221 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.8s, OverallIterations: 25, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4349 SdHoareTripleChecker+Valid, 14.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4349 mSDsluCounter, 4924 SdHoareTripleChecker+Invalid, 12.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 575 mSDsCounter, 2702 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17680 IncrementalHoareTripleChecker+Invalid, 20382 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2702 mSolverCounterUnsat, 4349 mSDtfsCounter, 17680 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5012 GetRequests, 4947 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18823occurred in iteration=23, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 28859 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 14239 NumberOfCodeBlocks, 14239 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 15677 ConstructedInterpolants, 0 QuantifiedInterpolants, 52115 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4515 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 34 InterpolantComputations, 24 PerfectInterpolantSequences, 32263/34519 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((((((a29 <= 275) && (a25 == 12)) && (a4 == 0)) && (246 <= a29)) || (((((((((a25 == 12) && (307 <= a23)) && ((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) <= 0)) && (a3 == 1)) && (a29 <= 220)) && (a4 == 1)) && (a8 == 15)) && (((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) < 0) || (((((long long) a23 + 4) >= 0) ? (((long long) a23 + 4) % 5) : ((((long long) a23 + 4) % 5) + 5)) == 0))) && (130 <= a29))) || ((((((((a25 == 11) && ((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) <= 0)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (246 <= a29)) && (((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) < 0) || (((((long long) a23 + 4) >= 0) ? (((long long) a23 + 4) % 5) : ((((long long) a23 + 4) % 5) + 5)) == 0))) && (0 <= ((long long) a23 + 42)))) || ((((a25 == 11) && (a29 <= 274)) && (((long long) 119992 + a23) <= 0)) && (a4 == 1))) || ((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a29 <= 274)) && (a4 == 1))) || (((((260 <= a29) && (a25 == 11)) && (a4 == 1)) && (a23 <= 312)) && (0 <= ((long long) a23 + 42)))) || (((((a25 == 13) && (a3 == 1)) && (((long long) a23 + 599772) <= 0)) && (a4 == 1)) && (a8 == 15))) || ((((((((a25 == 12) && (307 <= a23)) && ((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) <= 0)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (246 <= a29)) && (((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) < 0) || (((((long long) a23 + 4) >= 0) ? (((long long) a23 + 4) % 5) : ((((long long) a23 + 4) % 5) + 5)) == 0)))) || ((((long long) a23 + 43) <= 0) && ((((a29 <= 140) && (a4 == 0)) && (a25 == 11)) || (((a29 <= 140) && (a4 == 0)) && (a25 == 10))))) || (((((a25 == 11) && (a29 <= 274)) && (a4 == 1)) && (a23 <= 312)) && (246 <= a29))) || (((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a4 == 0)) && (a29 <= 274)) && (246 <= a29))) || ((((((long long) a23 + 43) <= 0) && (a29 <= 275)) && (a25 == 12)) && (a4 == 0))) || ((((a25 <= 10) && ((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) <= 0)) && (a4 == 1)) && (((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) < 0) || (((((long long) a23 + 4) >= 0) ? (((long long) a23 + 4) % 5) : ((((long long) a23 + 4) % 5) + 5)) == 0)))) || (((((a25 == 13) && ((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) <= 0)) && (a4 == 1)) && (((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) < 0) || (((((long long) a23 + 4) >= 0) ? (((long long) a23 + 4) % 5) : ((((long long) a23 + 4) % 5) + 5)) == 0))) && (0 <= ((long long) a23 + 42)))) || ((((a25 == 12) && (a4 == 1)) && (a23 <= 312)) && (0 <= ((long long) a23 + 42)))) || ((((((long long) a23 + 43) <= 0) && (a29 <= 140)) && (a4 == 0)) && (a25 == 9))) || ((((260 <= a29) && (((long long) a23 + 43) <= 0)) && (a4 == 0)) && (a25 <= 9))) RESULT: Ultimate proved your program to be correct! [2024-10-12 15:59:44,814 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