./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label35.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_label35.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 954f50d37143b139a2ebc4626a6099455decd471f8c1055eb5e8a313dea8492b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:42:50,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:42:50,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:42:50,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:42:50,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:42:50,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:42:50,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:42:50,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:42:50,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:42:50,318 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:42:50,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:42:50,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:42:50,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:42:50,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:42:50,320 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:42:50,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:42:50,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:42:50,320 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:42:50,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:42:50,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:42:50,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:42:50,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:42:50,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:42:50,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:42:50,326 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:42:50,327 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:42:50,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:42:50,327 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:42:50,327 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:42:50,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:42:50,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:42:50,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:42:50,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:42:50,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:42:50,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:42:50,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:42:50,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:42:50,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:42:50,329 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:42:50,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:42:50,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:42:50,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:42:50,330 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 -> 954f50d37143b139a2ebc4626a6099455decd471f8c1055eb5e8a313dea8492b [2024-11-09 19:42:50,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:42:50,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:42:50,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:42:50,533 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:42:50,533 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:42:50,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label35.c [2024-11-09 19:42:51,886 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:42:52,136 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:42:52,137 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label35.c [2024-11-09 19:42:52,165 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf1535368/0e8a1127153d454eb03178abe2841ec4/FLAGc5090ba4c [2024-11-09 19:42:52,440 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf1535368/0e8a1127153d454eb03178abe2841ec4 [2024-11-09 19:42:52,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:42:52,443 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:42:52,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:42:52,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:42:52,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:42:52,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:42:52" (1/1) ... [2024-11-09 19:42:52,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a3da77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:42:52, skipping insertion in model container [2024-11-09 19:42:52,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:42:52" (1/1) ... [2024-11-09 19:42:52,499 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:42:52,658 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_label35.c[4490,4503] [2024-11-09 19:42:53,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:42:53,074 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:42:53,092 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_label35.c[4490,4503] [2024-11-09 19:42:53,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:42:53,224 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:42:53,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:42:53 WrapperNode [2024-11-09 19:42:53,225 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:42:53,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:42:53,226 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:42:53,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:42:53,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:42:53" (1/1) ... [2024-11-09 19:42:53,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:42:53" (1/1) ... [2024-11-09 19:42:53,415 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1759 [2024-11-09 19:42:53,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:42:53,417 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:42:53,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:42:53,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:42:53,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:42:53" (1/1) ... [2024-11-09 19:42:53,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:42:53" (1/1) ... [2024-11-09 19:42:53,442 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:42:53" (1/1) ... [2024-11-09 19:42:53,500 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-09 19:42:53,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:42:53" (1/1) ... [2024-11-09 19:42:53,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:42:53" (1/1) ... [2024-11-09 19:42:53,601 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:42:53" (1/1) ... [2024-11-09 19:42:53,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:42:53" (1/1) ... [2024-11-09 19:42:53,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:42:53" (1/1) ... [2024-11-09 19:42:53,631 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:42:53" (1/1) ... [2024-11-09 19:42:53,650 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:42:53,652 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:42:53,652 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:42:53,652 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:42:53,653 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:42:53" (1/1) ... [2024-11-09 19:42:53,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:42:53,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:42:53,700 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-09 19:42:53,707 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-09 19:42:53,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:42:53,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:42:53,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:42:53,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:42:53,799 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:42:53,800 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:42:55,853 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2024-11-09 19:42:55,991 INFO L? ?]: Removed 697 outVars from TransFormulas that were not future-live. [2024-11-09 19:42:55,992 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:42:56,017 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:42:56,018 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:42:56,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:42:56 BoogieIcfgContainer [2024-11-09 19:42:56,018 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:42:56,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:42:56,021 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:42:56,023 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:42:56,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:42:52" (1/3) ... [2024-11-09 19:42:56,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6344fde5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:42:56, skipping insertion in model container [2024-11-09 19:42:56,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:42:53" (2/3) ... [2024-11-09 19:42:56,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6344fde5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:42:56, skipping insertion in model container [2024-11-09 19:42:56,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:42:56" (3/3) ... [2024-11-09 19:42:56,025 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label35.c [2024-11-09 19:42:56,036 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:42:56,037 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:42:56,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:42:56,094 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;@22be1c29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:42:56,095 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:42:56,098 INFO L276 IsEmpty]: Start isEmpty. Operand has 427 states, 425 states have (on average 2.3176470588235296) internal successors, (985), 426 states have internal predecessors, (985), 0 states have call successors, (0), 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-09 19:42:56,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 19:42:56,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:42:56,104 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:42:56,104 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:42:56,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:42:56,107 INFO L85 PathProgramCache]: Analyzing trace with hash -355370581, now seen corresponding path program 1 times [2024-11-09 19:42:56,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:42:56,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401407703] [2024-11-09 19:42:56,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:56,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:42:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:56,371 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-09 19:42:56,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:42:56,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401407703] [2024-11-09 19:42:56,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401407703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:42:56,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:42:56,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:42:56,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845951741] [2024-11-09 19:42:56,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:42:56,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:42:56,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:42:56,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:42:56,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:42:56,401 INFO L87 Difference]: Start difference. First operand has 427 states, 425 states have (on average 2.3176470588235296) internal successors, (985), 426 states have internal predecessors, (985), 0 states have call successors, (0), 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 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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-09 19:42:58,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:42:58,693 INFO L93 Difference]: Finished difference Result 1161 states and 2808 transitions. [2024-11-09 19:42:58,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:42:58,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2024-11-09 19:42:58,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:42:58,708 INFO L225 Difference]: With dead ends: 1161 [2024-11-09 19:42:58,708 INFO L226 Difference]: Without dead ends: 670 [2024-11-09 19:42:58,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:42:58,714 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 540 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1363 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 1363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:42:58,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 375 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 1363 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 19:42:58,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2024-11-09 19:42:58,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 668. [2024-11-09 19:42:58,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 667 states have (on average 2.1724137931034484) internal successors, (1449), 667 states have internal predecessors, (1449), 0 states have call successors, (0), 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-09 19:42:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 1449 transitions. [2024-11-09 19:42:58,770 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 1449 transitions. Word has length 38 [2024-11-09 19:42:58,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:42:58,771 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 1449 transitions. [2024-11-09 19:42:58,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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-09 19:42:58,771 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 1449 transitions. [2024-11-09 19:42:58,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 19:42:58,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:42:58,774 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:42:58,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:42:58,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:42:58,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:42:58,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1607059588, now seen corresponding path program 1 times [2024-11-09 19:42:58,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:42:58,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850489337] [2024-11-09 19:42:58,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:58,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:42:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:58,922 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:42:58,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:42:58,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850489337] [2024-11-09 19:42:58,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850489337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:42:58,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:42:58,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:42:58,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955071967] [2024-11-09 19:42:58,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:42:58,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:42:58,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:42:58,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:42:58,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:42:58,926 INFO L87 Difference]: Start difference. First operand 668 states and 1449 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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-09 19:43:00,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:43:00,898 INFO L93 Difference]: Finished difference Result 1939 states and 4257 transitions. [2024-11-09 19:43:00,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:43:00,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2024-11-09 19:43:00,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:43:00,903 INFO L225 Difference]: With dead ends: 1939 [2024-11-09 19:43:00,903 INFO L226 Difference]: Without dead ends: 1273 [2024-11-09 19:43:00,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:00,905 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 472 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:43:00,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 370 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 19:43:00,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2024-11-09 19:43:00,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1271. [2024-11-09 19:43:00,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1270 states have (on average 2.0338582677165356) internal successors, (2583), 1270 states have internal predecessors, (2583), 0 states have call successors, (0), 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-09 19:43:00,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 2583 transitions. [2024-11-09 19:43:00,930 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 2583 transitions. Word has length 114 [2024-11-09 19:43:00,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:43:00,930 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 2583 transitions. [2024-11-09 19:43:00,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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-09 19:43:00,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 2583 transitions. [2024-11-09 19:43:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-09 19:43:00,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:43:00,936 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:43:00,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:43:00,937 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:43:00,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:43:00,937 INFO L85 PathProgramCache]: Analyzing trace with hash 648346120, now seen corresponding path program 1 times [2024-11-09 19:43:00,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:43:00,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928146510] [2024-11-09 19:43:00,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:00,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:43:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:01,181 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-09 19:43:01,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:43:01,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928146510] [2024-11-09 19:43:01,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928146510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:43:01,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:43:01,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:43:01,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048787482] [2024-11-09 19:43:01,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:43:01,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:43:01,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:43:01,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:43:01,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:01,186 INFO L87 Difference]: Start difference. First operand 1271 states and 2583 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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-09 19:43:02,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:43:02,846 INFO L93 Difference]: Finished difference Result 3450 states and 7116 transitions. [2024-11-09 19:43:02,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:43:02,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 206 [2024-11-09 19:43:02,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:43:02,854 INFO L225 Difference]: With dead ends: 3450 [2024-11-09 19:43:02,854 INFO L226 Difference]: Without dead ends: 2181 [2024-11-09 19:43:02,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:02,856 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 490 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:43:02,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 344 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 19:43:02,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2024-11-09 19:43:02,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 2176. [2024-11-09 19:43:02,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2176 states, 2175 states have (on average 1.9802298850574713) internal successors, (4307), 2175 states have internal predecessors, (4307), 0 states have call successors, (0), 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-09 19:43:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 4307 transitions. [2024-11-09 19:43:02,890 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 4307 transitions. Word has length 206 [2024-11-09 19:43:02,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:43:02,891 INFO L471 AbstractCegarLoop]: Abstraction has 2176 states and 4307 transitions. [2024-11-09 19:43:02,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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-09 19:43:02,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 4307 transitions. [2024-11-09 19:43:02,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-11-09 19:43:02,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:43:02,895 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:43:02,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:43:02,895 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:43:02,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:43:02,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1378947140, now seen corresponding path program 1 times [2024-11-09 19:43:02,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:43:02,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357045546] [2024-11-09 19:43:02,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:02,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:43:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:03,386 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-09 19:43:03,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:43:03,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357045546] [2024-11-09 19:43:03,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357045546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:43:03,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:43:03,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:43:03,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403152013] [2024-11-09 19:43:03,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:43:03,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:43:03,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:43:03,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:43:03,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:03,389 INFO L87 Difference]: Start difference. First operand 2176 states and 4307 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 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-09 19:43:04,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:43:04,920 INFO L93 Difference]: Finished difference Result 4650 states and 9156 transitions. [2024-11-09 19:43:04,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:43:04,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 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 312 [2024-11-09 19:43:04,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:43:04,928 INFO L225 Difference]: With dead ends: 4650 [2024-11-09 19:43:04,928 INFO L226 Difference]: Without dead ends: 2476 [2024-11-09 19:43:04,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:04,933 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 337 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:43:04,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 363 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 19:43:04,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2024-11-09 19:43:05,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2476. [2024-11-09 19:43:05,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2475 states have (on average 1.9575757575757575) internal successors, (4845), 2475 states have internal predecessors, (4845), 0 states have call successors, (0), 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-09 19:43:05,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 4845 transitions. [2024-11-09 19:43:05,012 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 4845 transitions. Word has length 312 [2024-11-09 19:43:05,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:43:05,013 INFO L471 AbstractCegarLoop]: Abstraction has 2476 states and 4845 transitions. [2024-11-09 19:43:05,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 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-09 19:43:05,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 4845 transitions. [2024-11-09 19:43:05,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-11-09 19:43:05,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:43:05,018 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:43:05,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:43:05,018 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:43:05,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:43:05,019 INFO L85 PathProgramCache]: Analyzing trace with hash -671435053, now seen corresponding path program 1 times [2024-11-09 19:43:05,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:43:05,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742471017] [2024-11-09 19:43:05,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:05,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:43:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:05,348 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-09 19:43:05,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:43:05,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742471017] [2024-11-09 19:43:05,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742471017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:43:05,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:43:05,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:43:05,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550883586] [2024-11-09 19:43:05,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:43:05,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:43:05,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:43:05,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:43:05,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:05,351 INFO L87 Difference]: Start difference. First operand 2476 states and 4845 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 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-09 19:43:06,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:43:06,914 INFO L93 Difference]: Finished difference Result 5862 states and 11693 transitions. [2024-11-09 19:43:06,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:43:06,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 327 [2024-11-09 19:43:06,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:43:06,929 INFO L225 Difference]: With dead ends: 5862 [2024-11-09 19:43:06,929 INFO L226 Difference]: Without dead ends: 3688 [2024-11-09 19:43:06,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:06,932 INFO L432 NwaCegarLoop]: 867 mSDtfsCounter, 512 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:43:06,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 908 Invalid, 1616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1379 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 19:43:06,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3688 states. [2024-11-09 19:43:06,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3688 to 3687. [2024-11-09 19:43:06,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3687 states, 3686 states have (on average 1.9234943027672273) internal successors, (7090), 3686 states have internal predecessors, (7090), 0 states have call successors, (0), 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-09 19:43:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3687 states to 3687 states and 7090 transitions. [2024-11-09 19:43:06,977 INFO L78 Accepts]: Start accepts. Automaton has 3687 states and 7090 transitions. Word has length 327 [2024-11-09 19:43:06,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:43:06,977 INFO L471 AbstractCegarLoop]: Abstraction has 3687 states and 7090 transitions. [2024-11-09 19:43:06,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 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-09 19:43:06,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3687 states and 7090 transitions. [2024-11-09 19:43:06,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2024-11-09 19:43:06,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:43:06,982 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2024-11-09 19:43:06,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:43:06,982 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:43:06,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:43:06,983 INFO L85 PathProgramCache]: Analyzing trace with hash -518811763, now seen corresponding path program 1 times [2024-11-09 19:43:06,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:43:06,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163898772] [2024-11-09 19:43:06,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:06,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:43:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:07,189 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 19:43:07,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:43:07,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163898772] [2024-11-09 19:43:07,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163898772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:43:07,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:43:07,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:43:07,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156537578] [2024-11-09 19:43:07,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:43:07,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:43:07,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:43:07,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:43:07,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:07,193 INFO L87 Difference]: Start difference. First operand 3687 states and 7090 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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-09 19:43:08,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:43:08,737 INFO L93 Difference]: Finished difference Result 8279 states and 16173 transitions. [2024-11-09 19:43:08,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:43:08,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 386 [2024-11-09 19:43:08,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:43:08,749 INFO L225 Difference]: With dead ends: 8279 [2024-11-09 19:43:08,749 INFO L226 Difference]: Without dead ends: 4894 [2024-11-09 19:43:08,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:08,752 INFO L432 NwaCegarLoop]: 832 mSDtfsCounter, 523 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 1585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:43:08,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 871 Invalid, 1585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 19:43:08,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4894 states. [2024-11-09 19:43:08,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4894 to 4594. [2024-11-09 19:43:08,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4594 states, 4593 states have (on average 1.908338776398868) internal successors, (8765), 4593 states have internal predecessors, (8765), 0 states have call successors, (0), 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-09 19:43:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4594 states to 4594 states and 8765 transitions. [2024-11-09 19:43:08,799 INFO L78 Accepts]: Start accepts. Automaton has 4594 states and 8765 transitions. Word has length 386 [2024-11-09 19:43:08,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:43:08,800 INFO L471 AbstractCegarLoop]: Abstraction has 4594 states and 8765 transitions. [2024-11-09 19:43:08,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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-09 19:43:08,800 INFO L276 IsEmpty]: Start isEmpty. Operand 4594 states and 8765 transitions. [2024-11-09 19:43:08,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2024-11-09 19:43:08,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:43:08,804 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:43:08,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:43:08,804 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:43:08,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:43:08,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1364127211, now seen corresponding path program 1 times [2024-11-09 19:43:08,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:43:08,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281926968] [2024-11-09 19:43:08,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:08,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:43:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:09,002 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:43:09,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:43:09,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281926968] [2024-11-09 19:43:09,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281926968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:43:09,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:43:09,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:43:09,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998617370] [2024-11-09 19:43:09,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:43:09,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:43:09,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:43:09,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:43:09,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:09,005 INFO L87 Difference]: Start difference. First operand 4594 states and 8765 transitions. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:43:10,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:43:10,581 INFO L93 Difference]: Finished difference Result 10094 states and 19531 transitions. [2024-11-09 19:43:10,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:43:10,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 391 [2024-11-09 19:43:10,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:43:10,601 INFO L225 Difference]: With dead ends: 10094 [2024-11-09 19:43:10,601 INFO L226 Difference]: Without dead ends: 5802 [2024-11-09 19:43:10,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:10,606 INFO L432 NwaCegarLoop]: 821 mSDtfsCounter, 478 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:43:10,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 861 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 19:43:10,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5802 states. [2024-11-09 19:43:10,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5802 to 5795. [2024-11-09 19:43:10,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5795 states, 5794 states have (on average 1.8973075595443563) internal successors, (10993), 5794 states have internal predecessors, (10993), 0 states have call successors, (0), 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-09 19:43:10,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5795 states to 5795 states and 10993 transitions. [2024-11-09 19:43:10,676 INFO L78 Accepts]: Start accepts. Automaton has 5795 states and 10993 transitions. Word has length 391 [2024-11-09 19:43:10,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:43:10,676 INFO L471 AbstractCegarLoop]: Abstraction has 5795 states and 10993 transitions. [2024-11-09 19:43:10,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:43:10,677 INFO L276 IsEmpty]: Start isEmpty. Operand 5795 states and 10993 transitions. [2024-11-09 19:43:10,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2024-11-09 19:43:10,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:43:10,682 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:43:10,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:43:10,682 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:43:10,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:43:10,683 INFO L85 PathProgramCache]: Analyzing trace with hash -739334250, now seen corresponding path program 1 times [2024-11-09 19:43:10,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:43:10,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780276988] [2024-11-09 19:43:10,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:10,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:43:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:10,914 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-09 19:43:10,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:43:10,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780276988] [2024-11-09 19:43:10,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780276988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:43:10,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:43:10,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:43:10,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072877654] [2024-11-09 19:43:10,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:43:10,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:43:10,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:43:10,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:43:10,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:10,916 INFO L87 Difference]: Start difference. First operand 5795 states and 10993 transitions. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:43:12,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:43:12,640 INFO L93 Difference]: Finished difference Result 13688 states and 26202 transitions. [2024-11-09 19:43:12,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:43:12,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 492 [2024-11-09 19:43:12,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:43:12,652 INFO L225 Difference]: With dead ends: 13688 [2024-11-09 19:43:12,652 INFO L226 Difference]: Without dead ends: 8195 [2024-11-09 19:43:12,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:12,657 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 380 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 1575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:43:12,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 319 Invalid, 1575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 19:43:12,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8195 states. [2024-11-09 19:43:12,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8195 to 4889. [2024-11-09 19:43:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4889 states, 4888 states have (on average 1.9122340425531914) internal successors, (9347), 4888 states have internal predecessors, (9347), 0 states have call successors, (0), 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-09 19:43:12,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4889 states to 4889 states and 9347 transitions. [2024-11-09 19:43:12,726 INFO L78 Accepts]: Start accepts. Automaton has 4889 states and 9347 transitions. Word has length 492 [2024-11-09 19:43:12,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:43:12,727 INFO L471 AbstractCegarLoop]: Abstraction has 4889 states and 9347 transitions. [2024-11-09 19:43:12,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:43:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 4889 states and 9347 transitions. [2024-11-09 19:43:12,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2024-11-09 19:43:12,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:43:12,734 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2024-11-09 19:43:12,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:43:12,734 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:43:12,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:43:12,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1348653635, now seen corresponding path program 1 times [2024-11-09 19:43:12,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:43:12,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225221118] [2024-11-09 19:43:12,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:12,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:43:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:13,198 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 484 proven. 39 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-09 19:43:13,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:43:13,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225221118] [2024-11-09 19:43:13,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225221118] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:43:13,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993269150] [2024-11-09 19:43:13,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:13,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:43:13,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:43:13,201 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-09 19:43:13,202 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-09 19:43:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:13,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:43:13,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:43:13,480 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-11-09 19:43:13,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:43:13,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993269150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:43:13,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:43:13,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:43:13,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070368035] [2024-11-09 19:43:13,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:43:13,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:43:13,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:43:13,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:43:13,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:43:13,485 INFO L87 Difference]: Start difference. First operand 4889 states and 9347 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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-09 19:43:15,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:43:15,037 INFO L93 Difference]: Finished difference Result 12474 states and 24038 transitions. [2024-11-09 19:43:15,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:43:15,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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 526 [2024-11-09 19:43:15,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:43:15,050 INFO L225 Difference]: With dead ends: 12474 [2024-11-09 19:43:15,050 INFO L226 Difference]: Without dead ends: 7887 [2024-11-09 19:43:15,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:43:15,053 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 536 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:43:15,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 268 Invalid, 1616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 19:43:15,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7887 states. [2024-11-09 19:43:15,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7887 to 6387. [2024-11-09 19:43:15,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6387 states, 6386 states have (on average 1.9151268399624177) internal successors, (12230), 6386 states have internal predecessors, (12230), 0 states have call successors, (0), 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-09 19:43:15,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6387 states to 6387 states and 12230 transitions. [2024-11-09 19:43:15,104 INFO L78 Accepts]: Start accepts. Automaton has 6387 states and 12230 transitions. Word has length 526 [2024-11-09 19:43:15,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:43:15,104 INFO L471 AbstractCegarLoop]: Abstraction has 6387 states and 12230 transitions. [2024-11-09 19:43:15,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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-09 19:43:15,105 INFO L276 IsEmpty]: Start isEmpty. Operand 6387 states and 12230 transitions. [2024-11-09 19:43:15,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2024-11-09 19:43:15,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:43:15,108 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1] [2024-11-09 19:43:15,122 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-09 19:43:15,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:43:15,309 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:43:15,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:43:15,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1181016753, now seen corresponding path program 1 times [2024-11-09 19:43:15,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:43:15,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795478438] [2024-11-09 19:43:15,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:15,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:43:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:15,667 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2024-11-09 19:43:15,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:43:15,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795478438] [2024-11-09 19:43:15,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795478438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:43:15,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:43:15,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:43:15,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329156179] [2024-11-09 19:43:15,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:43:15,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:43:15,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:43:15,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:43:15,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:15,670 INFO L87 Difference]: Start difference. First operand 6387 states and 12230 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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-09 19:43:17,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:43:17,440 INFO L93 Difference]: Finished difference Result 16986 states and 32654 transitions. [2024-11-09 19:43:17,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:43:17,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 530 [2024-11-09 19:43:17,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:43:17,455 INFO L225 Difference]: With dead ends: 16986 [2024-11-09 19:43:17,455 INFO L226 Difference]: Without dead ends: 10901 [2024-11-09 19:43:17,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:17,460 INFO L432 NwaCegarLoop]: 821 mSDtfsCounter, 478 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:43:17,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 856 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 19:43:17,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10901 states. [2024-11-09 19:43:17,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10901 to 10590. [2024-11-09 19:43:17,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10590 states, 10589 states have (on average 1.8948909245443384) internal successors, (20065), 10589 states have internal predecessors, (20065), 0 states have call successors, (0), 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-09 19:43:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10590 states to 10590 states and 20065 transitions. [2024-11-09 19:43:17,546 INFO L78 Accepts]: Start accepts. Automaton has 10590 states and 20065 transitions. Word has length 530 [2024-11-09 19:43:17,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:43:17,547 INFO L471 AbstractCegarLoop]: Abstraction has 10590 states and 20065 transitions. [2024-11-09 19:43:17,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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-09 19:43:17,547 INFO L276 IsEmpty]: Start isEmpty. Operand 10590 states and 20065 transitions. [2024-11-09 19:43:17,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2024-11-09 19:43:17,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:43:17,551 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-09 19:43:17,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:43:17,551 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:43:17,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:43:17,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1545422527, now seen corresponding path program 1 times [2024-11-09 19:43:17,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:43:17,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865264476] [2024-11-09 19:43:17,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:17,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:43:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:17,882 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-11-09 19:43:17,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:43:17,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865264476] [2024-11-09 19:43:17,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865264476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:43:17,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:43:17,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:43:17,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561671849] [2024-11-09 19:43:17,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:43:17,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:43:17,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:43:17,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:43:17,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:17,884 INFO L87 Difference]: Start difference. First operand 10590 states and 20065 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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-09 19:43:19,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:43:19,501 INFO L93 Difference]: Finished difference Result 21176 states and 40162 transitions. [2024-11-09 19:43:19,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:43:19,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 542 [2024-11-09 19:43:19,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:43:19,531 INFO L225 Difference]: With dead ends: 21176 [2024-11-09 19:43:19,531 INFO L226 Difference]: Without dead ends: 10888 [2024-11-09 19:43:19,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:19,547 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 698 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:43:19,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 73 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 19:43:19,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10888 states. [2024-11-09 19:43:19,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10888 to 10588. [2024-11-09 19:43:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10588 states, 10587 states have (on average 1.8948710682913006) internal successors, (20061), 10587 states have internal predecessors, (20061), 0 states have call successors, (0), 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-09 19:43:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10588 states to 10588 states and 20061 transitions. [2024-11-09 19:43:19,721 INFO L78 Accepts]: Start accepts. Automaton has 10588 states and 20061 transitions. Word has length 542 [2024-11-09 19:43:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:43:19,722 INFO L471 AbstractCegarLoop]: Abstraction has 10588 states and 20061 transitions. [2024-11-09 19:43:19,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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-09 19:43:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand 10588 states and 20061 transitions. [2024-11-09 19:43:19,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2024-11-09 19:43:19,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:43:19,729 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 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] [2024-11-09 19:43:19,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:43:19,730 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:43:19,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:43:19,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1469709634, now seen corresponding path program 1 times [2024-11-09 19:43:19,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:43:19,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380736793] [2024-11-09 19:43:19,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:19,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:43:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:19,937 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-11-09 19:43:19,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:43:19,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380736793] [2024-11-09 19:43:19,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380736793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:43:19,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:43:19,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:43:19,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667449319] [2024-11-09 19:43:19,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:43:19,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:43:19,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:43:19,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:43:19,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:19,940 INFO L87 Difference]: Start difference. First operand 10588 states and 20061 transitions. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 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-09 19:43:21,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:43:21,631 INFO L93 Difference]: Finished difference Result 22374 states and 42428 transitions. [2024-11-09 19:43:21,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:43:21,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 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 563 [2024-11-09 19:43:21,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:43:21,645 INFO L225 Difference]: With dead ends: 22374 [2024-11-09 19:43:21,645 INFO L226 Difference]: Without dead ends: 12088 [2024-11-09 19:43:21,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:21,653 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 500 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:43:21,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 330 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 19:43:21,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12088 states. [2024-11-09 19:43:21,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12088 to 8485. [2024-11-09 19:43:21,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8485 states, 8484 states have (on average 1.9074728901461575) internal successors, (16183), 8484 states have internal predecessors, (16183), 0 states have call successors, (0), 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-09 19:43:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8485 states to 8485 states and 16183 transitions. [2024-11-09 19:43:21,736 INFO L78 Accepts]: Start accepts. Automaton has 8485 states and 16183 transitions. Word has length 563 [2024-11-09 19:43:21,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:43:21,737 INFO L471 AbstractCegarLoop]: Abstraction has 8485 states and 16183 transitions. [2024-11-09 19:43:21,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 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-09 19:43:21,737 INFO L276 IsEmpty]: Start isEmpty. Operand 8485 states and 16183 transitions. [2024-11-09 19:43:21,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2024-11-09 19:43:21,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:43:21,743 INFO L215 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1] [2024-11-09 19:43:21,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:43:21,743 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:43:21,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:43:21,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1787526646, now seen corresponding path program 1 times [2024-11-09 19:43:21,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:43:21,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799973853] [2024-11-09 19:43:21,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:21,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:43:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:22,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 643 proven. 39 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-11-09 19:43:22,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:43:22,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799973853] [2024-11-09 19:43:22,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799973853] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:43:22,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366582853] [2024-11-09 19:43:22,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:22,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:43:22,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:43:22,181 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-09 19:43:22,185 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-09 19:43:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:22,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:43:22,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:43:22,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 489 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-11-09 19:43:22,550 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:43:22,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366582853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:43:22,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:43:22,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:43:22,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656077947] [2024-11-09 19:43:22,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:43:22,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:43:22,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:43:22,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:43:22,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:43:22,552 INFO L87 Difference]: Start difference. First operand 8485 states and 16183 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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-09 19:43:23,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:43:23,912 INFO L93 Difference]: Finished difference Result 16665 states and 31822 transitions. [2024-11-09 19:43:23,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:43:23,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 606 [2024-11-09 19:43:23,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:43:23,921 INFO L225 Difference]: With dead ends: 16665 [2024-11-09 19:43:23,922 INFO L226 Difference]: Without dead ends: 8482 [2024-11-09 19:43:23,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 605 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:43:23,928 INFO L432 NwaCegarLoop]: 797 mSDtfsCounter, 484 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:43:23,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 834 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 19:43:23,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8482 states. [2024-11-09 19:43:23,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8482 to 8482. [2024-11-09 19:43:23,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8482 states, 8481 states have (on average 1.8544982902959557) internal successors, (15728), 8481 states have internal predecessors, (15728), 0 states have call successors, (0), 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-09 19:43:23,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8482 states to 8482 states and 15728 transitions. [2024-11-09 19:43:23,997 INFO L78 Accepts]: Start accepts. Automaton has 8482 states and 15728 transitions. Word has length 606 [2024-11-09 19:43:23,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:43:23,997 INFO L471 AbstractCegarLoop]: Abstraction has 8482 states and 15728 transitions. [2024-11-09 19:43:23,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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-09 19:43:23,998 INFO L276 IsEmpty]: Start isEmpty. Operand 8482 states and 15728 transitions. [2024-11-09 19:43:24,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2024-11-09 19:43:24,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:43:24,083 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:43:24,104 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-09 19:43:24,284 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,SelfDestructingSolverStorable12 [2024-11-09 19:43:24,285 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:43:24,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:43:24,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1279151818, now seen corresponding path program 1 times [2024-11-09 19:43:24,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:43:24,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463000944] [2024-11-09 19:43:24,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:24,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:43:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:24,695 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 568 proven. 39 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-09 19:43:24,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:43:24,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463000944] [2024-11-09 19:43:24,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463000944] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:43:24,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750343092] [2024-11-09 19:43:24,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:24,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:43:24,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:43:24,700 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-09 19:43:24,708 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-09 19:43:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:24,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 19:43:24,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:43:25,548 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 568 proven. 39 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-09 19:43:25,548 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:43:26,245 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 568 proven. 39 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-09 19:43:26,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750343092] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 19:43:26,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 19:43:26,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-09 19:43:26,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538336841] [2024-11-09 19:43:26,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 19:43:26,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 19:43:26,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:43:26,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 19:43:26,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 19:43:26,249 INFO L87 Difference]: Start difference. First operand 8482 states and 15728 transitions. Second operand has 9 states, 9 states have (on average 87.22222222222223) internal successors, (785), 8 states have internal predecessors, (785), 0 states have call successors, (0), 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-09 19:43:33,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:43:33,079 INFO L93 Difference]: Finished difference Result 23422 states and 43281 transitions. [2024-11-09 19:43:33,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 19:43:33,079 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 87.22222222222223) internal successors, (785), 8 states have internal predecessors, (785), 0 states have call successors, (0), 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 606 [2024-11-09 19:43:33,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:43:33,089 INFO L225 Difference]: With dead ends: 23422 [2024-11-09 19:43:33,089 INFO L226 Difference]: Without dead ends: 10283 [2024-11-09 19:43:33,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1221 GetRequests, 1207 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-09 19:43:33,102 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 5908 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 10566 mSolverCounterSat, 534 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5908 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 11100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 534 IncrementalHoareTripleChecker+Valid, 10566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:43:33,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5908 Valid, 331 Invalid, 11100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [534 Valid, 10566 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-11-09 19:43:33,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10283 states. [2024-11-09 19:43:33,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10283 to 10280. [2024-11-09 19:43:33,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10280 states, 10279 states have (on average 1.804261114894445) internal successors, (18546), 10279 states have internal predecessors, (18546), 0 states have call successors, (0), 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-09 19:43:33,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10280 states to 10280 states and 18546 transitions. [2024-11-09 19:43:33,191 INFO L78 Accepts]: Start accepts. Automaton has 10280 states and 18546 transitions. Word has length 606 [2024-11-09 19:43:33,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:43:33,191 INFO L471 AbstractCegarLoop]: Abstraction has 10280 states and 18546 transitions. [2024-11-09 19:43:33,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.22222222222223) internal successors, (785), 8 states have internal predecessors, (785), 0 states have call successors, (0), 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-09 19:43:33,192 INFO L276 IsEmpty]: Start isEmpty. Operand 10280 states and 18546 transitions. [2024-11-09 19:43:33,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2024-11-09 19:43:33,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:43:33,197 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2024-11-09 19:43:33,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 19:43:33,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:43:33,401 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:43:33,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:43:33,402 INFO L85 PathProgramCache]: Analyzing trace with hash -2040294638, now seen corresponding path program 1 times [2024-11-09 19:43:33,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:43:33,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050565239] [2024-11-09 19:43:33,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:33,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:43:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:33,622 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-11-09 19:43:33,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:43:33,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050565239] [2024-11-09 19:43:33,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050565239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:43:33,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:43:33,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:43:33,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400970571] [2024-11-09 19:43:33,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:43:33,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:43:33,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:43:33,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:43:33,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:33,625 INFO L87 Difference]: Start difference. First operand 10280 states and 18546 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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-09 19:43:34,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:43:34,701 INFO L93 Difference]: Finished difference Result 23257 states and 42015 transitions. [2024-11-09 19:43:34,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:43:34,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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 642 [2024-11-09 19:43:34,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:43:34,712 INFO L225 Difference]: With dead ends: 23257 [2024-11-09 19:43:34,713 INFO L226 Difference]: Without dead ends: 12979 [2024-11-09 19:43:34,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:34,718 INFO L432 NwaCegarLoop]: 718 mSDtfsCounter, 510 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:43:34,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 758 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:43:34,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12979 states. [2024-11-09 19:43:34,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12979 to 12679. [2024-11-09 19:43:34,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12679 states, 12678 states have (on average 1.7998895724877741) internal successors, (22819), 12678 states have internal predecessors, (22819), 0 states have call successors, (0), 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-09 19:43:34,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12679 states to 12679 states and 22819 transitions. [2024-11-09 19:43:34,807 INFO L78 Accepts]: Start accepts. Automaton has 12679 states and 22819 transitions. Word has length 642 [2024-11-09 19:43:34,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:43:34,808 INFO L471 AbstractCegarLoop]: Abstraction has 12679 states and 22819 transitions. [2024-11-09 19:43:34,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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-09 19:43:34,808 INFO L276 IsEmpty]: Start isEmpty. Operand 12679 states and 22819 transitions. [2024-11-09 19:43:34,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2024-11-09 19:43:34,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:43:34,816 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2024-11-09 19:43:34,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 19:43:34,816 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:43:34,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:43:34,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1058774780, now seen corresponding path program 1 times [2024-11-09 19:43:34,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:43:34,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722473680] [2024-11-09 19:43:34,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:34,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:43:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:35,151 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-09 19:43:35,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:43:35,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722473680] [2024-11-09 19:43:35,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722473680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:43:35,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:43:35,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:43:35,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733212289] [2024-11-09 19:43:35,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:43:35,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:43:35,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:43:35,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:43:35,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:35,153 INFO L87 Difference]: Start difference. First operand 12679 states and 22819 transitions. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 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-09 19:43:36,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:43:36,307 INFO L93 Difference]: Finished difference Result 28067 states and 50572 transitions. [2024-11-09 19:43:36,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:43:36,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 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 666 [2024-11-09 19:43:36,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:43:36,322 INFO L225 Difference]: With dead ends: 28067 [2024-11-09 19:43:36,323 INFO L226 Difference]: Without dead ends: 15690 [2024-11-09 19:43:36,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:36,331 INFO L432 NwaCegarLoop]: 686 mSDtfsCounter, 318 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:43:36,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 720 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:43:36,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15690 states. [2024-11-09 19:43:36,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15690 to 15386. [2024-11-09 19:43:36,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15386 states, 15385 states have (on average 1.8006499837504062) internal successors, (27703), 15385 states have internal predecessors, (27703), 0 states have call successors, (0), 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-09 19:43:36,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15386 states to 15386 states and 27703 transitions. [2024-11-09 19:43:36,546 INFO L78 Accepts]: Start accepts. Automaton has 15386 states and 27703 transitions. Word has length 666 [2024-11-09 19:43:36,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:43:36,547 INFO L471 AbstractCegarLoop]: Abstraction has 15386 states and 27703 transitions. [2024-11-09 19:43:36,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 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-09 19:43:36,547 INFO L276 IsEmpty]: Start isEmpty. Operand 15386 states and 27703 transitions. [2024-11-09 19:43:36,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2024-11-09 19:43:36,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:43:36,555 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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-09 19:43:36,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 19:43:36,555 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:43:36,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:43:36,556 INFO L85 PathProgramCache]: Analyzing trace with hash 822805212, now seen corresponding path program 1 times [2024-11-09 19:43:36,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:43:36,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556907481] [2024-11-09 19:43:36,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:36,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:43:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2024-11-09 19:43:36,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:43:36,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556907481] [2024-11-09 19:43:36,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556907481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:43:36,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:43:36,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:43:36,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548534536] [2024-11-09 19:43:36,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:43:36,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:43:36,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:43:36,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:43:36,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:36,808 INFO L87 Difference]: Start difference. First operand 15386 states and 27703 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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-09 19:43:37,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:43:37,976 INFO L93 Difference]: Finished difference Result 33466 states and 60343 transitions. [2024-11-09 19:43:37,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:43:37,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 671 [2024-11-09 19:43:37,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:43:37,993 INFO L225 Difference]: With dead ends: 33466 [2024-11-09 19:43:37,993 INFO L226 Difference]: Without dead ends: 18382 [2024-11-09 19:43:38,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:38,003 INFO L432 NwaCegarLoop]: 690 mSDtfsCounter, 547 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:43:38,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 730 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:43:38,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18382 states. [2024-11-09 19:43:38,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18382 to 15980. [2024-11-09 19:43:38,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15980 states, 15979 states have (on average 1.799549408598786) internal successors, (28755), 15979 states have internal predecessors, (28755), 0 states have call successors, (0), 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-09 19:43:38,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15980 states to 15980 states and 28755 transitions. [2024-11-09 19:43:38,131 INFO L78 Accepts]: Start accepts. Automaton has 15980 states and 28755 transitions. Word has length 671 [2024-11-09 19:43:38,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:43:38,131 INFO L471 AbstractCegarLoop]: Abstraction has 15980 states and 28755 transitions. [2024-11-09 19:43:38,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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-09 19:43:38,131 INFO L276 IsEmpty]: Start isEmpty. Operand 15980 states and 28755 transitions. [2024-11-09 19:43:38,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2024-11-09 19:43:38,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:43:38,209 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:43:38,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 19:43:38,209 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:43:38,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:43:38,210 INFO L85 PathProgramCache]: Analyzing trace with hash -282888478, now seen corresponding path program 1 times [2024-11-09 19:43:38,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:43:38,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456191114] [2024-11-09 19:43:38,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:38,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:43:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:38,537 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-09 19:43:38,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:43:38,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456191114] [2024-11-09 19:43:38,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456191114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:43:38,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:43:38,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:43:38,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380910191] [2024-11-09 19:43:38,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:43:38,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:43:38,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:43:38,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:43:38,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:38,540 INFO L87 Difference]: Start difference. First operand 15980 states and 28755 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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-09 19:43:39,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:43:39,696 INFO L93 Difference]: Finished difference Result 32557 states and 58592 transitions. [2024-11-09 19:43:39,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:43:39,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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 693 [2024-11-09 19:43:39,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:43:39,713 INFO L225 Difference]: With dead ends: 32557 [2024-11-09 19:43:39,713 INFO L226 Difference]: Without dead ends: 16879 [2024-11-09 19:43:39,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:39,723 INFO L432 NwaCegarLoop]: 631 mSDtfsCounter, 589 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:43:39,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 652 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:43:39,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16879 states. [2024-11-09 19:43:39,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16879 to 15379. [2024-11-09 19:43:39,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15379 states, 15378 states have (on average 1.7969176746000781) internal successors, (27633), 15378 states have internal predecessors, (27633), 0 states have call successors, (0), 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-09 19:43:39,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15379 states to 15379 states and 27633 transitions. [2024-11-09 19:43:39,853 INFO L78 Accepts]: Start accepts. Automaton has 15379 states and 27633 transitions. Word has length 693 [2024-11-09 19:43:39,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:43:39,853 INFO L471 AbstractCegarLoop]: Abstraction has 15379 states and 27633 transitions. [2024-11-09 19:43:39,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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-09 19:43:39,854 INFO L276 IsEmpty]: Start isEmpty. Operand 15379 states and 27633 transitions. [2024-11-09 19:43:39,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 849 [2024-11-09 19:43:39,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:43:39,863 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:43:39,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 19:43:39,863 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:43:39,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:43:39,864 INFO L85 PathProgramCache]: Analyzing trace with hash -970272227, now seen corresponding path program 1 times [2024-11-09 19:43:39,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:43:39,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312907052] [2024-11-09 19:43:39,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:39,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:43:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 593 proven. 270 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-11-09 19:43:41,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:43:41,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312907052] [2024-11-09 19:43:41,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312907052] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:43:41,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573753796] [2024-11-09 19:43:41,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:41,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:43:41,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:43:41,174 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:43:41,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 19:43:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:41,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 982 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 19:43:41,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:43:41,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2024-11-09 19:43:41,523 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:43:41,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573753796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:43:41,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:43:41,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:43:41,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533085288] [2024-11-09 19:43:41,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:43:41,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:43:41,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:43:41,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:43:41,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:43:41,525 INFO L87 Difference]: Start difference. First operand 15379 states and 27633 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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-09 19:43:42,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:43:42,775 INFO L93 Difference]: Finished difference Result 33768 states and 60666 transitions. [2024-11-09 19:43:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:43:42,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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 848 [2024-11-09 19:43:42,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:43:42,795 INFO L225 Difference]: With dead ends: 33768 [2024-11-09 19:43:42,795 INFO L226 Difference]: Without dead ends: 18691 [2024-11-09 19:43:42,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 847 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:43:42,805 INFO L432 NwaCegarLoop]: 697 mSDtfsCounter, 523 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:43:42,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 729 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:43:42,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18691 states. [2024-11-09 19:43:42,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18691 to 16883. [2024-11-09 19:43:42,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16883 states, 16882 states have (on average 1.7963511432294752) internal successors, (30326), 16882 states have internal predecessors, (30326), 0 states have call successors, (0), 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-09 19:43:42,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16883 states to 16883 states and 30326 transitions. [2024-11-09 19:43:42,954 INFO L78 Accepts]: Start accepts. Automaton has 16883 states and 30326 transitions. Word has length 848 [2024-11-09 19:43:42,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:43:42,954 INFO L471 AbstractCegarLoop]: Abstraction has 16883 states and 30326 transitions. [2024-11-09 19:43:42,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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-09 19:43:42,955 INFO L276 IsEmpty]: Start isEmpty. Operand 16883 states and 30326 transitions. [2024-11-09 19:43:42,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 883 [2024-11-09 19:43:42,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:43:42,966 INFO L215 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:43:42,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 19:43:43,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:43:43,167 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:43:43,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:43:43,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2023912963, now seen corresponding path program 1 times [2024-11-09 19:43:43,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:43:43,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51701767] [2024-11-09 19:43:43,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:43,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:43:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:43,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1391 backedges. 743 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-09 19:43:43,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:43:43,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51701767] [2024-11-09 19:43:43,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51701767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:43:43,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:43:43,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:43:43,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842161389] [2024-11-09 19:43:43,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:43:43,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:43:43,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:43:43,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:43:43,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:43,867 INFO L87 Difference]: Start difference. First operand 16883 states and 30326 transitions. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 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-09 19:43:44,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:43:44,912 INFO L93 Difference]: Finished difference Result 37077 states and 66580 transitions. [2024-11-09 19:43:44,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:43:44,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 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 882 [2024-11-09 19:43:44,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:43:44,935 INFO L225 Difference]: With dead ends: 37077 [2024-11-09 19:43:44,935 INFO L226 Difference]: Without dead ends: 20196 [2024-11-09 19:43:44,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:43:44,946 INFO L432 NwaCegarLoop]: 695 mSDtfsCounter, 372 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:43:44,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 725 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:43:44,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20196 states. [2024-11-09 19:43:45,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20196 to 16580. [2024-11-09 19:43:45,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16580 states, 16579 states have (on average 1.7958863622655166) internal successors, (29774), 16579 states have internal predecessors, (29774), 0 states have call successors, (0), 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-09 19:43:45,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16580 states to 16580 states and 29774 transitions. [2024-11-09 19:43:45,127 INFO L78 Accepts]: Start accepts. Automaton has 16580 states and 29774 transitions. Word has length 882 [2024-11-09 19:43:45,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:43:45,127 INFO L471 AbstractCegarLoop]: Abstraction has 16580 states and 29774 transitions. [2024-11-09 19:43:45,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 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-09 19:43:45,127 INFO L276 IsEmpty]: Start isEmpty. Operand 16580 states and 29774 transitions. [2024-11-09 19:43:45,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 886 [2024-11-09 19:43:45,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:43:45,139 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:43:45,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 19:43:45,139 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:43:45,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:43:45,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2008200354, now seen corresponding path program 1 times [2024-11-09 19:43:45,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:43:45,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412681227] [2024-11-09 19:43:45,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:45,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:43:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:46,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 667 proven. 270 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-11-09 19:43:46,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:43:46,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412681227] [2024-11-09 19:43:46,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412681227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:43:46,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437612288] [2024-11-09 19:43:46,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:46,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:43:46,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:43:46,330 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:43:46,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 19:43:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:46,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:43:46,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:43:46,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 975 trivial. 0 not checked. [2024-11-09 19:43:46,964 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:43:46,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437612288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:43:46,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:43:46,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:43:46,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916051977] [2024-11-09 19:43:46,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:43:46,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:43:46,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:43:46,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:43:46,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:43:46,967 INFO L87 Difference]: Start difference. First operand 16580 states and 29774 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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-09 19:43:48,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:43:48,366 INFO L93 Difference]: Finished difference Result 37078 states and 66600 transitions. [2024-11-09 19:43:48,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:43:48,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 885 [2024-11-09 19:43:48,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:43:48,385 INFO L225 Difference]: With dead ends: 37078 [2024-11-09 19:43:48,385 INFO L226 Difference]: Without dead ends: 20800 [2024-11-09 19:43:48,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 888 GetRequests, 884 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:43:48,393 INFO L432 NwaCegarLoop]: 632 mSDtfsCounter, 545 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:43:48,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 656 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 19:43:48,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20800 states. [2024-11-09 19:43:48,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20800 to 17183. [2024-11-09 19:43:48,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17183 states, 17182 states have (on average 1.797229658945408) internal successors, (30880), 17182 states have internal predecessors, (30880), 0 states have call successors, (0), 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-09 19:43:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17183 states to 17183 states and 30880 transitions. [2024-11-09 19:43:48,548 INFO L78 Accepts]: Start accepts. Automaton has 17183 states and 30880 transitions. Word has length 885 [2024-11-09 19:43:48,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:43:48,548 INFO L471 AbstractCegarLoop]: Abstraction has 17183 states and 30880 transitions. [2024-11-09 19:43:48,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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-09 19:43:48,549 INFO L276 IsEmpty]: Start isEmpty. Operand 17183 states and 30880 transitions. [2024-11-09 19:43:48,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1008 [2024-11-09 19:43:48,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:43:48,569 INFO L215 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:43:48,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 19:43:48,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:43:48,770 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:43:48,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:43:48,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1766424444, now seen corresponding path program 1 times [2024-11-09 19:43:48,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:43:48,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770677943] [2024-11-09 19:43:48,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:48,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:43:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:50,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1665 backedges. 1217 proven. 90 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2024-11-09 19:43:50,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:43:50,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770677943] [2024-11-09 19:43:50,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770677943] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:43:50,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431517694] [2024-11-09 19:43:50,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:43:50,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:43:50,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:43:50,352 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:43:50,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 19:43:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:43:50,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 1162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 19:43:50,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:43:51,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1665 backedges. 1098 proven. 378 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-11-09 19:43:51,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:43:51,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1665 backedges. 817 proven. 0 refuted. 0 times theorem prover too weak. 848 trivial. 0 not checked. [2024-11-09 19:43:51,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431517694] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 19:43:51,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 19:43:51,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 6] total 10 [2024-11-09 19:43:51,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736539846] [2024-11-09 19:43:51,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:43:51,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:43:51,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:43:51,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:43:51,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-09 19:43:51,493 INFO L87 Difference]: Start difference. First operand 17183 states and 30880 transitions. Second operand has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 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-09 19:43:52,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:43:52,774 INFO L93 Difference]: Finished difference Result 36170 states and 65016 transitions. [2024-11-09 19:43:52,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:43:52,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1007 [2024-11-09 19:43:52,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:43:52,776 INFO L225 Difference]: With dead ends: 36170 [2024-11-09 19:43:52,776 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 19:43:52,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2019 GetRequests, 2011 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-09 19:43:52,788 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 917 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:43:52,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 53 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:43:52,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 19:43:52,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 19:43:52,788 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-09 19:43:52,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 19:43:52,789 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1007 [2024-11-09 19:43:52,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:43:52,789 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 19:43:52,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 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-09 19:43:52,789 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 19:43:52,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 19:43:52,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 19:43:52,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 19:43:52,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:43:52,995 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:43:52,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 19:43:55,358 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 19:43:55,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:43:55 BoogieIcfgContainer [2024-11-09 19:43:55,369 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 19:43:55,370 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 19:43:55,370 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 19:43:55,370 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 19:43:55,370 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:42:56" (3/4) ... [2024-11-09 19:43:55,373 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 19:43:55,413 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-09 19:43:55,420 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 19:43:55,425 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 19:43:55,428 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 19:43:55,628 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 19:43:55,628 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 19:43:55,628 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 19:43:55,631 INFO L158 Benchmark]: Toolchain (without parser) took 63185.82ms. Allocated memory was 165.7MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 90.1MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 411.1MB. Max. memory is 16.1GB. [2024-11-09 19:43:55,631 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 115.3MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 19:43:55,631 INFO L158 Benchmark]: CACSL2BoogieTranslator took 781.41ms. Allocated memory is still 165.7MB. Free memory was 89.9MB in the beginning and 82.8MB in the end (delta: 7.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-09 19:43:55,631 INFO L158 Benchmark]: Boogie Procedure Inliner took 190.57ms. Allocated memory is still 165.7MB. Free memory was 82.8MB in the beginning and 106.3MB in the end (delta: -23.5MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2024-11-09 19:43:55,631 INFO L158 Benchmark]: Boogie Preprocessor took 233.95ms. Allocated memory is still 165.7MB. Free memory was 106.3MB in the beginning and 102.7MB in the end (delta: 3.6MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. [2024-11-09 19:43:55,631 INFO L158 Benchmark]: IcfgBuilder took 2366.56ms. Allocated memory was 165.7MB in the beginning and 310.4MB in the end (delta: 144.7MB). Free memory was 102.7MB in the beginning and 239.6MB in the end (delta: -136.9MB). Peak memory consumption was 149.2MB. Max. memory is 16.1GB. [2024-11-09 19:43:55,631 INFO L158 Benchmark]: TraceAbstraction took 59349.83ms. Allocated memory was 310.4MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 238.7MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-11-09 19:43:55,631 INFO L158 Benchmark]: Witness Printer took 258.47ms. Allocated memory is still 1.9GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-09 19:43:55,632 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 115.3MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 781.41ms. Allocated memory is still 165.7MB. Free memory was 89.9MB in the beginning and 82.8MB in the end (delta: 7.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 190.57ms. Allocated memory is still 165.7MB. Free memory was 82.8MB in the beginning and 106.3MB in the end (delta: -23.5MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 233.95ms. Allocated memory is still 165.7MB. Free memory was 106.3MB in the beginning and 102.7MB in the end (delta: 3.6MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. * IcfgBuilder took 2366.56ms. Allocated memory was 165.7MB in the beginning and 310.4MB in the end (delta: 144.7MB). Free memory was 102.7MB in the beginning and 239.6MB in the end (delta: -136.9MB). Peak memory consumption was 149.2MB. Max. memory is 16.1GB. * TraceAbstraction took 59349.83ms. Allocated memory was 310.4MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 238.7MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 258.47ms. Allocated memory is still 1.9GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. 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: 125]: 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, 427 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.9s, OverallIterations: 22, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 38.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16657 SdHoareTripleChecker+Valid, 36.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16657 mSDsluCounter, 12126 SdHoareTripleChecker+Invalid, 30.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1001 mSDsCounter, 3990 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38039 IncrementalHoareTripleChecker+Invalid, 42029 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3990 mSolverCounterUnsat, 11125 mSDtfsCounter, 38039 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6161 GetRequests, 6107 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17183occurred in iteration=21, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 22887 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 16411 NumberOfCodeBlocks, 16411 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 17994 ConstructedInterpolants, 0 QuantifiedInterpolants, 57717 SizeOfPredicates, 5 NumberOfNonLiveVariables, 5330 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 30 InterpolantComputations, 21 PerfectInterpolantSequences, 20556/21759 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]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 19:43:55,658 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