./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label36.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label36.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 f8c7f180e45ffba5eb47ee4dc238e0b48ee8dddec8c88fb0da95366e7d605cc2 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:30:43,161 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:30:43,221 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:30:43,224 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:30:43,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:30:43,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:30:43,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:30:43,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:30:43,248 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:30:43,248 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:30:43,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:30:43,249 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:30:43,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:30:43,250 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:30:43,250 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:30:43,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:30:43,251 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:30:43,251 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:30:43,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:30:43,251 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:30:43,251 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:30:43,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:30:43,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:30:43,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:30:43,257 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:30:43,257 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:30:43,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:30:43,258 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:30:43,258 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:30:43,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:30:43,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:30:43,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:30:43,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:30:43,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:30:43,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:30:43,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:30:43,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:30:43,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:30:43,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:30:43,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:30:43,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:30:43,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:30:43,261 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 -> f8c7f180e45ffba5eb47ee4dc238e0b48ee8dddec8c88fb0da95366e7d605cc2 [2024-11-08 11:30:43,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:30:43,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:30:43,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:30:43,489 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:30:43,490 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:30:43,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label36.c [2024-11-08 11:30:44,705 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:30:44,955 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:30:44,956 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label36.c [2024-11-08 11:30:44,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cc66f218/ad141a13408f4e11ac3e5348b41ef272/FLAG39ef7212c [2024-11-08 11:30:44,990 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cc66f218/ad141a13408f4e11ac3e5348b41ef272 [2024-11-08 11:30:44,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:30:44,994 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:30:44,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:30:44,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:30:45,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:30:45,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:30:44" (1/1) ... [2024-11-08 11:30:45,002 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f1bf77f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:45, skipping insertion in model container [2024-11-08 11:30:45,002 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:30:44" (1/1) ... [2024-11-08 11:30:45,097 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:30:45,280 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_label36.c[7434,7447] [2024-11-08 11:30:45,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:30:45,549 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:30:45,572 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_label36.c[7434,7447] [2024-11-08 11:30:45,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:30:45,708 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:30:45,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:45 WrapperNode [2024-11-08 11:30:45,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:30:45,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:30:45,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:30:45,710 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:30:45,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:45" (1/1) ... [2024-11-08 11:30:45,739 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:45" (1/1) ... [2024-11-08 11:30:45,872 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-11-08 11:30:45,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:30:45,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:30:45,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:30:45,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:30:45,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:45" (1/1) ... [2024-11-08 11:30:45,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:45" (1/1) ... [2024-11-08 11:30:45,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:45" (1/1) ... [2024-11-08 11:30:45,986 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 11:30:45,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:45" (1/1) ... [2024-11-08 11:30:45,986 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:45" (1/1) ... [2024-11-08 11:30:46,069 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:45" (1/1) ... [2024-11-08 11:30:46,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:45" (1/1) ... [2024-11-08 11:30:46,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:45" (1/1) ... [2024-11-08 11:30:46,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:45" (1/1) ... [2024-11-08 11:30:46,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:30:46,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:30:46,127 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:30:46,127 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:30:46,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:45" (1/1) ... [2024-11-08 11:30:46,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:30:46,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:30:46,158 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 11:30:46,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 11:30:46,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:30:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:30:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:30:46,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:30:46,248 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:30:46,249 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:30:48,044 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-11-08 11:30:48,045 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:30:48,064 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:30:48,064 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:30:48,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:30:48 BoogieIcfgContainer [2024-11-08 11:30:48,064 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:30:48,066 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:30:48,066 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:30:48,068 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:30:48,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:30:44" (1/3) ... [2024-11-08 11:30:48,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51925e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:30:48, skipping insertion in model container [2024-11-08 11:30:48,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:45" (2/3) ... [2024-11-08 11:30:48,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51925e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:30:48, skipping insertion in model container [2024-11-08 11:30:48,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:30:48" (3/3) ... [2024-11-08 11:30:48,070 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label36.c [2024-11-08 11:30:48,082 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:30:48,082 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:30:48,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:30:48,140 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;@2f695140, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:30:48,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:30:48,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:48,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-08 11:30:48,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:48,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:30:48,154 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:48,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:48,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1818267785, now seen corresponding path program 1 times [2024-11-08 11:30:48,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:48,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292758988] [2024-11-08 11:30:48,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:48,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:48,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:30:48,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:48,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292758988] [2024-11-08 11:30:48,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292758988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:48,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:48,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:30:48,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371382471] [2024-11-08 11:30:48,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:48,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:48,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:48,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:48,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:48,513 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:49,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:49,976 INFO L93 Difference]: Finished difference Result 1155 states and 2106 transitions. [2024-11-08 11:30:49,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:49,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-11-08 11:30:49,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:49,988 INFO L225 Difference]: With dead ends: 1155 [2024-11-08 11:30:49,988 INFO L226 Difference]: Without dead ends: 667 [2024-11-08 11:30:49,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:49,994 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 283 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:49,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 371 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 11:30:50,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-11-08 11:30:50,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2024-11-08 11:30:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 664 states have (on average 1.4789156626506024) internal successors, (982), 664 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 982 transitions. [2024-11-08 11:30:50,049 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 982 transitions. Word has length 61 [2024-11-08 11:30:50,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:50,053 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 982 transitions. [2024-11-08 11:30:50,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:50,054 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 982 transitions. [2024-11-08 11:30:50,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-08 11:30:50,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:50,057 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:30:50,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:30:50,058 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:50,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:50,058 INFO L85 PathProgramCache]: Analyzing trace with hash -12161809, now seen corresponding path program 1 times [2024-11-08 11:30:50,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:50,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584654738] [2024-11-08 11:30:50,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:50,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:50,230 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:30:50,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:50,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584654738] [2024-11-08 11:30:50,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584654738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:50,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:50,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:30:50,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394620378] [2024-11-08 11:30:50,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:50,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:50,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:50,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:50,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:50,233 INFO L87 Difference]: Start difference. First operand 665 states and 982 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:51,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:51,652 INFO L93 Difference]: Finished difference Result 1955 states and 2894 transitions. [2024-11-08 11:30:51,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:51,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2024-11-08 11:30:51,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:51,656 INFO L225 Difference]: With dead ends: 1955 [2024-11-08 11:30:51,656 INFO L226 Difference]: Without dead ends: 1292 [2024-11-08 11:30:51,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:51,658 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 258 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:51,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 327 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 11:30:51,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2024-11-08 11:30:51,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1282. [2024-11-08 11:30:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1281 states have (on average 1.3989071038251366) internal successors, (1792), 1281 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1792 transitions. [2024-11-08 11:30:51,689 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1792 transitions. Word has length 136 [2024-11-08 11:30:51,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:51,690 INFO L471 AbstractCegarLoop]: Abstraction has 1282 states and 1792 transitions. [2024-11-08 11:30:51,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:51,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1792 transitions. [2024-11-08 11:30:51,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 11:30:51,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:51,692 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:30:51,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:30:51,693 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:51,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:51,693 INFO L85 PathProgramCache]: Analyzing trace with hash 527052153, now seen corresponding path program 1 times [2024-11-08 11:30:51,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:51,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259120864] [2024-11-08 11:30:51,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:51,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:51,838 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:30:51,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:51,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259120864] [2024-11-08 11:30:51,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259120864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:51,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:51,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:30:51,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336777118] [2024-11-08 11:30:51,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:51,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:51,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:51,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:51,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:51,840 INFO L87 Difference]: Start difference. First operand 1282 states and 1792 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:53,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:53,367 INFO L93 Difference]: Finished difference Result 3764 states and 5263 transitions. [2024-11-08 11:30:53,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:53,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2024-11-08 11:30:53,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:53,374 INFO L225 Difference]: With dead ends: 3764 [2024-11-08 11:30:53,374 INFO L226 Difference]: Without dead ends: 2484 [2024-11-08 11:30:53,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:53,389 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 236 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:53,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 366 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 11:30:53,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2024-11-08 11:30:53,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2182. [2024-11-08 11:30:53,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 2181 states have (on average 1.2815222375057314) internal successors, (2795), 2181 states have internal predecessors, (2795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:53,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 2795 transitions. [2024-11-08 11:30:53,420 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 2795 transitions. Word has length 140 [2024-11-08 11:30:53,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:53,420 INFO L471 AbstractCegarLoop]: Abstraction has 2182 states and 2795 transitions. [2024-11-08 11:30:53,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:53,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2795 transitions. [2024-11-08 11:30:53,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-08 11:30:53,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:53,426 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:30:53,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:30:53,426 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:53,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:53,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1978174500, now seen corresponding path program 1 times [2024-11-08 11:30:53,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:53,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995559705] [2024-11-08 11:30:53,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:53,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:53,616 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-08 11:30:53,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:53,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995559705] [2024-11-08 11:30:53,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995559705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:53,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:53,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:30:53,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892512914] [2024-11-08 11:30:53,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:53,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:53,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:53,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:53,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:53,620 INFO L87 Difference]: Start difference. First operand 2182 states and 2795 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:54,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:54,686 INFO L93 Difference]: Finished difference Result 6166 states and 7961 transitions. [2024-11-08 11:30:54,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:54,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 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 231 [2024-11-08 11:30:54,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:54,699 INFO L225 Difference]: With dead ends: 6166 [2024-11-08 11:30:54,699 INFO L226 Difference]: Without dead ends: 3986 [2024-11-08 11:30:54,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:54,702 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:54,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 339 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:30:54,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2024-11-08 11:30:54,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3682. [2024-11-08 11:30:54,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3682 states, 3681 states have (on average 1.2200488997555012) internal successors, (4491), 3681 states have internal predecessors, (4491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:54,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 4491 transitions. [2024-11-08 11:30:54,755 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 4491 transitions. Word has length 231 [2024-11-08 11:30:54,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:54,756 INFO L471 AbstractCegarLoop]: Abstraction has 3682 states and 4491 transitions. [2024-11-08 11:30:54,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:54,757 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 4491 transitions. [2024-11-08 11:30:54,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-11-08 11:30:54,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:54,761 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:30:54,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:30:54,761 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:54,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:54,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1603270012, now seen corresponding path program 1 times [2024-11-08 11:30:54,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:54,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833067777] [2024-11-08 11:30:54,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:54,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:55,318 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-08 11:30:55,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:55,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833067777] [2024-11-08 11:30:55,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833067777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:55,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:55,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:30:55,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311646576] [2024-11-08 11:30:55,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:55,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:55,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:55,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:55,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:55,322 INFO L87 Difference]: Start difference. First operand 3682 states and 4491 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:56,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:56,370 INFO L93 Difference]: Finished difference Result 7661 states and 9291 transitions. [2024-11-08 11:30:56,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:56,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 333 [2024-11-08 11:30:56,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:56,380 INFO L225 Difference]: With dead ends: 7661 [2024-11-08 11:30:56,381 INFO L226 Difference]: Without dead ends: 3981 [2024-11-08 11:30:56,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:56,385 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:56,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:30:56,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2024-11-08 11:30:56,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3981. [2024-11-08 11:30:56,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3981 states, 3980 states have (on average 1.2050251256281408) internal successors, (4796), 3980 states have internal predecessors, (4796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:56,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 4796 transitions. [2024-11-08 11:30:56,431 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 4796 transitions. Word has length 333 [2024-11-08 11:30:56,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:56,432 INFO L471 AbstractCegarLoop]: Abstraction has 3981 states and 4796 transitions. [2024-11-08 11:30:56,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:56,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 4796 transitions. [2024-11-08 11:30:56,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-11-08 11:30:56,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:56,436 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:30:56,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:30:56,436 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:56,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:56,437 INFO L85 PathProgramCache]: Analyzing trace with hash -985073555, now seen corresponding path program 1 times [2024-11-08 11:30:56,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:56,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39527048] [2024-11-08 11:30:56,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:56,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:56,713 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-08 11:30:56,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:56,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39527048] [2024-11-08 11:30:56,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39527048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:56,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:56,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:30:56,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014477545] [2024-11-08 11:30:56,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:56,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:56,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:56,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:56,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:56,715 INFO L87 Difference]: Start difference. First operand 3981 states and 4796 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:57,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:57,996 INFO L93 Difference]: Finished difference Result 9465 states and 11674 transitions. [2024-11-08 11:30:57,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:57,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 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 348 [2024-11-08 11:30:57,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:58,012 INFO L225 Difference]: With dead ends: 9465 [2024-11-08 11:30:58,012 INFO L226 Difference]: Without dead ends: 5785 [2024-11-08 11:30:58,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:58,017 INFO L432 NwaCegarLoop]: 632 mSDtfsCounter, 255 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:58,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 671 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 11:30:58,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5785 states. [2024-11-08 11:30:58,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5785 to 5783. [2024-11-08 11:30:58,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5783 states, 5782 states have (on average 1.1675890695261155) internal successors, (6751), 5782 states have internal predecessors, (6751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5783 states to 5783 states and 6751 transitions. [2024-11-08 11:30:58,099 INFO L78 Accepts]: Start accepts. Automaton has 5783 states and 6751 transitions. Word has length 348 [2024-11-08 11:30:58,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:58,099 INFO L471 AbstractCegarLoop]: Abstraction has 5783 states and 6751 transitions. [2024-11-08 11:30:58,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:58,100 INFO L276 IsEmpty]: Start isEmpty. Operand 5783 states and 6751 transitions. [2024-11-08 11:30:58,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2024-11-08 11:30:58,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:58,103 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:30:58,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:30:58,104 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:58,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:58,105 INFO L85 PathProgramCache]: Analyzing trace with hash -988421462, now seen corresponding path program 1 times [2024-11-08 11:30:58,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:58,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092558517] [2024-11-08 11:30:58,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:58,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:58,325 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-08 11:30:58,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:58,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092558517] [2024-11-08 11:30:58,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092558517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:58,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:58,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:30:58,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444699892] [2024-11-08 11:30:58,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:58,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:58,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:58,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:58,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:58,329 INFO L87 Difference]: Start difference. First operand 5783 states and 6751 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:59,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:59,404 INFO L93 Difference]: Finished difference Result 13364 states and 15910 transitions. [2024-11-08 11:30:59,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:59,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 407 [2024-11-08 11:30:59,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:59,422 INFO L225 Difference]: With dead ends: 13364 [2024-11-08 11:30:59,422 INFO L226 Difference]: Without dead ends: 7882 [2024-11-08 11:30:59,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:59,428 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 266 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:59,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 635 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:30:59,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7882 states. [2024-11-08 11:30:59,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7882 to 7284. [2024-11-08 11:30:59,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7284 states, 7283 states have (on average 1.148702457778388) internal successors, (8366), 7283 states have internal predecessors, (8366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:59,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7284 states to 7284 states and 8366 transitions. [2024-11-08 11:30:59,508 INFO L78 Accepts]: Start accepts. Automaton has 7284 states and 8366 transitions. Word has length 407 [2024-11-08 11:30:59,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:59,509 INFO L471 AbstractCegarLoop]: Abstraction has 7284 states and 8366 transitions. [2024-11-08 11:30:59,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:59,509 INFO L276 IsEmpty]: Start isEmpty. Operand 7284 states and 8366 transitions. [2024-11-08 11:30:59,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2024-11-08 11:30:59,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:59,514 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:30:59,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:30:59,514 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:59,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:59,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1305181093, now seen corresponding path program 1 times [2024-11-08 11:30:59,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:59,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379795362] [2024-11-08 11:30:59,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:59,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:59,777 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-08 11:30:59,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:59,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379795362] [2024-11-08 11:30:59,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379795362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:59,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:59,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:30:59,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870332419] [2024-11-08 11:30:59,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:59,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:59,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:59,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:59,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:59,780 INFO L87 Difference]: Start difference. First operand 7284 states and 8366 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:00,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:31:00,749 INFO L93 Difference]: Finished difference Result 16069 states and 18814 transitions. [2024-11-08 11:31:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:31:00,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 422 [2024-11-08 11:31:00,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:31:00,769 INFO L225 Difference]: With dead ends: 16069 [2024-11-08 11:31:00,770 INFO L226 Difference]: Without dead ends: 9086 [2024-11-08 11:31:00,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:31:00,776 INFO L432 NwaCegarLoop]: 585 mSDtfsCounter, 268 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:31:00,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 623 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 11:31:00,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9086 states. [2024-11-08 11:31:00,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9086 to 8481. [2024-11-08 11:31:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8481 states, 8480 states have (on average 1.1379716981132075) internal successors, (9650), 8480 states have internal predecessors, (9650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8481 states to 8481 states and 9650 transitions. [2024-11-08 11:31:00,855 INFO L78 Accepts]: Start accepts. Automaton has 8481 states and 9650 transitions. Word has length 422 [2024-11-08 11:31:00,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:31:00,856 INFO L471 AbstractCegarLoop]: Abstraction has 8481 states and 9650 transitions. [2024-11-08 11:31:00,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:00,856 INFO L276 IsEmpty]: Start isEmpty. Operand 8481 states and 9650 transitions. [2024-11-08 11:31:00,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2024-11-08 11:31:00,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:31:00,860 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:31:00,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:31:00,860 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:31:00,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:31:00,860 INFO L85 PathProgramCache]: Analyzing trace with hash -178061979, now seen corresponding path program 1 times [2024-11-08 11:31:00,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:31:00,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951526986] [2024-11-08 11:31:00,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:31:00,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:31:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:31:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-08 11:31:01,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:31:01,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951526986] [2024-11-08 11:31:01,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951526986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:31:01,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:31:01,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:31:01,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450258625] [2024-11-08 11:31:01,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:31:01,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:31:01,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:31:01,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:31:01,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:31:01,103 INFO L87 Difference]: Start difference. First operand 8481 states and 9650 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:02,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:31:02,574 INFO L93 Difference]: Finished difference Result 19651 states and 22543 transitions. [2024-11-08 11:31:02,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:31:02,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 512 [2024-11-08 11:31:02,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:31:02,598 INFO L225 Difference]: With dead ends: 19651 [2024-11-08 11:31:02,598 INFO L226 Difference]: Without dead ends: 11471 [2024-11-08 11:31:02,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-08 11:31:02,607 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 148 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:31:02,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 315 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 11:31:02,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11471 states. [2024-11-08 11:31:02,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11471 to 7578. [2024-11-08 11:31:02,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7578 states, 7577 states have (on average 1.1486076283489508) internal successors, (8703), 7577 states have internal predecessors, (8703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:02,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 8703 transitions. [2024-11-08 11:31:02,690 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 8703 transitions. Word has length 512 [2024-11-08 11:31:02,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:31:02,690 INFO L471 AbstractCegarLoop]: Abstraction has 7578 states and 8703 transitions. [2024-11-08 11:31:02,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:02,691 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 8703 transitions. [2024-11-08 11:31:02,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2024-11-08 11:31:02,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:31:02,695 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2024-11-08 11:31:02,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:31:02,695 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:31:02,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:31:02,695 INFO L85 PathProgramCache]: Analyzing trace with hash -596337022, now seen corresponding path program 1 times [2024-11-08 11:31:02,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:31:02,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775168948] [2024-11-08 11:31:02,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:31:02,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:31:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:31:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 527 proven. 39 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2024-11-08 11:31:03,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:31:03,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775168948] [2024-11-08 11:31:03,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775168948] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:31:03,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523095471] [2024-11-08 11:31:03,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:31:03,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:31:03,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:31:03,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:31:03,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 11:31:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:31:03,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:31:03,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:31:03,498 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2024-11-08 11:31:03,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:31:03,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523095471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:31:03,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:31:03,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 11:31:03,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574122168] [2024-11-08 11:31:03,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:31:03,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:31:03,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:31:03,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:31:03,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:31:03,500 INFO L87 Difference]: Start difference. First operand 7578 states and 8703 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:04,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:31:04,406 INFO L93 Difference]: Finished difference Result 17246 states and 20055 transitions. [2024-11-08 11:31:04,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:31:04,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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 545 [2024-11-08 11:31:04,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:31:04,418 INFO L225 Difference]: With dead ends: 17246 [2024-11-08 11:31:04,418 INFO L226 Difference]: Without dead ends: 9969 [2024-11-08 11:31:04,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 544 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-08 11:31:04,424 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 356 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:31:04,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 447 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 11:31:04,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9969 states. [2024-11-08 11:31:04,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9969 to 9969. [2024-11-08 11:31:04,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9969 states, 9968 states have (on average 1.1499799357945426) internal successors, (11463), 9968 states have internal predecessors, (11463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:04,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9969 states to 9969 states and 11463 transitions. [2024-11-08 11:31:04,501 INFO L78 Accepts]: Start accepts. Automaton has 9969 states and 11463 transitions. Word has length 545 [2024-11-08 11:31:04,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:31:04,501 INFO L471 AbstractCegarLoop]: Abstraction has 9969 states and 11463 transitions. [2024-11-08 11:31:04,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:04,502 INFO L276 IsEmpty]: Start isEmpty. Operand 9969 states and 11463 transitions. [2024-11-08 11:31:04,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2024-11-08 11:31:04,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:31:04,505 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:31:04,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 11:31:04,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 11:31:04,706 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:31:04,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:31:04,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1882152332, now seen corresponding path program 1 times [2024-11-08 11:31:04,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:31:04,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419276944] [2024-11-08 11:31:04,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:31:04,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:31:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:31:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 471 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-11-08 11:31:05,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:31:05,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419276944] [2024-11-08 11:31:05,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419276944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:31:05,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:31:05,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:31:05,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445135396] [2024-11-08 11:31:05,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:31:05,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:31:05,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:31:05,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:31:05,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:31:05,054 INFO L87 Difference]: Start difference. First operand 9969 states and 11463 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:06,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:31:06,135 INFO L93 Difference]: Finished difference Result 24136 states and 28002 transitions. [2024-11-08 11:31:06,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:31:06,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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 549 [2024-11-08 11:31:06,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:31:06,151 INFO L225 Difference]: With dead ends: 24136 [2024-11-08 11:31:06,151 INFO L226 Difference]: Without dead ends: 14468 [2024-11-08 11:31:06,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:31:06,157 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:31:06,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 621 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:31:06,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14468 states. [2024-11-08 11:31:06,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14468 to 14158. [2024-11-08 11:31:06,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14158 states, 14157 states have (on average 1.1348449530267712) internal successors, (16066), 14157 states have internal predecessors, (16066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:06,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14158 states to 14158 states and 16066 transitions. [2024-11-08 11:31:06,266 INFO L78 Accepts]: Start accepts. Automaton has 14158 states and 16066 transitions. Word has length 549 [2024-11-08 11:31:06,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:31:06,267 INFO L471 AbstractCegarLoop]: Abstraction has 14158 states and 16066 transitions. [2024-11-08 11:31:06,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:06,267 INFO L276 IsEmpty]: Start isEmpty. Operand 14158 states and 16066 transitions. [2024-11-08 11:31:06,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2024-11-08 11:31:06,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:31:06,274 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, 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, 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-08 11:31:06,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 11:31:06,275 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:31:06,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:31:06,275 INFO L85 PathProgramCache]: Analyzing trace with hash -490695072, now seen corresponding path program 1 times [2024-11-08 11:31:06,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:31:06,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057624268] [2024-11-08 11:31:06,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:31:06,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:31:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:31:06,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 684 proven. 39 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2024-11-08 11:31:06,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:31:06,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057624268] [2024-11-08 11:31:06,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057624268] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:31:06,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455378199] [2024-11-08 11:31:06,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:31:06,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:31:06,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:31:06,769 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:31:06,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 11:31:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:31:06,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:31:06,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:31:07,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 605 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2024-11-08 11:31:07,020 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:31:07,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455378199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:31:07,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:31:07,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 11:31:07,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594690829] [2024-11-08 11:31:07,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:31:07,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:31:07,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:31:07,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:31:07,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:31:07,021 INFO L87 Difference]: Start difference. First operand 14158 states and 16066 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:08,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:31:08,001 INFO L93 Difference]: Finished difference Result 27712 states and 31490 transitions. [2024-11-08 11:31:08,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:31:08,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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 624 [2024-11-08 11:31:08,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:31:08,017 INFO L225 Difference]: With dead ends: 27712 [2024-11-08 11:31:08,017 INFO L226 Difference]: Without dead ends: 13855 [2024-11-08 11:31:08,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 623 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-08 11:31:08,027 INFO L432 NwaCegarLoop]: 567 mSDtfsCounter, 252 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:31:08,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 604 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 11:31:08,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13855 states. [2024-11-08 11:31:08,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13855 to 13854. [2024-11-08 11:31:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13854 states, 13853 states have (on average 1.081642965422652) internal successors, (14984), 13853 states have internal predecessors, (14984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13854 states to 13854 states and 14984 transitions. [2024-11-08 11:31:08,182 INFO L78 Accepts]: Start accepts. Automaton has 13854 states and 14984 transitions. Word has length 624 [2024-11-08 11:31:08,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:31:08,183 INFO L471 AbstractCegarLoop]: Abstraction has 13854 states and 14984 transitions. [2024-11-08 11:31:08,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:08,184 INFO L276 IsEmpty]: Start isEmpty. Operand 13854 states and 14984 transitions. [2024-11-08 11:31:08,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2024-11-08 11:31:08,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:31:08,194 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2024-11-08 11:31:08,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 11:31:08,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-08 11:31:08,395 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:31:08,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:31:08,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1471252033, now seen corresponding path program 1 times [2024-11-08 11:31:08,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:31:08,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706149888] [2024-11-08 11:31:08,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:31:08,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:31:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:31:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 611 proven. 39 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2024-11-08 11:31:08,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:31:08,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706149888] [2024-11-08 11:31:08,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706149888] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:31:08,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697227346] [2024-11-08 11:31:08,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:31:08,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:31:08,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:31:08,842 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:31:08,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 11:31:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:31:08,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 11:31:09,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:31:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 611 proven. 39 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2024-11-08 11:31:09,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:31:10,122 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 611 proven. 39 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2024-11-08 11:31:10,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697227346] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 11:31:10,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 11:31:10,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-08 11:31:10,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815083654] [2024-11-08 11:31:10,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 11:31:10,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 11:31:10,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:31:10,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 11:31:10,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 11:31:10,126 INFO L87 Difference]: Start difference. First operand 13854 states and 14984 transitions. Second operand has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:14,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:31:14,400 INFO L93 Difference]: Finished difference Result 35741 states and 38659 transitions. [2024-11-08 11:31:14,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 11:31:14,401 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 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 625 [2024-11-08 11:31:14,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:31:14,417 INFO L225 Difference]: With dead ends: 35741 [2024-11-08 11:31:14,418 INFO L226 Difference]: Without dead ends: 16247 [2024-11-08 11:31:14,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1259 GetRequests, 1245 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-08 11:31:14,424 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 2851 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 6160 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2851 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 6841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 6160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:31:14,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2851 Valid, 242 Invalid, 6841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 6160 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-08 11:31:14,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16247 states. [2024-11-08 11:31:14,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16247 to 12357. [2024-11-08 11:31:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12357 states, 12356 states have (on average 1.0386047264486888) internal successors, (12833), 12356 states have internal predecessors, (12833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:14,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12357 states to 12357 states and 12833 transitions. [2024-11-08 11:31:14,516 INFO L78 Accepts]: Start accepts. Automaton has 12357 states and 12833 transitions. Word has length 625 [2024-11-08 11:31:14,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:31:14,517 INFO L471 AbstractCegarLoop]: Abstraction has 12357 states and 12833 transitions. [2024-11-08 11:31:14,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:14,517 INFO L276 IsEmpty]: Start isEmpty. Operand 12357 states and 12833 transitions. [2024-11-08 11:31:14,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2024-11-08 11:31:14,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:31:14,523 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:31:14,537 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-08 11:31:14,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:31:14,723 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:31:14,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:31:14,724 INFO L85 PathProgramCache]: Analyzing trace with hash -2145955924, now seen corresponding path program 1 times [2024-11-08 11:31:14,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:31:14,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575168244] [2024-11-08 11:31:14,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:31:14,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:31:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:31:14,931 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-08 11:31:14,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:31:14,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575168244] [2024-11-08 11:31:14,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575168244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:31:14,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:31:14,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:31:14,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70060473] [2024-11-08 11:31:14,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:31:14,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:31:14,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:31:14,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:31:14,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:31:14,932 INFO L87 Difference]: Start difference. First operand 12357 states and 12833 transitions. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:15,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:31:15,670 INFO L93 Difference]: Finished difference Result 28295 states and 29436 transitions. [2024-11-08 11:31:15,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:31:15,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 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 662 [2024-11-08 11:31:15,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:31:15,683 INFO L225 Difference]: With dead ends: 28295 [2024-11-08 11:31:15,684 INFO L226 Difference]: Without dead ends: 15940 [2024-11-08 11:31:15,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:31:15,693 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 253 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:31:15,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 536 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:31:15,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15940 states. [2024-11-08 11:31:15,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15940 to 15043. [2024-11-08 11:31:15,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15043 states, 15042 states have (on average 1.032974338518814) internal successors, (15538), 15042 states have internal predecessors, (15538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15043 states to 15043 states and 15538 transitions. [2024-11-08 11:31:15,857 INFO L78 Accepts]: Start accepts. Automaton has 15043 states and 15538 transitions. Word has length 662 [2024-11-08 11:31:15,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:31:15,857 INFO L471 AbstractCegarLoop]: Abstraction has 15043 states and 15538 transitions. [2024-11-08 11:31:15,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:15,858 INFO L276 IsEmpty]: Start isEmpty. Operand 15043 states and 15538 transitions. [2024-11-08 11:31:15,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 687 [2024-11-08 11:31:15,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:31:15,868 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:31:15,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 11:31:15,868 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:31:15,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:31:15,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1492551500, now seen corresponding path program 1 times [2024-11-08 11:31:15,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:31:15,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425336705] [2024-11-08 11:31:15,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:31:15,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:31:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:31:16,224 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-08 11:31:16,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:31:16,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425336705] [2024-11-08 11:31:16,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425336705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:31:16,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:31:16,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:31:16,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63546657] [2024-11-08 11:31:16,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:31:16,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:31:16,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:31:16,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:31:16,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:31:16,227 INFO L87 Difference]: Start difference. First operand 15043 states and 15538 transitions. Second operand has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:16,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:31:16,921 INFO L93 Difference]: Finished difference Result 33081 states and 34229 transitions. [2024-11-08 11:31:16,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:31:16,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 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 686 [2024-11-08 11:31:16,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:31:16,938 INFO L225 Difference]: With dead ends: 33081 [2024-11-08 11:31:16,938 INFO L226 Difference]: Without dead ends: 18339 [2024-11-08 11:31:16,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:31:16,951 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 87 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:31:16,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 512 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:31:16,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18339 states. [2024-11-08 11:31:17,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18339 to 18038. [2024-11-08 11:31:17,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18038 states, 18037 states have (on average 1.0326550978544105) internal successors, (18626), 18037 states have internal predecessors, (18626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18038 states to 18038 states and 18626 transitions. [2024-11-08 11:31:17,087 INFO L78 Accepts]: Start accepts. Automaton has 18038 states and 18626 transitions. Word has length 686 [2024-11-08 11:31:17,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:31:17,087 INFO L471 AbstractCegarLoop]: Abstraction has 18038 states and 18626 transitions. [2024-11-08 11:31:17,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:17,087 INFO L276 IsEmpty]: Start isEmpty. Operand 18038 states and 18626 transitions. [2024-11-08 11:31:17,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 789 [2024-11-08 11:31:17,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:31:17,097 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:31:17,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 11:31:17,098 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:31:17,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:31:17,098 INFO L85 PathProgramCache]: Analyzing trace with hash 918291843, now seen corresponding path program 1 times [2024-11-08 11:31:17,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:31:17,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433750689] [2024-11-08 11:31:17,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:31:17,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:31:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:31:17,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 748 proven. 0 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2024-11-08 11:31:17,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:31:17,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433750689] [2024-11-08 11:31:17,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433750689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:31:17,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:31:17,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:31:17,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283328303] [2024-11-08 11:31:17,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:31:17,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:31:17,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:31:17,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:31:17,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:31:17,385 INFO L87 Difference]: Start difference. First operand 18038 states and 18626 transitions. Second operand has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:18,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:31:18,110 INFO L93 Difference]: Finished difference Result 38762 states and 40068 transitions. [2024-11-08 11:31:18,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:31:18,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 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 788 [2024-11-08 11:31:18,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:31:18,127 INFO L225 Difference]: With dead ends: 38762 [2024-11-08 11:31:18,127 INFO L226 Difference]: Without dead ends: 20726 [2024-11-08 11:31:18,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:31:18,138 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 183 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:31:18,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 171 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:31:18,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20726 states. [2024-11-08 11:31:18,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20726 to 19829. [2024-11-08 11:31:18,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19829 states, 19828 states have (on average 1.030260238047206) internal successors, (20428), 19828 states have internal predecessors, (20428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:18,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19829 states to 19829 states and 20428 transitions. [2024-11-08 11:31:18,277 INFO L78 Accepts]: Start accepts. Automaton has 19829 states and 20428 transitions. Word has length 788 [2024-11-08 11:31:18,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:31:18,277 INFO L471 AbstractCegarLoop]: Abstraction has 19829 states and 20428 transitions. [2024-11-08 11:31:18,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:18,277 INFO L276 IsEmpty]: Start isEmpty. Operand 19829 states and 20428 transitions. [2024-11-08 11:31:18,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2024-11-08 11:31:18,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:31:18,289 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:31:18,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 11:31:18,289 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:31:18,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:31:18,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1105372660, now seen corresponding path program 1 times [2024-11-08 11:31:18,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:31:18,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591838820] [2024-11-08 11:31:18,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:31:18,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:31:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:31:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 592 proven. 0 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2024-11-08 11:31:18,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:31:18,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591838820] [2024-11-08 11:31:18,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591838820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:31:18,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:31:18,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:31:18,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397614610] [2024-11-08 11:31:18,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:31:18,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:31:18,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:31:18,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:31:18,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:31:18,633 INFO L87 Difference]: Start difference. First operand 19829 states and 20428 transitions. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:31:19,326 INFO L93 Difference]: Finished difference Result 42641 states and 44001 transitions. [2024-11-08 11:31:19,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:31:19,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 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 846 [2024-11-08 11:31:19,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:31:19,344 INFO L225 Difference]: With dead ends: 42641 [2024-11-08 11:31:19,345 INFO L226 Difference]: Without dead ends: 23113 [2024-11-08 11:31:19,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:31:19,357 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 314 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:31:19,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 505 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:31:19,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23113 states. [2024-11-08 11:31:19,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23113 to 19820. [2024-11-08 11:31:19,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19820 states, 19819 states have (on average 1.0282052575811091) internal successors, (20378), 19819 states have internal predecessors, (20378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:19,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19820 states to 19820 states and 20378 transitions. [2024-11-08 11:31:19,503 INFO L78 Accepts]: Start accepts. Automaton has 19820 states and 20378 transitions. Word has length 846 [2024-11-08 11:31:19,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:31:19,504 INFO L471 AbstractCegarLoop]: Abstraction has 19820 states and 20378 transitions. [2024-11-08 11:31:19,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:19,504 INFO L276 IsEmpty]: Start isEmpty. Operand 19820 states and 20378 transitions. [2024-11-08 11:31:19,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 868 [2024-11-08 11:31:19,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:31:19,513 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 11:31:19,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 11:31:19,514 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:31:19,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:31:19,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1187839850, now seen corresponding path program 1 times [2024-11-08 11:31:19,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:31:19,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499914258] [2024-11-08 11:31:19,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:31:19,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:31:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:31:20,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 637 proven. 269 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-11-08 11:31:20,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:31:20,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499914258] [2024-11-08 11:31:20,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499914258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:31:20,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354570957] [2024-11-08 11:31:20,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:31:20,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:31:20,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:31:20,631 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-08 11:31:20,632 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-08 11:31:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:31:20,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 1002 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 11:31:20,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:31:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2024-11-08 11:31:20,935 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:31:20,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354570957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:31:20,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:31:20,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 11:31:20,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951485374] [2024-11-08 11:31:20,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:31:20,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:31:20,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:31:20,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:31:20,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:31:20,937 INFO L87 Difference]: Start difference. First operand 19820 states and 20378 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:31:21,696 INFO L93 Difference]: Finished difference Result 43838 states and 45054 transitions. [2024-11-08 11:31:21,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:31:21,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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 867 [2024-11-08 11:31:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:31:21,716 INFO L225 Difference]: With dead ends: 43838 [2024-11-08 11:31:21,716 INFO L226 Difference]: Without dead ends: 24319 [2024-11-08 11:31:21,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 870 GetRequests, 866 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-08 11:31:21,727 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 268 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:31:21,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 496 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:31:21,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24319 states. [2024-11-08 11:31:21,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24319 to 21917. [2024-11-08 11:31:21,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21917 states, 21916 states have (on average 1.0275141449169556) internal successors, (22519), 21916 states have internal predecessors, (22519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:21,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21917 states to 21917 states and 22519 transitions. [2024-11-08 11:31:21,889 INFO L78 Accepts]: Start accepts. Automaton has 21917 states and 22519 transitions. Word has length 867 [2024-11-08 11:31:21,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:31:21,889 INFO L471 AbstractCegarLoop]: Abstraction has 21917 states and 22519 transitions. [2024-11-08 11:31:21,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:21,889 INFO L276 IsEmpty]: Start isEmpty. Operand 21917 states and 22519 transitions. [2024-11-08 11:31:21,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2024-11-08 11:31:21,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:31:21,899 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-08 11:31:21,912 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-08 11:31:22,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-08 11:31:22,101 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:31:22,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:31:22,101 INFO L85 PathProgramCache]: Analyzing trace with hash -568589825, now seen corresponding path program 1 times [2024-11-08 11:31:22,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:31:22,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989849750] [2024-11-08 11:31:22,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:31:22,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:31:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:31:22,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 859 proven. 0 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2024-11-08 11:31:22,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:31:22,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989849750] [2024-11-08 11:31:22,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989849750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:31:22,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:31:22,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:31:22,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702092931] [2024-11-08 11:31:22,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:31:22,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:31:22,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:31:22,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:31:22,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:31:22,729 INFO L87 Difference]: Start difference. First operand 21917 states and 22519 transitions. Second operand has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:23,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:31:23,467 INFO L93 Difference]: Finished difference Result 47734 states and 49018 transitions. [2024-11-08 11:31:23,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:31:23,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 900 [2024-11-08 11:31:23,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:31:23,490 INFO L225 Difference]: With dead ends: 47734 [2024-11-08 11:31:23,490 INFO L226 Difference]: Without dead ends: 25819 [2024-11-08 11:31:23,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:31:23,503 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 142 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:31:23,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 492 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:31:23,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25819 states. [2024-11-08 11:31:23,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25819 to 21615. [2024-11-08 11:31:23,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21615 states, 21614 states have (on average 1.0270657906912186) internal successors, (22199), 21614 states have internal predecessors, (22199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21615 states to 21615 states and 22199 transitions. [2024-11-08 11:31:23,666 INFO L78 Accepts]: Start accepts. Automaton has 21615 states and 22199 transitions. Word has length 900 [2024-11-08 11:31:23,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:31:23,666 INFO L471 AbstractCegarLoop]: Abstraction has 21615 states and 22199 transitions. [2024-11-08 11:31:23,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:23,667 INFO L276 IsEmpty]: Start isEmpty. Operand 21615 states and 22199 transitions. [2024-11-08 11:31:23,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 905 [2024-11-08 11:31:23,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:31:23,675 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 11:31:23,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 11:31:23,675 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:31:23,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:31:23,676 INFO L85 PathProgramCache]: Analyzing trace with hash 629237515, now seen corresponding path program 1 times [2024-11-08 11:31:23,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:31:23,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911240319] [2024-11-08 11:31:23,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:31:23,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:31:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:31:24,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 711 proven. 269 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-11-08 11:31:24,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:31:24,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911240319] [2024-11-08 11:31:24,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911240319] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:31:24,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470055899] [2024-11-08 11:31:24,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:31:24,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:31:24,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:31:24,802 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-08 11:31:24,802 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-08 11:31:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:31:24,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 11:31:25,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:31:25,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-08 11:31:25,177 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:31:25,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470055899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:31:25,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:31:25,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 11:31:25,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954469851] [2024-11-08 11:31:25,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:31:25,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:31:25,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:31:25,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:31:25,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:31:25,178 INFO L87 Difference]: Start difference. First operand 21615 states and 22199 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:25,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:31:25,892 INFO L93 Difference]: Finished difference Result 35715 states and 36571 transitions. [2024-11-08 11:31:25,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:31:25,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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 904 [2024-11-08 11:31:25,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:31:25,903 INFO L225 Difference]: With dead ends: 35715 [2024-11-08 11:31:25,903 INFO L226 Difference]: Without dead ends: 14401 [2024-11-08 11:31:25,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 907 GetRequests, 903 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-08 11:31:25,914 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 263 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:31:25,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 396 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:31:25,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14401 states. [2024-11-08 11:31:25,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14401 to 11999. [2024-11-08 11:31:25,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11999 states, 11998 states have (on average 1.0183363893982331) internal successors, (12218), 11998 states have internal predecessors, (12218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:25,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11999 states to 11999 states and 12218 transitions. [2024-11-08 11:31:25,996 INFO L78 Accepts]: Start accepts. Automaton has 11999 states and 12218 transitions. Word has length 904 [2024-11-08 11:31:25,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:31:25,996 INFO L471 AbstractCegarLoop]: Abstraction has 11999 states and 12218 transitions. [2024-11-08 11:31:25,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:25,996 INFO L276 IsEmpty]: Start isEmpty. Operand 11999 states and 12218 transitions. [2024-11-08 11:31:26,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1026 [2024-11-08 11:31:26,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:31:26,006 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-08 11:31:26,019 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-08 11:31:26,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:31:26,206 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:31:26,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:31:26,207 INFO L85 PathProgramCache]: Analyzing trace with hash -849008212, now seen corresponding path program 1 times [2024-11-08 11:31:26,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:31:26,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638939694] [2024-11-08 11:31:26,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:31:26,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:31:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:31:27,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1775 backedges. 1281 proven. 90 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2024-11-08 11:31:27,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:31:27,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638939694] [2024-11-08 11:31:27,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638939694] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:31:27,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272426963] [2024-11-08 11:31:27,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:31:27,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:31:27,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:31:27,488 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-08 11:31:27,490 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-08 11:31:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:31:27,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 1181 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 11:31:27,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:31:28,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1775 backedges. 1188 proven. 399 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-11-08 11:31:28,228 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:31:28,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1775 backedges. 933 proven. 0 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2024-11-08 11:31:28,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272426963] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 11:31:28,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 11:31:28,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 6] total 10 [2024-11-08 11:31:28,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731053315] [2024-11-08 11:31:28,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:31:28,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:31:28,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:31:28,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:31:28,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-08 11:31:28,468 INFO L87 Difference]: Start difference. First operand 11999 states and 12218 transitions. Second operand has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:29,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:31:29,161 INFO L93 Difference]: Finished difference Result 25194 states and 25664 transitions. [2024-11-08 11:31:29,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:31:29,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 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 1025 [2024-11-08 11:31:29,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:31:29,162 INFO L225 Difference]: With dead ends: 25194 [2024-11-08 11:31:29,162 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 11:31:29,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2055 GetRequests, 2047 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-08 11:31:29,170 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 419 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:31:29,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 36 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:31:29,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 11:31:29,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 11:31:29,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:29,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 11:31:29,170 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1025 [2024-11-08 11:31:29,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:31:29,171 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 11:31:29,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:29,171 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 11:31:29,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 11:31:29,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 11:31:29,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 11:31:29,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:31:29,377 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] [2024-11-08 11:31:29,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 11:31:31,285 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 11:31:31,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:31:31 BoogieIcfgContainer [2024-11-08 11:31:31,308 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 11:31:31,309 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 11:31:31,309 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 11:31:31,309 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 11:31:31,309 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:30:48" (3/4) ... [2024-11-08 11:31:31,311 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 11:31:31,336 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-08 11:31:31,337 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 11:31:31,338 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 11:31:31,340 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 11:31:31,518 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 11:31:31,518 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 11:31:31,519 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 11:31:31,519 INFO L158 Benchmark]: Toolchain (without parser) took 46524.73ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 95.9MB in the beginning and 813.3MB in the end (delta: -717.4MB). Peak memory consumption was 790.6MB. Max. memory is 16.1GB. [2024-11-08 11:31:31,519 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 71.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 11:31:31,519 INFO L158 Benchmark]: CACSL2BoogieTranslator took 712.62ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 60.9MB in the end (delta: 34.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-08 11:31:31,519 INFO L158 Benchmark]: Boogie Procedure Inliner took 162.52ms. Allocated memory is still 167.8MB. Free memory was 60.9MB in the beginning and 103.9MB in the end (delta: -42.9MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2024-11-08 11:31:31,520 INFO L158 Benchmark]: Boogie Preprocessor took 254.09ms. Allocated memory was 167.8MB in the beginning and 266.3MB in the end (delta: 98.6MB). Free memory was 103.9MB in the beginning and 198.2MB in the end (delta: -94.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-08 11:31:31,520 INFO L158 Benchmark]: RCFGBuilder took 1937.22ms. Allocated memory is still 266.3MB. Free memory was 198.2MB in the beginning and 111.8MB in the end (delta: 86.4MB). Peak memory consumption was 100.0MB. Max. memory is 16.1GB. [2024-11-08 11:31:31,520 INFO L158 Benchmark]: TraceAbstraction took 43242.59ms. Allocated memory was 266.3MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 110.7MB in the beginning and 840.6MB in the end (delta: -729.9MB). Peak memory consumption was 752.8MB. Max. memory is 16.1GB. [2024-11-08 11:31:31,520 INFO L158 Benchmark]: Witness Printer took 209.85ms. Allocated memory is still 1.7GB. Free memory was 840.6MB in the beginning and 813.3MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-08 11:31:31,521 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 109.1MB. Free memory is still 71.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 712.62ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 60.9MB in the end (delta: 34.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 162.52ms. Allocated memory is still 167.8MB. Free memory was 60.9MB in the beginning and 103.9MB in the end (delta: -42.9MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 254.09ms. Allocated memory was 167.8MB in the beginning and 266.3MB in the end (delta: 98.6MB). Free memory was 103.9MB in the beginning and 198.2MB in the end (delta: -94.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1937.22ms. Allocated memory is still 266.3MB. Free memory was 198.2MB in the beginning and 111.8MB in the end (delta: 86.4MB). Peak memory consumption was 100.0MB. Max. memory is 16.1GB. * TraceAbstraction took 43242.59ms. Allocated memory was 266.3MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 110.7MB in the beginning and 840.6MB in the end (delta: -729.9MB). Peak memory consumption was 752.8MB. Max. memory is 16.1GB. * Witness Printer took 209.85ms. Allocated memory is still 1.7GB. Free memory was 840.6MB in the beginning and 813.3MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 200]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.3s, OverallIterations: 21, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 24.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7710 SdHoareTripleChecker+Valid, 22.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7710 mSDsluCounter, 9064 SdHoareTripleChecker+Invalid, 19.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 841 mSDsCounter, 3867 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23643 IncrementalHoareTripleChecker+Invalid, 27510 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3867 mSolverCounterUnsat, 8223 mSDtfsCounter, 23643 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6306 GetRequests, 6253 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21917occurred in iteration=18, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 24313 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 16201 NumberOfCodeBlocks, 16201 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 17822 ConstructedInterpolants, 0 QuantifiedInterpolants, 58461 SizeOfPredicates, 5 NumberOfNonLiveVariables, 5448 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 29 InterpolantComputations, 20 PerfectInterpolantSequences, 22671/23893 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((2 == a2) && (((long long) 89 + a4) <= 0)) && (((long long) a0 + 61) <= 0)) || (((0 <= ((long long) a29 + 15)) && (((long long) 89 + a4) <= 0)) && (3 == a2))) || ((((((long long) 89 + a4) <= 0) && (0 <= ((long long) 600143 + a29))) && (3 == a2)) && (((long long) a29 + 127) <= 0))) || (((((long long) 89 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (5 <= a2))) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) 600143 + a29)))) || (((2 == a2) && (44 <= a29)) && (((long long) 98 + a0) <= 0))) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a0 + 61) <= 0))) || (((((0 <= ((long long) a4 + 85)) && (a2 == 1)) && (a29 <= 401234)) || (((a2 == 1) && (a29 <= 401234)) && (((long long) a0 + 61) <= 0))) && (0 <= ((long long) 600143 + a29)))) || (((0 <= ((long long) a29 + 15)) && (((long long) 89 + a4) <= 0)) && (5 <= a2))) || ((((2 == a2) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 99) <= 0)) && (0 <= ((long long) a29 + 13)))) || ((((0 <= ((long long) 97 + a0)) && (((long long) 89 + a4) <= 0)) && (5 <= a2)) && (((long long) a0 + 61) <= 0))) || (((((long long) 98 + a0) <= 0) && (a2 == 1)) && (0 <= ((long long) 600143 + a29)))) || ((((0 <= ((long long) a4 + 85)) && (((long long) 98 + a0) <= 0)) && (5 <= a2)) && (0 <= ((long long) 600143 + a29)))) || (((0 <= ((long long) a29 + 15)) && (((long long) a0 + 99) <= 0)) && (3 == a2))) || ((((2 == a2) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 15))) && (((long long) a0 + 147) <= 0))) || ((((0 <= ((long long) a4 + 85)) && (5 <= a2)) && (0 <= ((long long) a29 + 13))) && (((long long) a0 + 61) <= 0))) || (((((long long) 89 + a4) <= 0) && (0 <= ((long long) 600143 + a29))) && (a2 == 4))) || (((44 <= a29) && (((long long) 98 + a0) <= 0)) && (5 <= a2))) || (((((long long) 89 + a4) <= 0) && (a2 == 4)) && (((long long) a0 + 61) <= 0))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || (((((long long) a0 + 147) <= 0) && (0 <= ((long long) 600143 + a29))) && (a2 == 4))) || (((((long long) a0 + 147) <= 0) && (0 <= ((long long) 600143 + a29))) && (3 == a2))) || ((((0 <= ((long long) a4 + 85)) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (a2 == 4))) || ((((((long long) 89 + a4) <= 0) && (a2 == 1)) && (0 <= ((long long) 44 + a0))) && (((long long) a29 + 127) == 0))) || (((((long long) 89 + a4) <= 0) && (3 == a2)) && (((long long) a0 + 61) <= 0))) || ((((2 == a2) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 3))) && (((long long) 98 + a0) <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-08 11:31:31,546 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