./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label43.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label43.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 443b39ef03d047933d04d3c4124d0553fdbdc2364608b268fc568d4113c9c65f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 17:09:35,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 17:09:35,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 17:09:35,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 17:09:35,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 17:09:35,528 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 17:09:35,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 17:09:35,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 17:09:35,530 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 17:09:35,531 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 17:09:35,531 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 17:09:35,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 17:09:35,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 17:09:35,533 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 17:09:35,534 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 17:09:35,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 17:09:35,534 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 17:09:35,534 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 17:09:35,534 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 17:09:35,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 17:09:35,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 17:09:35,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 17:09:35,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 17:09:35,537 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 17:09:35,537 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 17:09:35,538 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 17:09:35,538 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 17:09:35,538 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 17:09:35,538 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 17:09:35,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 17:09:35,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 17:09:35,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 17:09:35,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:09:35,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 17:09:35,539 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 17:09:35,539 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 17:09:35,539 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 17:09:35,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 17:09:35,540 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 17:09:35,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 17:09:35,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 17:09:35,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 17:09:35,542 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 -> 443b39ef03d047933d04d3c4124d0553fdbdc2364608b268fc568d4113c9c65f [2024-11-11 17:09:35,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 17:09:35,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 17:09:35,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 17:09:35,760 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 17:09:35,760 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 17:09:35,761 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label43.c [2024-11-11 17:09:36,927 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 17:09:37,204 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 17:09:37,204 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label43.c [2024-11-11 17:09:37,227 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab898d674/9b896ff9ba154eddb4e6f5c0998078d2/FLAG3df1fd56d [2024-11-11 17:09:37,499 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab898d674/9b896ff9ba154eddb4e6f5c0998078d2 [2024-11-11 17:09:37,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 17:09:37,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 17:09:37,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 17:09:37,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 17:09:37,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 17:09:37,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:09:37" (1/1) ... [2024-11-11 17:09:37,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b21e5d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:09:37, skipping insertion in model container [2024-11-11 17:09:37,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:09:37" (1/1) ... [2024-11-11 17:09:37,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 17:09:37,783 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label43.c[7052,7065] [2024-11-11 17:09:38,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:09:38,032 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 17:09:38,053 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label43.c[7052,7065] [2024-11-11 17:09:38,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:09:38,204 INFO L204 MainTranslator]: Completed translation [2024-11-11 17:09:38,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:09:38 WrapperNode [2024-11-11 17:09:38,204 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 17:09:38,205 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 17:09:38,205 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 17:09:38,206 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 17:09:38,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:09:38" (1/1) ... [2024-11-11 17:09:38,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:09:38" (1/1) ... [2024-11-11 17:09:38,342 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-11-11 17:09:38,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 17:09:38,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 17:09:38,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 17:09:38,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 17:09:38,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:09:38" (1/1) ... [2024-11-11 17:09:38,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:09:38" (1/1) ... [2024-11-11 17:09:38,367 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:09:38" (1/1) ... [2024-11-11 17:09:38,501 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 17:09:38,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:09:38" (1/1) ... [2024-11-11 17:09:38,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:09:38" (1/1) ... [2024-11-11 17:09:38,546 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:09:38" (1/1) ... [2024-11-11 17:09:38,558 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:09:38" (1/1) ... [2024-11-11 17:09:38,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:09:38" (1/1) ... [2024-11-11 17:09:38,589 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:09:38" (1/1) ... [2024-11-11 17:09:38,603 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 17:09:38,605 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 17:09:38,605 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 17:09:38,605 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 17:09:38,606 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:09:38" (1/1) ... [2024-11-11 17:09:38,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:09:38,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:09:38,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 17:09:38,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 17:09:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 17:09:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 17:09:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 17:09:38,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 17:09:38,753 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 17:09:38,755 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 17:09:40,473 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-11-11 17:09:40,473 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 17:09:40,494 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 17:09:40,494 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 17:09:40,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:09:40 BoogieIcfgContainer [2024-11-11 17:09:40,494 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 17:09:40,499 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 17:09:40,499 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 17:09:40,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 17:09:40,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 05:09:37" (1/3) ... [2024-11-11 17:09:40,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eef3cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:09:40, skipping insertion in model container [2024-11-11 17:09:40,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:09:38" (2/3) ... [2024-11-11 17:09:40,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eef3cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:09:40, skipping insertion in model container [2024-11-11 17:09:40,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:09:40" (3/3) ... [2024-11-11 17:09:40,503 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label43.c [2024-11-11 17:09:40,515 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 17:09:40,515 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 17:09:40,570 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 17:09:40,575 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;@5395c76e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 17:09:40,576 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 17:09:40,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:40,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-11 17:09:40,588 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:09:40,589 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:09:40,589 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:09:40,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:09:40,594 INFO L85 PathProgramCache]: Analyzing trace with hash -2074400678, now seen corresponding path program 1 times [2024-11-11 17:09:40,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:09:40,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502423140] [2024-11-11 17:09:40,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:09:40,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:09:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:09:40,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:09:40,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:09:40,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502423140] [2024-11-11 17:09:40,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502423140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:09:40,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:09:40,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:09:40,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845137525] [2024-11-11 17:09:40,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:09:40,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:09:40,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:09:40,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:09:40,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:09:40,962 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:42,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:09:42,399 INFO L93 Difference]: Finished difference Result 1154 states and 2106 transitions. [2024-11-11 17:09:42,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:09:42,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-11-11 17:09:42,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:09:42,420 INFO L225 Difference]: With dead ends: 1154 [2024-11-11 17:09:42,420 INFO L226 Difference]: Without dead ends: 665 [2024-11-11 17:09:42,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:09:42,445 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 263 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:09:42,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 383 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 17:09:42,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-11-11 17:09:42,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2024-11-11 17:09:42,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.4818731117824773) internal successors, (981), 662 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:42,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 981 transitions. [2024-11-11 17:09:42,523 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 981 transitions. Word has length 58 [2024-11-11 17:09:42,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:09:42,524 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 981 transitions. [2024-11-11 17:09:42,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:42,525 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 981 transitions. [2024-11-11 17:09:42,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 17:09:42,527 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:09:42,527 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:09:42,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 17:09:42,528 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:09:42,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:09:42,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1658563243, now seen corresponding path program 1 times [2024-11-11 17:09:42,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:09:42,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321534461] [2024-11-11 17:09:42,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:09:42,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:09:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:09:42,895 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:09:42,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:09:42,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321534461] [2024-11-11 17:09:42,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321534461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:09:42,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:09:42,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:09:42,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154340419] [2024-11-11 17:09:42,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:09:42,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:09:42,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:09:42,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:09:42,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:09:42,899 INFO L87 Difference]: Start difference. First operand 663 states and 981 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-11-11 17:09:44,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:09:44,382 INFO L93 Difference]: Finished difference Result 1624 states and 2315 transitions. [2024-11-11 17:09:44,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:09:44,382 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-11-11 17:09:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:09:44,389 INFO L225 Difference]: With dead ends: 1624 [2024-11-11 17:09:44,389 INFO L226 Difference]: Without dead ends: 963 [2024-11-11 17:09:44,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:09:44,391 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:09:44,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 337 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 17:09:44,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-11 17:09:44,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2024-11-11 17:09:44,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.362785862785863) internal successors, (1311), 962 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:44,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1311 transitions. [2024-11-11 17:09:44,419 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1311 transitions. Word has length 123 [2024-11-11 17:09:44,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:09:44,421 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1311 transitions. [2024-11-11 17:09:44,421 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-11-11 17:09:44,421 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1311 transitions. [2024-11-11 17:09:44,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-11 17:09:44,426 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:09:44,426 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:09:44,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 17:09:44,427 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:09:44,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:09:44,427 INFO L85 PathProgramCache]: Analyzing trace with hash -952080988, now seen corresponding path program 1 times [2024-11-11 17:09:44,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:09:44,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353225920] [2024-11-11 17:09:44,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:09:44,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:09:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:09:44,650 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:09:44,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:09:44,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353225920] [2024-11-11 17:09:44,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353225920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:09:44,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:09:44,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:09:44,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850550136] [2024-11-11 17:09:44,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:09:44,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:09:44,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:09:44,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:09:44,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:09:44,655 INFO L87 Difference]: Start difference. First operand 963 states and 1311 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:45,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:09:45,814 INFO L93 Difference]: Finished difference Result 2229 states and 3186 transitions. [2024-11-11 17:09:45,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:09:45,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2024-11-11 17:09:45,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:09:45,819 INFO L225 Difference]: With dead ends: 2229 [2024-11-11 17:09:45,819 INFO L226 Difference]: Without dead ends: 1567 [2024-11-11 17:09:45,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:09:45,821 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 256 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 17:09:45,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 318 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 17:09:45,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2024-11-11 17:09:45,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1266. [2024-11-11 17:09:45,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.3043478260869565) internal successors, (1650), 1265 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:45,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1650 transitions. [2024-11-11 17:09:45,842 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1650 transitions. Word has length 128 [2024-11-11 17:09:45,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:09:45,843 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1650 transitions. [2024-11-11 17:09:45,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:45,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1650 transitions. [2024-11-11 17:09:45,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-11 17:09:45,849 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:09:45,849 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-11 17:09:45,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 17:09:45,850 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:09:45,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:09:45,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1565228233, now seen corresponding path program 1 times [2024-11-11 17:09:45,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:09:45,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799987323] [2024-11-11 17:09:45,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:09:45,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:09:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:09:46,047 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:09:46,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:09:46,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799987323] [2024-11-11 17:09:46,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799987323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:09:46,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:09:46,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:09:46,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804834699] [2024-11-11 17:09:46,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:09:46,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:09:46,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:09:46,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:09:46,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:09:46,050 INFO L87 Difference]: Start difference. First operand 1266 states and 1650 transitions. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:48,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:09:48,076 INFO L93 Difference]: Finished difference Result 4670 states and 6170 transitions. [2024-11-11 17:09:48,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:09:48,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 224 [2024-11-11 17:09:48,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:09:48,085 INFO L225 Difference]: With dead ends: 4670 [2024-11-11 17:09:48,085 INFO L226 Difference]: Without dead ends: 3406 [2024-11-11 17:09:48,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:09:48,091 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 487 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2279 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 2548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 17:09:48,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 377 Invalid, 2548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2279 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 17:09:48,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2024-11-11 17:09:48,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 3381. [2024-11-11 17:09:48,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.23698224852071) internal successors, (4181), 3380 states have internal predecessors, (4181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:48,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4181 transitions. [2024-11-11 17:09:48,138 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4181 transitions. Word has length 224 [2024-11-11 17:09:48,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:09:48,139 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 4181 transitions. [2024-11-11 17:09:48,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:48,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4181 transitions. [2024-11-11 17:09:48,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-11 17:09:48,143 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:09:48,143 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:09:48,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 17:09:48,143 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:09:48,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:09:48,144 INFO L85 PathProgramCache]: Analyzing trace with hash -230881793, now seen corresponding path program 1 times [2024-11-11 17:09:48,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:09:48,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051888058] [2024-11-11 17:09:48,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:09:48,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:09:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:09:48,314 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-11 17:09:48,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:09:48,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051888058] [2024-11-11 17:09:48,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051888058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:09:48,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:09:48,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:09:48,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372128215] [2024-11-11 17:09:48,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:09:48,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:09:48,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:09:48,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:09:48,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:09:48,316 INFO L87 Difference]: Start difference. First operand 3381 states and 4181 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:49,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:09:49,370 INFO L93 Difference]: Finished difference Result 8563 states and 10756 transitions. [2024-11-11 17:09:49,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:09:49,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 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 228 [2024-11-11 17:09:49,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:09:49,383 INFO L225 Difference]: With dead ends: 8563 [2024-11-11 17:09:49,384 INFO L226 Difference]: Without dead ends: 5483 [2024-11-11 17:09:49,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:09:49,388 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 17:09:49,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 339 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 17:09:49,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2024-11-11 17:09:49,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5478. [2024-11-11 17:09:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.168888077414643) internal successors, (6402), 5477 states have internal predecessors, (6402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:49,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6402 transitions. [2024-11-11 17:09:49,464 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6402 transitions. Word has length 228 [2024-11-11 17:09:49,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:09:49,465 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6402 transitions. [2024-11-11 17:09:49,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:49,466 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6402 transitions. [2024-11-11 17:09:49,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-11 17:09:49,469 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:09:49,469 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:09:49,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 17:09:49,469 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:09:49,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:09:49,470 INFO L85 PathProgramCache]: Analyzing trace with hash -304686139, now seen corresponding path program 1 times [2024-11-11 17:09:49,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:09:49,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216604521] [2024-11-11 17:09:49,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:09:49,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:09:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:09:49,914 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-11 17:09:49,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:09:49,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216604521] [2024-11-11 17:09:49,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216604521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:09:49,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:09:49,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:09:49,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094029147] [2024-11-11 17:09:49,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:09:49,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:09:49,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:09:49,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:09:49,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:09:49,917 INFO L87 Difference]: Start difference. First operand 5478 states and 6402 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:50,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:09:50,801 INFO L93 Difference]: Finished difference Result 10655 states and 12491 transitions. [2024-11-11 17:09:50,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:09:50,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 330 [2024-11-11 17:09:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:09:50,816 INFO L225 Difference]: With dead ends: 10655 [2024-11-11 17:09:50,816 INFO L226 Difference]: Without dead ends: 5478 [2024-11-11 17:09:50,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:09:50,823 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 17:09:50,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 17:09:50,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5478 states. [2024-11-11 17:09:50,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5478. [2024-11-11 17:09:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1677925871827644) internal successors, (6396), 5477 states have internal predecessors, (6396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:50,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6396 transitions. [2024-11-11 17:09:50,887 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6396 transitions. Word has length 330 [2024-11-11 17:09:50,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:09:50,887 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6396 transitions. [2024-11-11 17:09:50,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:50,888 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6396 transitions. [2024-11-11 17:09:50,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2024-11-11 17:09:50,891 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:09:50,891 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:09:50,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 17:09:50,891 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:09:50,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:09:50,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2141064086, now seen corresponding path program 1 times [2024-11-11 17:09:50,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:09:50,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454602159] [2024-11-11 17:09:50,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:09:50,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:09:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:09:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-11 17:09:51,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:09:51,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454602159] [2024-11-11 17:09:51,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454602159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:09:51,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:09:51,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:09:51,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504447393] [2024-11-11 17:09:51,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:09:51,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:09:51,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:09:51,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:09:51,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:09:51,131 INFO L87 Difference]: Start difference. First operand 5478 states and 6396 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:52,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:09:52,370 INFO L93 Difference]: Finished difference Result 11851 states and 14153 transitions. [2024-11-11 17:09:52,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:09:52,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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 345 [2024-11-11 17:09:52,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:09:52,386 INFO L225 Difference]: With dead ends: 11851 [2024-11-11 17:09:52,386 INFO L226 Difference]: Without dead ends: 6674 [2024-11-11 17:09:52,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:09:52,392 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 257 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 17:09:52,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 322 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 17:09:52,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6674 states. [2024-11-11 17:09:52,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6674 to 5175. [2024-11-11 17:09:52,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5175 states, 5174 states have (on average 1.1749130266718206) internal successors, (6079), 5174 states have internal predecessors, (6079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:52,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5175 states to 5175 states and 6079 transitions. [2024-11-11 17:09:52,463 INFO L78 Accepts]: Start accepts. Automaton has 5175 states and 6079 transitions. Word has length 345 [2024-11-11 17:09:52,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:09:52,463 INFO L471 AbstractCegarLoop]: Abstraction has 5175 states and 6079 transitions. [2024-11-11 17:09:52,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:52,464 INFO L276 IsEmpty]: Start isEmpty. Operand 5175 states and 6079 transitions. [2024-11-11 17:09:52,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2024-11-11 17:09:52,468 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:09:52,468 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:09:52,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 17:09:52,468 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:09:52,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:09:52,469 INFO L85 PathProgramCache]: Analyzing trace with hash -803077481, now seen corresponding path program 1 times [2024-11-11 17:09:52,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:09:52,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136936485] [2024-11-11 17:09:52,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:09:52,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:09:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:09:52,768 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-11 17:09:52,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:09:52,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136936485] [2024-11-11 17:09:52,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136936485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:09:52,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:09:52,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:09:52,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609639743] [2024-11-11 17:09:52,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:09:52,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:09:52,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:09:52,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:09:52,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:09:52,770 INFO L87 Difference]: Start difference. First operand 5175 states and 6079 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:53,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:09:53,869 INFO L93 Difference]: Finished difference Result 12151 states and 14569 transitions. [2024-11-11 17:09:53,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:09:53,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 404 [2024-11-11 17:09:53,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:09:53,885 INFO L225 Difference]: With dead ends: 12151 [2024-11-11 17:09:53,885 INFO L226 Difference]: Without dead ends: 7277 [2024-11-11 17:09:53,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:09:53,891 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 270 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 17:09:53,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 637 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 17:09:53,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7277 states. [2024-11-11 17:09:53,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7277 to 6380. [2024-11-11 17:09:53,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6380 states, 6379 states have (on average 1.1559805612164915) internal successors, (7374), 6379 states have internal predecessors, (7374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6380 states to 6380 states and 7374 transitions. [2024-11-11 17:09:53,983 INFO L78 Accepts]: Start accepts. Automaton has 6380 states and 7374 transitions. Word has length 404 [2024-11-11 17:09:53,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:09:53,984 INFO L471 AbstractCegarLoop]: Abstraction has 6380 states and 7374 transitions. [2024-11-11 17:09:53,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:53,984 INFO L276 IsEmpty]: Start isEmpty. Operand 6380 states and 7374 transitions. [2024-11-11 17:09:53,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2024-11-11 17:09:53,988 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:09:53,989 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:09:53,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 17:09:53,989 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:09:53,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:09:53,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2017434731, now seen corresponding path program 1 times [2024-11-11 17:09:53,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:09:53,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632576215] [2024-11-11 17:09:53,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:09:53,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:09:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:09:54,209 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:09:54,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:09:54,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632576215] [2024-11-11 17:09:54,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632576215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:09:54,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:09:54,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:09:54,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010463851] [2024-11-11 17:09:54,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:09:54,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:09:54,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:09:54,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:09:54,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:09:54,212 INFO L87 Difference]: Start difference. First operand 6380 states and 7374 transitions. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:55,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:09:55,547 INFO L93 Difference]: Finished difference Result 14563 states and 17155 transitions. [2024-11-11 17:09:55,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:09:55,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 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 410 [2024-11-11 17:09:55,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:09:55,559 INFO L225 Difference]: With dead ends: 14563 [2024-11-11 17:09:55,560 INFO L226 Difference]: Without dead ends: 8484 [2024-11-11 17:09:55,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:09:55,565 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 250 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 17:09:55,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 601 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 17:09:55,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8484 states. [2024-11-11 17:09:55,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8484 to 8182. [2024-11-11 17:09:55,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8182 states, 8181 states have (on average 1.1356802346901356) internal successors, (9291), 8181 states have internal predecessors, (9291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8182 states to 8182 states and 9291 transitions. [2024-11-11 17:09:55,636 INFO L78 Accepts]: Start accepts. Automaton has 8182 states and 9291 transitions. Word has length 410 [2024-11-11 17:09:55,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:09:55,637 INFO L471 AbstractCegarLoop]: Abstraction has 8182 states and 9291 transitions. [2024-11-11 17:09:55,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:55,637 INFO L276 IsEmpty]: Start isEmpty. Operand 8182 states and 9291 transitions. [2024-11-11 17:09:55,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2024-11-11 17:09:55,642 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:09:55,642 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:09:55,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 17:09:55,642 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:09:55,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:09:55,643 INFO L85 PathProgramCache]: Analyzing trace with hash -79594870, now seen corresponding path program 1 times [2024-11-11 17:09:55,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:09:55,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330560430] [2024-11-11 17:09:55,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:09:55,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:09:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:09:55,843 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-11 17:09:55,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:09:55,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330560430] [2024-11-11 17:09:55,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330560430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:09:55,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:09:55,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:09:55,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28962667] [2024-11-11 17:09:55,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:09:55,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:09:55,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:09:55,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:09:55,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:09:55,845 INFO L87 Difference]: Start difference. First operand 8182 states and 9291 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:56,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:09:56,993 INFO L93 Difference]: Finished difference Result 17857 states and 20652 transitions. [2024-11-11 17:09:56,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:09:56,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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 426 [2024-11-11 17:09:56,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:09:57,013 INFO L225 Difference]: With dead ends: 17857 [2024-11-11 17:09:57,013 INFO L226 Difference]: Without dead ends: 9976 [2024-11-11 17:09:57,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:09:57,023 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 245 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 17:09:57,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 619 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 17:09:57,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9976 states. [2024-11-11 17:09:57,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9976 to 9673. [2024-11-11 17:09:57,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9673 states, 9672 states have (on average 1.1267576509511994) internal successors, (10898), 9672 states have internal predecessors, (10898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:57,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9673 states to 9673 states and 10898 transitions. [2024-11-11 17:09:57,107 INFO L78 Accepts]: Start accepts. Automaton has 9673 states and 10898 transitions. Word has length 426 [2024-11-11 17:09:57,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:09:57,108 INFO L471 AbstractCegarLoop]: Abstraction has 9673 states and 10898 transitions. [2024-11-11 17:09:57,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:57,108 INFO L276 IsEmpty]: Start isEmpty. Operand 9673 states and 10898 transitions. [2024-11-11 17:09:57,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2024-11-11 17:09:57,112 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:09:57,112 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:09:57,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 17:09:57,113 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:09:57,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:09:57,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1022697565, now seen corresponding path program 1 times [2024-11-11 17:09:57,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:09:57,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182257965] [2024-11-11 17:09:57,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:09:57,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:09:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:09:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-11-11 17:09:57,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:09:57,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182257965] [2024-11-11 17:09:57,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182257965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:09:57,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:09:57,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:09:57,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965702922] [2024-11-11 17:09:57,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:09:57,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:09:57,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:09:57,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:09:57,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:09:57,307 INFO L87 Difference]: Start difference. First operand 9673 states and 10898 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:58,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:09:58,448 INFO L93 Difference]: Finished difference Result 21436 states and 24446 transitions. [2024-11-11 17:09:58,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:09:58,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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 522 [2024-11-11 17:09:58,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:09:58,464 INFO L225 Difference]: With dead ends: 21436 [2024-11-11 17:09:58,464 INFO L226 Difference]: Without dead ends: 12064 [2024-11-11 17:09:58,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:09:58,474 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 357 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 17:09:58,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 447 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 17:09:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12064 states. [2024-11-11 17:09:58,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12064 to 12064. [2024-11-11 17:09:58,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12064 states, 12063 states have (on average 1.1321396004310702) internal successors, (13657), 12063 states have internal predecessors, (13657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12064 states to 12064 states and 13657 transitions. [2024-11-11 17:09:58,578 INFO L78 Accepts]: Start accepts. Automaton has 12064 states and 13657 transitions. Word has length 522 [2024-11-11 17:09:58,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:09:58,578 INFO L471 AbstractCegarLoop]: Abstraction has 12064 states and 13657 transitions. [2024-11-11 17:09:58,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:09:58,579 INFO L276 IsEmpty]: Start isEmpty. Operand 12064 states and 13657 transitions. [2024-11-11 17:09:58,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2024-11-11 17:09:58,583 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:09:58,583 INFO L218 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:09:58,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 17:09:58,583 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:09:58,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:09:58,584 INFO L85 PathProgramCache]: Analyzing trace with hash -407904615, now seen corresponding path program 1 times [2024-11-11 17:09:58,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:09:58,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298434607] [2024-11-11 17:09:58,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:09:58,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:09:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:09:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-11-11 17:09:58,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:09:58,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298434607] [2024-11-11 17:09:58,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298434607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:09:58,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:09:58,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:09:58,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826132593] [2024-11-11 17:09:58,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:09:58,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:09:58,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:09:58,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:09:58,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:09:58,936 INFO L87 Difference]: Start difference. First operand 12064 states and 13657 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:00,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:10:00,143 INFO L93 Difference]: Finished difference Result 28625 states and 32702 transitions. [2024-11-11 17:10:00,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:10:00,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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 546 [2024-11-11 17:10:00,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:10:00,166 INFO L225 Difference]: With dead ends: 28625 [2024-11-11 17:10:00,167 INFO L226 Difference]: Without dead ends: 16862 [2024-11-11 17:10:00,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:10:00,180 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 17:10:00,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 621 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 17:10:00,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16862 states. [2024-11-11 17:10:00,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16862 to 15954. [2024-11-11 17:10:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15954 states, 15953 states have (on average 1.1254309534256879) internal successors, (17954), 15953 states have internal predecessors, (17954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15954 states to 15954 states and 17954 transitions. [2024-11-11 17:10:00,342 INFO L78 Accepts]: Start accepts. Automaton has 15954 states and 17954 transitions. Word has length 546 [2024-11-11 17:10:00,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:10:00,343 INFO L471 AbstractCegarLoop]: Abstraction has 15954 states and 17954 transitions. [2024-11-11 17:10:00,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:00,343 INFO L276 IsEmpty]: Start isEmpty. Operand 15954 states and 17954 transitions. [2024-11-11 17:10:00,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2024-11-11 17:10:00,350 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:10:00,350 INFO L218 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, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:10:00,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 17:10:00,350 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:10:00,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:10:00,352 INFO L85 PathProgramCache]: Analyzing trace with hash -935582361, now seen corresponding path program 1 times [2024-11-11 17:10:00,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:10:00,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451632758] [2024-11-11 17:10:00,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:10:00,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:10:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:10:00,954 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 608 proven. 39 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-11 17:10:00,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:10:00,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451632758] [2024-11-11 17:10:00,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451632758] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:10:00,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364214304] [2024-11-11 17:10:00,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:10:00,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:10:00,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:10:00,957 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 17:10:00,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 17:10:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:10:01,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 17:10:01,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:10:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 608 proven. 39 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-11 17:10:01,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 17:10:02,410 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 608 proven. 39 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-11 17:10:02,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364214304] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 17:10:02,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 17:10:02,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-11 17:10:02,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781302563] [2024-11-11 17:10:02,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 17:10:02,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 17:10:02,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:10:02,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 17:10:02,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-11 17:10:02,413 INFO L87 Difference]: Start difference. First operand 15954 states and 17954 transitions. Second operand has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:06,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:10:06,815 INFO L93 Difference]: Finished difference Result 39939 states and 44700 transitions. [2024-11-11 17:10:06,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 17:10:06,815 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 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 613 [2024-11-11 17:10:06,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:10:06,838 INFO L225 Difference]: With dead ends: 39939 [2024-11-11 17:10:06,838 INFO L226 Difference]: Without dead ends: 17747 [2024-11-11 17:10:06,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1235 GetRequests, 1221 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2024-11-11 17:10:06,848 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 3348 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4913 mSolverCounterSat, 705 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3348 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 5618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 705 IncrementalHoareTripleChecker+Valid, 4913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-11 17:10:06,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3348 Valid, 230 Invalid, 5618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [705 Valid, 4913 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-11 17:10:06,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17747 states. [2024-11-11 17:10:06,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17747 to 12661. [2024-11-11 17:10:06,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12661 states, 12660 states have (on average 1.0695102685624012) internal successors, (13540), 12660 states have internal predecessors, (13540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:06,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12661 states to 12661 states and 13540 transitions. [2024-11-11 17:10:06,962 INFO L78 Accepts]: Start accepts. Automaton has 12661 states and 13540 transitions. Word has length 613 [2024-11-11 17:10:06,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:10:06,962 INFO L471 AbstractCegarLoop]: Abstraction has 12661 states and 13540 transitions. [2024-11-11 17:10:06,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 12661 states and 13540 transitions. [2024-11-11 17:10:06,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2024-11-11 17:10:06,968 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:10:06,969 INFO L218 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, 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:10:06,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-11-11 17:10:07,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,SelfDestructingSolverStorable12 [2024-11-11 17:10:07,170 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:10:07,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:10:07,171 INFO L85 PathProgramCache]: Analyzing trace with hash -114541464, now seen corresponding path program 1 times [2024-11-11 17:10:07,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:10:07,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628192721] [2024-11-11 17:10:07,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:10:07,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:10:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:10:07,490 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 403 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-11-11 17:10:07,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:10:07,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628192721] [2024-11-11 17:10:07,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628192721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:10:07,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:10:07,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:10:07,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965150360] [2024-11-11 17:10:07,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:10:07,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:10:07,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:10:07,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:10:07,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:10:07,493 INFO L87 Difference]: Start difference. First operand 12661 states and 13540 transitions. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:08,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:10:08,162 INFO L93 Difference]: Finished difference Result 25318 states and 27088 transitions. [2024-11-11 17:10:08,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:10:08,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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 638 [2024-11-11 17:10:08,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:10:08,174 INFO L225 Difference]: With dead ends: 25318 [2024-11-11 17:10:08,174 INFO L226 Difference]: Without dead ends: 12958 [2024-11-11 17:10:08,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:10:08,182 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 437 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:10:08,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 69 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 17:10:08,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12958 states. [2024-11-11 17:10:08,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12958 to 12659. [2024-11-11 17:10:08,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12659 states, 12658 states have (on average 1.0693632485384736) internal successors, (13536), 12658 states have internal predecessors, (13536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:08,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12659 states to 12659 states and 13536 transitions. [2024-11-11 17:10:08,272 INFO L78 Accepts]: Start accepts. Automaton has 12659 states and 13536 transitions. Word has length 638 [2024-11-11 17:10:08,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:10:08,273 INFO L471 AbstractCegarLoop]: Abstraction has 12659 states and 13536 transitions. [2024-11-11 17:10:08,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:08,273 INFO L276 IsEmpty]: Start isEmpty. Operand 12659 states and 13536 transitions. [2024-11-11 17:10:08,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2024-11-11 17:10:08,278 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:10:08,280 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:10:08,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 17:10:08,280 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:10:08,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:10:08,281 INFO L85 PathProgramCache]: Analyzing trace with hash 473983896, now seen corresponding path program 1 times [2024-11-11 17:10:08,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:10:08,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422840862] [2024-11-11 17:10:08,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:10:08,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:10:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:10:09,195 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 112 proven. 384 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-11 17:10:09,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:10:09,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422840862] [2024-11-11 17:10:09,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422840862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:10:09,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753813196] [2024-11-11 17:10:09,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:10:09,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:10:09,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:10:09,198 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 17:10:09,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 17:10:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:10:09,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:10:09,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:10:09,443 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-11 17:10:09,443 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:10:09,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753813196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:10:09,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:10:09,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-11 17:10:09,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283554846] [2024-11-11 17:10:09,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:10:09,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:10:09,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:10:09,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:10:09,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 17:10:09,447 INFO L87 Difference]: Start difference. First operand 12659 states and 13536 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:10,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:10:10,161 INFO L93 Difference]: Finished difference Result 29201 states and 31295 transitions. [2024-11-11 17:10:10,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:10:10,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 659 [2024-11-11 17:10:10,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:10:10,176 INFO L225 Difference]: With dead ends: 29201 [2024-11-11 17:10:10,176 INFO L226 Difference]: Without dead ends: 16544 [2024-11-11 17:10:10,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 659 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 17:10:10,186 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 257 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:10:10,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 545 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 17:10:10,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16544 states. [2024-11-11 17:10:10,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16544 to 15647. [2024-11-11 17:10:10,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15647 states, 15646 states have (on average 1.0579061741020068) internal successors, (16552), 15646 states have internal predecessors, (16552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:10,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15647 states to 15647 states and 16552 transitions. [2024-11-11 17:10:10,309 INFO L78 Accepts]: Start accepts. Automaton has 15647 states and 16552 transitions. Word has length 659 [2024-11-11 17:10:10,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:10:10,309 INFO L471 AbstractCegarLoop]: Abstraction has 15647 states and 16552 transitions. [2024-11-11 17:10:10,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:10,310 INFO L276 IsEmpty]: Start isEmpty. Operand 15647 states and 16552 transitions. [2024-11-11 17:10:10,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2024-11-11 17:10:10,317 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:10:10,317 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:10:10,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 17:10:10,518 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,SelfDestructingSolverStorable14 [2024-11-11 17:10:10,518 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:10:10,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:10:10,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1941988686, now seen corresponding path program 1 times [2024-11-11 17:10:10,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:10:10,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330847421] [2024-11-11 17:10:10,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:10:10,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:10:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:10:10,897 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2024-11-11 17:10:10,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:10:10,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330847421] [2024-11-11 17:10:10,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330847421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:10:10,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:10:10,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:10:10,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782664040] [2024-11-11 17:10:10,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:10:10,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:10:10,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:10:10,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:10:10,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:10:10,899 INFO L87 Difference]: Start difference. First operand 15647 states and 16552 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:11,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:10:11,694 INFO L93 Difference]: Finished difference Result 35499 states and 37584 transitions. [2024-11-11 17:10:11,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:10:11,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 683 [2024-11-11 17:10:11,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:10:11,711 INFO L225 Difference]: With dead ends: 35499 [2024-11-11 17:10:11,711 INFO L226 Difference]: Without dead ends: 19854 [2024-11-11 17:10:11,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:10:11,721 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 294 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 17:10:11,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 470 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 17:10:11,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19854 states. [2024-11-11 17:10:11,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19854 to 17747. [2024-11-11 17:10:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17747 states, 17746 states have (on average 1.0580412487321087) internal successors, (18776), 17746 states have internal predecessors, (18776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:11,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17747 states to 17747 states and 18776 transitions. [2024-11-11 17:10:11,854 INFO L78 Accepts]: Start accepts. Automaton has 17747 states and 18776 transitions. Word has length 683 [2024-11-11 17:10:11,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:10:11,854 INFO L471 AbstractCegarLoop]: Abstraction has 17747 states and 18776 transitions. [2024-11-11 17:10:11,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:11,855 INFO L276 IsEmpty]: Start isEmpty. Operand 17747 states and 18776 transitions. [2024-11-11 17:10:11,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2024-11-11 17:10:11,862 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:10:11,862 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:10:11,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 17:10:11,863 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:10:11,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:10:11,863 INFO L85 PathProgramCache]: Analyzing trace with hash 636953848, now seen corresponding path program 1 times [2024-11-11 17:10:11,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:10:11,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445579091] [2024-11-11 17:10:11,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:10:11,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:10:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:10:12,731 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 112 proven. 406 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-11 17:10:12,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:10:12,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445579091] [2024-11-11 17:10:12,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445579091] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:10:12,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714826387] [2024-11-11 17:10:12,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:10:12,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:10:12,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:10:12,734 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 17:10:12,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 17:10:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:10:12,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:10:12,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:10:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2024-11-11 17:10:12,958 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:10:12,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714826387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:10:12,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:10:12,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-11 17:10:12,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66445789] [2024-11-11 17:10:12,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:10:12,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:10:12,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:10:12,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:10:12,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 17:10:12,961 INFO L87 Difference]: Start difference. First operand 17747 states and 18776 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:13,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:10:13,628 INFO L93 Difference]: Finished difference Result 35186 states and 37233 transitions. [2024-11-11 17:10:13,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:10:13,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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 683 [2024-11-11 17:10:13,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:10:13,643 INFO L225 Difference]: With dead ends: 35186 [2024-11-11 17:10:13,644 INFO L226 Difference]: Without dead ends: 17441 [2024-11-11 17:10:13,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 683 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 17:10:13,658 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 269 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:10:13,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 501 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 17:10:13,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17441 states. [2024-11-11 17:10:13,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17441 to 16541. [2024-11-11 17:10:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16541 states, 16540 states have (on average 1.0341596130592503) internal successors, (17105), 16540 states have internal predecessors, (17105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:13,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16541 states to 16541 states and 17105 transitions. [2024-11-11 17:10:13,783 INFO L78 Accepts]: Start accepts. Automaton has 16541 states and 17105 transitions. Word has length 683 [2024-11-11 17:10:13,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:10:13,784 INFO L471 AbstractCegarLoop]: Abstraction has 16541 states and 17105 transitions. [2024-11-11 17:10:13,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:13,784 INFO L276 IsEmpty]: Start isEmpty. Operand 16541 states and 17105 transitions. [2024-11-11 17:10:13,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2024-11-11 17:10:13,791 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:10:13,792 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:10:13,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 17:10:13,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:10:13,993 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:10:13,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:10:13,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1940770496, now seen corresponding path program 1 times [2024-11-11 17:10:13,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:10:13,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815811074] [2024-11-11 17:10:13,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:10:13,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:10:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:10:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2024-11-11 17:10:14,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:10:14,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815811074] [2024-11-11 17:10:14,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815811074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:10:14,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:10:14,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:10:14,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820911749] [2024-11-11 17:10:14,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:10:14,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:10:14,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:10:14,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:10:14,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:10:14,366 INFO L87 Difference]: Start difference. First operand 16541 states and 17105 transitions. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:15,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:10:15,052 INFO L93 Difference]: Finished difference Result 36361 states and 37694 transitions. [2024-11-11 17:10:15,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:10:15,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 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 724 [2024-11-11 17:10:15,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:10:15,070 INFO L225 Difference]: With dead ends: 36361 [2024-11-11 17:10:15,070 INFO L226 Difference]: Without dead ends: 19822 [2024-11-11 17:10:15,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:10:15,080 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 282 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:10:15,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 463 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 17:10:15,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19822 states. [2024-11-11 17:10:15,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19822 to 19821. [2024-11-11 17:10:15,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19821 states, 19820 states have (on average 1.0330474268415741) internal successors, (20475), 19820 states have internal predecessors, (20475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:15,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19821 states to 19821 states and 20475 transitions. [2024-11-11 17:10:15,210 INFO L78 Accepts]: Start accepts. Automaton has 19821 states and 20475 transitions. Word has length 724 [2024-11-11 17:10:15,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:10:15,210 INFO L471 AbstractCegarLoop]: Abstraction has 19821 states and 20475 transitions. [2024-11-11 17:10:15,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:15,211 INFO L276 IsEmpty]: Start isEmpty. Operand 19821 states and 20475 transitions. [2024-11-11 17:10:15,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2024-11-11 17:10:15,222 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:10:15,222 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:10:15,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 17:10:15,222 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:10:15,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:10:15,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1877579581, now seen corresponding path program 1 times [2024-11-11 17:10:15,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:10:15,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386436193] [2024-11-11 17:10:15,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:10:15,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:10:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:10:15,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 848 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2024-11-11 17:10:15,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:10:15,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386436193] [2024-11-11 17:10:15,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386436193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:10:15,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:10:15,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:10:15,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603756863] [2024-11-11 17:10:15,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:10:15,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:10:15,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:10:15,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:10:15,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:10:15,550 INFO L87 Difference]: Start difference. First operand 19821 states and 20475 transitions. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:16,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:10:16,252 INFO L93 Difference]: Finished difference Result 42329 states and 43750 transitions. [2024-11-11 17:10:16,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:10:16,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 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 900 [2024-11-11 17:10:16,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:10:16,269 INFO L225 Difference]: With dead ends: 42329 [2024-11-11 17:10:16,269 INFO L226 Difference]: Without dead ends: 22809 [2024-11-11 17:10:16,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:10:16,281 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 85 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:10:16,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 129 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 17:10:16,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22809 states. [2024-11-11 17:10:16,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22809 to 20118. [2024-11-11 17:10:16,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20118 states, 20117 states have (on average 1.0299746483074017) internal successors, (20720), 20117 states have internal predecessors, (20720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:16,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20118 states to 20118 states and 20720 transitions. [2024-11-11 17:10:16,425 INFO L78 Accepts]: Start accepts. Automaton has 20118 states and 20720 transitions. Word has length 900 [2024-11-11 17:10:16,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:10:16,425 INFO L471 AbstractCegarLoop]: Abstraction has 20118 states and 20720 transitions. [2024-11-11 17:10:16,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:16,425 INFO L276 IsEmpty]: Start isEmpty. Operand 20118 states and 20720 transitions. [2024-11-11 17:10:16,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 991 [2024-11-11 17:10:16,436 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:10:16,437 INFO L218 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, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:10:16,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 17:10:16,437 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:10:16,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:10:16,437 INFO L85 PathProgramCache]: Analyzing trace with hash -173843330, now seen corresponding path program 1 times [2024-11-11 17:10:16,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:10:16,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147640820] [2024-11-11 17:10:16,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:10:16,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:10:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:10:17,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1472 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 1249 trivial. 0 not checked. [2024-11-11 17:10:17,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:10:17,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147640820] [2024-11-11 17:10:17,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147640820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:10:17,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:10:17,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:10:17,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710412948] [2024-11-11 17:10:17,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:10:17,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:10:17,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:10:17,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:10:17,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:10:17,007 INFO L87 Difference]: Start difference. First operand 20118 states and 20720 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:17,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:10:17,781 INFO L93 Difference]: Finished difference Result 42940 states and 44206 transitions. [2024-11-11 17:10:17,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:10:17,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 990 [2024-11-11 17:10:17,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:10:17,783 INFO L225 Difference]: With dead ends: 42940 [2024-11-11 17:10:17,783 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 17:10:17,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:10:17,798 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 291 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:10:17,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 423 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 17:10:17,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 17:10:17,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 17:10:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 17:10:17,799 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 990 [2024-11-11 17:10:17,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:10:17,799 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 17:10:17,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:10:17,800 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 17:10:17,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 17:10:17,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 17:10:17,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 17:10:17,804 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:10:17,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 17:10:19,804 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 17:10:19,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 05:10:19 BoogieIcfgContainer [2024-11-11 17:10:19,823 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 17:10:19,823 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 17:10:19,823 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 17:10:19,823 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 17:10:19,823 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:09:40" (3/4) ... [2024-11-11 17:10:19,825 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 17:10:19,845 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-11 17:10:19,846 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 17:10:19,848 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 17:10:19,849 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 17:10:19,998 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 17:10:19,998 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 17:10:19,998 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 17:10:19,999 INFO L158 Benchmark]: Toolchain (without parser) took 42496.95ms. Allocated memory was 151.0MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 74.0MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 162.4MB. Max. memory is 16.1GB. [2024-11-11 17:10:19,999 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 151.0MB. Free memory is still 102.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 17:10:19,999 INFO L158 Benchmark]: CACSL2BoogieTranslator took 700.60ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 73.8MB in the beginning and 105.4MB in the end (delta: -31.6MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2024-11-11 17:10:19,999 INFO L158 Benchmark]: Boogie Procedure Inliner took 138.19ms. Allocated memory is still 201.3MB. Free memory was 105.4MB in the beginning and 67.7MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-11 17:10:20,002 INFO L158 Benchmark]: Boogie Preprocessor took 260.27ms. Allocated memory is still 201.3MB. Free memory was 67.7MB in the beginning and 93.6MB in the end (delta: -26.0MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2024-11-11 17:10:20,002 INFO L158 Benchmark]: RCFGBuilder took 1889.48ms. Allocated memory was 201.3MB in the beginning and 358.6MB in the end (delta: 157.3MB). Free memory was 92.6MB in the beginning and 200.1MB in the end (delta: -107.5MB). Peak memory consumption was 101.0MB. Max. memory is 16.1GB. [2024-11-11 17:10:20,003 INFO L158 Benchmark]: TraceAbstraction took 39324.03ms. Allocated memory was 358.6MB in the beginning and 1.3GB in the end (delta: 979.4MB). Free memory was 199.1MB in the beginning and 1.1GB in the end (delta: -928.5MB). Peak memory consumption was 749.6MB. Max. memory is 16.1GB. [2024-11-11 17:10:20,003 INFO L158 Benchmark]: Witness Printer took 175.51ms. Allocated memory is still 1.3GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-11 17:10:20,004 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.14ms. Allocated memory is still 151.0MB. Free memory is still 102.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 700.60ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 73.8MB in the beginning and 105.4MB in the end (delta: -31.6MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 138.19ms. Allocated memory is still 201.3MB. Free memory was 105.4MB in the beginning and 67.7MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 260.27ms. Allocated memory is still 201.3MB. Free memory was 67.7MB in the beginning and 93.6MB in the end (delta: -26.0MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1889.48ms. Allocated memory was 201.3MB in the beginning and 358.6MB in the end (delta: 157.3MB). Free memory was 92.6MB in the beginning and 200.1MB in the end (delta: -107.5MB). Peak memory consumption was 101.0MB. Max. memory is 16.1GB. * TraceAbstraction took 39324.03ms. Allocated memory was 358.6MB in the beginning and 1.3GB in the end (delta: 979.4MB). Free memory was 199.1MB in the beginning and 1.1GB in the end (delta: -928.5MB). Peak memory consumption was 749.6MB. Max. memory is 16.1GB. * Witness Printer took 175.51ms. Allocated memory is still 1.3GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. 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: 191]: 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, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.3s, OverallIterations: 20, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 25.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8493 SdHoareTripleChecker+Valid, 23.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8493 mSDsluCounter, 8190 SdHoareTripleChecker+Invalid, 19.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 831 mSDsCounter, 3771 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22600 IncrementalHoareTripleChecker+Invalid, 26371 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3771 mSolverCounterUnsat, 7359 mSDtfsCounter, 22600 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2631 GetRequests, 2591 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20118occurred in iteration=19, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 16223 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 11589 NumberOfCodeBlocks, 11589 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 12178 ConstructedInterpolants, 0 QuantifiedInterpolants, 34048 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2325 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 24 InterpolantComputations, 19 PerfectInterpolantSequences, 12017/12924 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: 1776]: Loop Invariant Derived loop invariant: (((((((((((((((((((((2 == a2) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) a0 + 60))) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (a29 <= 401234))) || ((((long long) 42 + a4) <= 0) && (a2 == 4))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a0 + 60))) && (((long long) a29 + 127) <= 0))) || (((((long long) 42 + a4) <= 0) && (3 == a2)) && (((long long) a0 + 61) <= 0))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 61) <= 0))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (a2 == 1)) && (a29 <= 401234))) || (((2 == a2) && (44 <= a29)) && (((long long) a0 + 61) <= 0))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a29 + 16))) && (a2 == 1)) && (a29 <= 401234))) || (((((long long) 42 + a4) <= 0) && (0 <= ((long long) a29 + 16))) && (3 == a2))) || (((((long long) 42 + a4) <= 0) && (0 <= ((long long) a29 + 16))) && (5 <= a2))) || (((((long long) 42 + a4) <= 0) && (a2 == 1)) && (((long long) a0 + 61) <= 0))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || (((((long long) 42 + a4) <= 0) && (2 == a2)) && (44 <= a29))) || (((0 <= ((long long) 57 + a29)) && (2 == a2)) && (((long long) 89 + a4) <= 0))) || (((((long long) 89 + a4) <= 0) && (0 <= ((long long) a29 + 16))) && (((long long) a0 + 61) <= 0))) || (((((long long) 89 + a4) <= 0) && (3 == a2)) && (((long long) a29 + 127) <= 0))) || (((((long long) 42 + a4) <= 0) && (5 <= a2)) && (((long long) a0 + 61) <= 0))) || ((((long long) 89 + a4) <= 0) && (((long long) 98 + a0) <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-11 17:10:20,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE