./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label55.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label55.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 b72ce2b63fc45ad9e7a0a19d4e53676fd1965a82647477e906aa1505ccdd455f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:48:40,396 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:48:40,452 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:48:40,457 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:48:40,457 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:48:40,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:48:40,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:48:40,484 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:48:40,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:48:40,486 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:48:40,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:48:40,486 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:48:40,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:48:40,487 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:48:40,488 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:48:40,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:48:40,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:48:40,490 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:48:40,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:48:40,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:48:40,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:48:40,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:48:40,494 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:48:40,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:48:40,495 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:48:40,495 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:48:40,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:48:40,495 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:48:40,495 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:48:40,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:48:40,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:48:40,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:48:40,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:48:40,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:48:40,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:48:40,496 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:48:40,497 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:48:40,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:48:40,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:48:40,497 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:48:40,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:48:40,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:48:40,500 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 -> b72ce2b63fc45ad9e7a0a19d4e53676fd1965a82647477e906aa1505ccdd455f [2024-10-13 23:48:40,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:48:40,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:48:40,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:48:40,743 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:48:40,743 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:48:40,744 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label55.c [2024-10-13 23:48:42,000 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:48:42,245 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:48:42,246 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label55.c [2024-10-13 23:48:42,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98c2bae10/af620dee641a491f8942be6d99210696/FLAGcd79e1e2d [2024-10-13 23:48:42,279 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98c2bae10/af620dee641a491f8942be6d99210696 [2024-10-13 23:48:42,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:48:42,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:48:42,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:48:42,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:48:42,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:48:42,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:48:42" (1/1) ... [2024-10-13 23:48:42,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a76cfb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:48:42, skipping insertion in model container [2024-10-13 23:48:42,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:48:42" (1/1) ... [2024-10-13 23:48:42,350 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:48:42,596 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label55.c[6938,6951] [2024-10-13 23:48:42,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:48:42,843 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:48:42,864 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label55.c[6938,6951] [2024-10-13 23:48:43,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:48:43,017 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:48:43,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:48:43 WrapperNode [2024-10-13 23:48:43,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:48:43,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:48:43,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:48:43,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:48:43,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:48:43" (1/1) ... [2024-10-13 23:48:43,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:48:43" (1/1) ... [2024-10-13 23:48:43,231 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-10-13 23:48:43,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:48:43,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:48:43,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:48:43,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:48:43,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:48:43" (1/1) ... [2024-10-13 23:48:43,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:48:43" (1/1) ... [2024-10-13 23:48:43,259 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:48:43" (1/1) ... [2024-10-13 23:48:43,341 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 23:48:43,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:48:43" (1/1) ... [2024-10-13 23:48:43,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:48:43" (1/1) ... [2024-10-13 23:48:43,399 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:48:43" (1/1) ... [2024-10-13 23:48:43,410 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:48:43" (1/1) ... [2024-10-13 23:48:43,435 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:48:43" (1/1) ... [2024-10-13 23:48:43,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:48:43" (1/1) ... [2024-10-13 23:48:43,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:48:43,463 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:48:43,464 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:48:43,464 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:48:43,465 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:48:43" (1/1) ... [2024-10-13 23:48:43,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:48:43,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:48:43,493 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 23:48:43,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 23:48:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:48:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:48:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:48:43,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:48:43,597 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:48:43,599 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:48:45,327 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-10-13 23:48:45,327 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:48:45,359 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:48:45,359 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:48:45,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:48:45 BoogieIcfgContainer [2024-10-13 23:48:45,359 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:48:45,361 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:48:45,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:48:45,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:48:45,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:48:42" (1/3) ... [2024-10-13 23:48:45,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@413955db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:48:45, skipping insertion in model container [2024-10-13 23:48:45,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:48:43" (2/3) ... [2024-10-13 23:48:45,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@413955db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:48:45, skipping insertion in model container [2024-10-13 23:48:45,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:48:45" (3/3) ... [2024-10-13 23:48:45,365 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label55.c [2024-10-13 23:48:45,377 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:48:45,377 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:48:45,445 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:48:45,449 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;@2c739921, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:48:45,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:48:45,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:45,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-13 23:48:45,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:45,459 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] [2024-10-13 23:48:45,459 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:45,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:45,463 INFO L85 PathProgramCache]: Analyzing trace with hash -538846455, now seen corresponding path program 1 times [2024-10-13 23:48:45,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:45,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838095348] [2024-10-13 23:48:45,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:45,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:45,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:48:45,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:45,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838095348] [2024-10-13 23:48:45,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838095348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:45,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:45,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:48:45,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572271651] [2024-10-13 23:48:45,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:45,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:48:45,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:45,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:48:45,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:48:45,611 INFO L87 Difference]: Start difference. First operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:45,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:45,648 INFO L93 Difference]: Finished difference Result 723 states and 1375 transitions. [2024-10-13 23:48:45,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:48:45,650 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-10-13 23:48:45,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:45,658 INFO L225 Difference]: With dead ends: 723 [2024-10-13 23:48:45,658 INFO L226 Difference]: Without dead ends: 360 [2024-10-13 23:48:45,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:48:45,663 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:45,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 623 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:48:45,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-13 23:48:45,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-10-13 23:48:45,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.7353760445682451) internal successors, (623), 359 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:45,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 623 transitions. [2024-10-13 23:48:45,702 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 623 transitions. Word has length 56 [2024-10-13 23:48:45,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:45,702 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 623 transitions. [2024-10-13 23:48:45,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:45,702 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 623 transitions. [2024-10-13 23:48:45,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-13 23:48:45,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:45,703 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] [2024-10-13 23:48:45,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:48:45,704 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:45,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:45,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1895848525, now seen corresponding path program 1 times [2024-10-13 23:48:45,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:45,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199137923] [2024-10-13 23:48:45,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:45,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:48:45,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:45,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199137923] [2024-10-13 23:48:45,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199137923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:45,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:45,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:48:45,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826880481] [2024-10-13 23:48:45,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:45,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:48:45,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:45,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:48:45,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:45,923 INFO L87 Difference]: Start difference. First operand 360 states and 623 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:47,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:47,250 INFO L93 Difference]: Finished difference Result 1025 states and 1788 transitions. [2024-10-13 23:48:47,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:48:47,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-10-13 23:48:47,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:47,254 INFO L225 Difference]: With dead ends: 1025 [2024-10-13 23:48:47,254 INFO L226 Difference]: Without dead ends: 666 [2024-10-13 23:48:47,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:47,256 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 271 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:47,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 316 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:48:47,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-10-13 23:48:47,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2024-10-13 23:48:47,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 663 states have (on average 1.4796380090497738) internal successors, (981), 663 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:47,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 981 transitions. [2024-10-13 23:48:47,277 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 981 transitions. Word has length 56 [2024-10-13 23:48:47,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:47,278 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 981 transitions. [2024-10-13 23:48:47,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:47,278 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 981 transitions. [2024-10-13 23:48:47,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 23:48:47,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:47,281 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:48:47,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:48:47,281 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:47,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:47,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1844737627, now seen corresponding path program 1 times [2024-10-13 23:48:47,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:47,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478470498] [2024-10-13 23:48:47,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:47,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:47,440 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:48:47,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:47,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478470498] [2024-10-13 23:48:47,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478470498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:47,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:47,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:48:47,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293323565] [2024-10-13 23:48:47,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:47,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:48:47,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:47,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:48:47,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:47,445 INFO L87 Difference]: Start difference. First operand 664 states and 981 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:48,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:48,871 INFO L93 Difference]: Finished difference Result 1952 states and 2892 transitions. [2024-10-13 23:48:48,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:48:48,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2024-10-13 23:48:48,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:48,876 INFO L225 Difference]: With dead ends: 1952 [2024-10-13 23:48:48,877 INFO L226 Difference]: Without dead ends: 1289 [2024-10-13 23:48:48,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:48,879 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 257 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:48,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 323 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 23:48:48,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2024-10-13 23:48:48,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1281. [2024-10-13 23:48:48,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1280 states have (on average 1.39921875) internal successors, (1791), 1280 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:48,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1791 transitions. [2024-10-13 23:48:48,909 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1791 transitions. Word has length 131 [2024-10-13 23:48:48,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:48,910 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 1791 transitions. [2024-10-13 23:48:48,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:48,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1791 transitions. [2024-10-13 23:48:48,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 23:48:48,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:48,917 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:48:48,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:48:48,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:48,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:48,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1407233071, now seen corresponding path program 1 times [2024-10-13 23:48:48,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:48,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092478686] [2024-10-13 23:48:48,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:48,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:48:49,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:49,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092478686] [2024-10-13 23:48:49,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092478686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:49,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:49,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:48:49,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852922215] [2024-10-13 23:48:49,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:49,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:48:49,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:49,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:48:49,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:49,025 INFO L87 Difference]: Start difference. First operand 1281 states and 1791 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:50,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:50,524 INFO L93 Difference]: Finished difference Result 3763 states and 5262 transitions. [2024-10-13 23:48:50,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:48:50,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2024-10-13 23:48:50,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:50,531 INFO L225 Difference]: With dead ends: 3763 [2024-10-13 23:48:50,531 INFO L226 Difference]: Without dead ends: 2483 [2024-10-13 23:48:50,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:50,535 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 236 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:50,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 364 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 23:48:50,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2024-10-13 23:48:50,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2181. [2024-10-13 23:48:50,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2180 states have (on average 1.281651376146789) internal successors, (2794), 2180 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:50,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 2794 transitions. [2024-10-13 23:48:50,574 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 2794 transitions. Word has length 135 [2024-10-13 23:48:50,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:50,574 INFO L471 AbstractCegarLoop]: Abstraction has 2181 states and 2794 transitions. [2024-10-13 23:48:50,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:50,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 2794 transitions. [2024-10-13 23:48:50,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-10-13 23:48:50,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:50,579 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:48:50,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:48:50,579 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:50,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:50,580 INFO L85 PathProgramCache]: Analyzing trace with hash -466831794, now seen corresponding path program 1 times [2024-10-13 23:48:50,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:50,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386635426] [2024-10-13 23:48:50,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:50,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:50,837 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-13 23:48:50,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:50,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386635426] [2024-10-13 23:48:50,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386635426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:50,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:50,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:48:50,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798505696] [2024-10-13 23:48:50,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:50,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:48:50,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:50,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:48:50,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:50,844 INFO L87 Difference]: Start difference. First operand 2181 states and 2794 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:51,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:51,986 INFO L93 Difference]: Finished difference Result 6165 states and 7960 transitions. [2024-10-13 23:48:51,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:48:51,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 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 226 [2024-10-13 23:48:51,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:51,995 INFO L225 Difference]: With dead ends: 6165 [2024-10-13 23:48:51,995 INFO L226 Difference]: Without dead ends: 3985 [2024-10-13 23:48:51,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:51,997 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:51,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 337 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 23:48:52,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2024-10-13 23:48:52,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 3681. [2024-10-13 23:48:52,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 3680 states have (on average 1.2201086956521738) internal successors, (4490), 3680 states have internal predecessors, (4490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:52,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 4490 transitions. [2024-10-13 23:48:52,036 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 4490 transitions. Word has length 226 [2024-10-13 23:48:52,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:52,037 INFO L471 AbstractCegarLoop]: Abstraction has 3681 states and 4490 transitions. [2024-10-13 23:48:52,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:52,037 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 4490 transitions. [2024-10-13 23:48:52,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-10-13 23:48:52,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:52,040 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, 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] [2024-10-13 23:48:52,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:48:52,040 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:52,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:52,041 INFO L85 PathProgramCache]: Analyzing trace with hash -231589722, now seen corresponding path program 1 times [2024-10-13 23:48:52,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:52,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403168811] [2024-10-13 23:48:52,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:52,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:52,526 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-13 23:48:52,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:52,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403168811] [2024-10-13 23:48:52,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403168811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:52,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:52,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:48:52,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473912812] [2024-10-13 23:48:52,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:52,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:48:52,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:52,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:48:52,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:52,529 INFO L87 Difference]: Start difference. First operand 3681 states and 4490 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:53,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:53,551 INFO L93 Difference]: Finished difference Result 7660 states and 9290 transitions. [2024-10-13 23:48:53,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:48:53,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 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 328 [2024-10-13 23:48:53,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:53,560 INFO L225 Difference]: With dead ends: 7660 [2024-10-13 23:48:53,560 INFO L226 Difference]: Without dead ends: 3980 [2024-10-13 23:48:53,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:53,564 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:53,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 357 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 23:48:53,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3980 states. [2024-10-13 23:48:53,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3980 to 3980. [2024-10-13 23:48:53,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3980 states, 3979 states have (on average 1.2050766524252325) internal successors, (4795), 3979 states have internal predecessors, (4795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:53,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 4795 transitions. [2024-10-13 23:48:53,608 INFO L78 Accepts]: Start accepts. Automaton has 3980 states and 4795 transitions. Word has length 328 [2024-10-13 23:48:53,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:53,608 INFO L471 AbstractCegarLoop]: Abstraction has 3980 states and 4795 transitions. [2024-10-13 23:48:53,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:53,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3980 states and 4795 transitions. [2024-10-13 23:48:53,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2024-10-13 23:48:53,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:53,612 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:48:53,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 23:48:53,612 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:53,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:53,612 INFO L85 PathProgramCache]: Analyzing trace with hash 930880867, now seen corresponding path program 1 times [2024-10-13 23:48:53,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:53,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858712534] [2024-10-13 23:48:53,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:53,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:53,900 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-13 23:48:53,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:53,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858712534] [2024-10-13 23:48:53,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858712534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:53,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:53,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:48:53,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744429239] [2024-10-13 23:48:53,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:53,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:48:53,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:53,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:48:53,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:53,903 INFO L87 Difference]: Start difference. First operand 3980 states and 4795 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:55,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:55,237 INFO L93 Difference]: Finished difference Result 9464 states and 11673 transitions. [2024-10-13 23:48:55,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:48:55,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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 343 [2024-10-13 23:48:55,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:55,251 INFO L225 Difference]: With dead ends: 9464 [2024-10-13 23:48:55,251 INFO L226 Difference]: Without dead ends: 5784 [2024-10-13 23:48:55,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:55,255 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 259 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:55,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 668 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:48:55,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5784 states. [2024-10-13 23:48:55,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5784 to 5782. [2024-10-13 23:48:55,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5782 states, 5781 states have (on average 1.167618059159315) internal successors, (6750), 5781 states have internal predecessors, (6750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:55,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5782 states to 5782 states and 6750 transitions. [2024-10-13 23:48:55,336 INFO L78 Accepts]: Start accepts. Automaton has 5782 states and 6750 transitions. Word has length 343 [2024-10-13 23:48:55,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:55,336 INFO L471 AbstractCegarLoop]: Abstraction has 5782 states and 6750 transitions. [2024-10-13 23:48:55,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:55,337 INFO L276 IsEmpty]: Start isEmpty. Operand 5782 states and 6750 transitions. [2024-10-13 23:48:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2024-10-13 23:48:55,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:55,343 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:48:55,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:48:55,343 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:55,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:55,344 INFO L85 PathProgramCache]: Analyzing trace with hash 166050900, now seen corresponding path program 1 times [2024-10-13 23:48:55,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:55,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28689996] [2024-10-13 23:48:55,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:55,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:55,658 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-13 23:48:55,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:55,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28689996] [2024-10-13 23:48:55,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28689996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:55,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:55,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:48:55,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372923089] [2024-10-13 23:48:55,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:55,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:48:55,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:55,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:48:55,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:55,661 INFO L87 Difference]: Start difference. First operand 5782 states and 6750 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:56,880 INFO L93 Difference]: Finished difference Result 13363 states and 15909 transitions. [2024-10-13 23:48:56,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:48:56,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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 402 [2024-10-13 23:48:56,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:56,896 INFO L225 Difference]: With dead ends: 13363 [2024-10-13 23:48:56,897 INFO L226 Difference]: Without dead ends: 7881 [2024-10-13 23:48:56,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:56,902 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 270 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:56,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 632 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 23:48:56,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7881 states. [2024-10-13 23:48:56,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7881 to 7283. [2024-10-13 23:48:56,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7283 states, 7282 states have (on average 1.148722878330129) internal successors, (8365), 7282 states have internal predecessors, (8365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:56,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7283 states to 7283 states and 8365 transitions. [2024-10-13 23:48:56,976 INFO L78 Accepts]: Start accepts. Automaton has 7283 states and 8365 transitions. Word has length 402 [2024-10-13 23:48:56,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:56,976 INFO L471 AbstractCegarLoop]: Abstraction has 7283 states and 8365 transitions. [2024-10-13 23:48:56,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:56,977 INFO L276 IsEmpty]: Start isEmpty. Operand 7283 states and 8365 transitions. [2024-10-13 23:48:56,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2024-10-13 23:48:56,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:56,981 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:48:56,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:48:56,981 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:56,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:56,982 INFO L85 PathProgramCache]: Analyzing trace with hash 551207121, now seen corresponding path program 1 times [2024-10-13 23:48:56,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:56,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505380719] [2024-10-13 23:48:56,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:56,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:57,241 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-13 23:48:57,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:57,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505380719] [2024-10-13 23:48:57,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505380719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:57,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:57,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:48:57,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958670155] [2024-10-13 23:48:57,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:57,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:48:57,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:57,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:48:57,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:57,243 INFO L87 Difference]: Start difference. First operand 7283 states and 8365 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:58,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:48:58,452 INFO L93 Difference]: Finished difference Result 16068 states and 18813 transitions. [2024-10-13 23:48:58,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:48:58,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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 417 [2024-10-13 23:48:58,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:48:58,472 INFO L225 Difference]: With dead ends: 16068 [2024-10-13 23:48:58,473 INFO L226 Difference]: Without dead ends: 9085 [2024-10-13 23:48:58,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:58,479 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 272 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:48:58,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 620 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 23:48:58,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9085 states. [2024-10-13 23:48:58,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9085 to 8480. [2024-10-13 23:48:58,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8480 states, 8479 states have (on average 1.1379879702795141) internal successors, (9649), 8479 states have internal predecessors, (9649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:58,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8480 states to 8480 states and 9649 transitions. [2024-10-13 23:48:58,564 INFO L78 Accepts]: Start accepts. Automaton has 8480 states and 9649 transitions. Word has length 417 [2024-10-13 23:48:58,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:48:58,565 INFO L471 AbstractCegarLoop]: Abstraction has 8480 states and 9649 transitions. [2024-10-13 23:48:58,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:48:58,565 INFO L276 IsEmpty]: Start isEmpty. Operand 8480 states and 9649 transitions. [2024-10-13 23:48:58,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2024-10-13 23:48:58,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:48:58,572 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-13 23:48:58,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:48:58,572 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:48:58,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:48:58,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1394195355, now seen corresponding path program 1 times [2024-10-13 23:48:58,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:48:58,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773584585] [2024-10-13 23:48:58,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:48:58,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:48:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:48:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 363 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-10-13 23:48:58,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:48:58,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773584585] [2024-10-13 23:48:58,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773584585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:48:58,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:48:58,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:48:58,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56130748] [2024-10-13 23:48:58,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:48:58,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:48:58,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:48:58,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:48:58,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:48:58,769 INFO L87 Difference]: Start difference. First operand 8480 states and 9649 transitions. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:49:00,090 INFO L93 Difference]: Finished difference Result 19650 states and 22542 transitions. [2024-10-13 23:49:00,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:49:00,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 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 507 [2024-10-13 23:49:00,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:49:00,106 INFO L225 Difference]: With dead ends: 19650 [2024-10-13 23:49:00,106 INFO L226 Difference]: Without dead ends: 11470 [2024-10-13 23:49:00,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:49:00,114 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 147 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:49:00,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 313 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:49:00,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11470 states. [2024-10-13 23:49:00,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11470 to 7577. [2024-10-13 23:49:00,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7577 states, 7576 states have (on average 1.1486272439281944) internal successors, (8702), 7576 states have internal predecessors, (8702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:00,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7577 states to 7577 states and 8702 transitions. [2024-10-13 23:49:00,196 INFO L78 Accepts]: Start accepts. Automaton has 7577 states and 8702 transitions. Word has length 507 [2024-10-13 23:49:00,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:49:00,197 INFO L471 AbstractCegarLoop]: Abstraction has 7577 states and 8702 transitions. [2024-10-13 23:49:00,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:00,198 INFO L276 IsEmpty]: Start isEmpty. Operand 7577 states and 8702 transitions. [2024-10-13 23:49:00,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2024-10-13 23:49:00,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:49:00,201 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:49:00,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:49:00,201 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:49:00,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:49:00,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1426770604, now seen corresponding path program 1 times [2024-10-13 23:49:00,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:49:00,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497162031] [2024-10-13 23:49:00,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:49:00,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:49:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:49:00,785 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 519 proven. 39 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2024-10-13 23:49:00,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:49:00,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497162031] [2024-10-13 23:49:00,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497162031] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:49:00,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283650412] [2024-10-13 23:49:00,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:49:00,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:49:00,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:49:00,790 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:49:00,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 23:49:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:49:00,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:49:00,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:49:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2024-10-13 23:49:01,080 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:49:01,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283650412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:49:01,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:49:01,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 23:49:01,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641306582] [2024-10-13 23:49:01,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:49:01,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:49:01,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:49:01,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:49:01,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:49:01,081 INFO L87 Difference]: Start difference. First operand 7577 states and 8702 transitions. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:49:02,180 INFO L93 Difference]: Finished difference Result 17245 states and 20054 transitions. [2024-10-13 23:49:02,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:49:02,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 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 540 [2024-10-13 23:49:02,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:49:02,192 INFO L225 Difference]: With dead ends: 17245 [2024-10-13 23:49:02,193 INFO L226 Difference]: Without dead ends: 9968 [2024-10-13 23:49:02,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 539 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-10-13 23:49:02,200 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 360 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:49:02,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 444 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 23:49:02,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9968 states. [2024-10-13 23:49:02,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9968 to 9968. [2024-10-13 23:49:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9968 states, 9967 states have (on average 1.1499949834453698) internal successors, (11462), 9967 states have internal predecessors, (11462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:02,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9968 states to 9968 states and 11462 transitions. [2024-10-13 23:49:02,346 INFO L78 Accepts]: Start accepts. Automaton has 9968 states and 11462 transitions. Word has length 540 [2024-10-13 23:49:02,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:49:02,347 INFO L471 AbstractCegarLoop]: Abstraction has 9968 states and 11462 transitions. [2024-10-13 23:49:02,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:02,347 INFO L276 IsEmpty]: Start isEmpty. Operand 9968 states and 11462 transitions. [2024-10-13 23:49:02,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2024-10-13 23:49:02,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:49:02,351 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:49:02,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 23:49:02,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-13 23:49:02,552 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:49:02,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:49:02,552 INFO L85 PathProgramCache]: Analyzing trace with hash 330961334, now seen corresponding path program 1 times [2024-10-13 23:49:02,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:49:02,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183644883] [2024-10-13 23:49:02,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:49:02,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:49:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:49:02,899 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-10-13 23:49:02,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:49:02,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183644883] [2024-10-13 23:49:02,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183644883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:49:02,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:49:02,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:49:02,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371285950] [2024-10-13 23:49:02,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:49:02,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:49:02,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:49:02,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:49:02,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:49:02,900 INFO L87 Difference]: Start difference. First operand 9968 states and 11462 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:04,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:49:04,215 INFO L93 Difference]: Finished difference Result 24135 states and 28001 transitions. [2024-10-13 23:49:04,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:49:04,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 544 [2024-10-13 23:49:04,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:49:04,235 INFO L225 Difference]: With dead ends: 24135 [2024-10-13 23:49:04,235 INFO L226 Difference]: Without dead ends: 14467 [2024-10-13 23:49:04,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:49:04,244 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 246 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:49:04,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 618 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 23:49:04,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14467 states. [2024-10-13 23:49:04,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14467 to 14157. [2024-10-13 23:49:04,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14157 states, 14156 states have (on average 1.13485447866629) internal successors, (16065), 14156 states have internal predecessors, (16065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14157 states to 14157 states and 16065 transitions. [2024-10-13 23:49:04,375 INFO L78 Accepts]: Start accepts. Automaton has 14157 states and 16065 transitions. Word has length 544 [2024-10-13 23:49:04,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:49:04,375 INFO L471 AbstractCegarLoop]: Abstraction has 14157 states and 16065 transitions. [2024-10-13 23:49:04,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:04,376 INFO L276 IsEmpty]: Start isEmpty. Operand 14157 states and 16065 transitions. [2024-10-13 23:49:04,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2024-10-13 23:49:04,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:49:04,382 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:49:04,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 23:49:04,382 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:49:04,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:49:04,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1250369046, now seen corresponding path program 1 times [2024-10-13 23:49:04,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:49:04,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147706976] [2024-10-13 23:49:04,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:49:04,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:49:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:49:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 676 proven. 39 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2024-10-13 23:49:04,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:49:04,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147706976] [2024-10-13 23:49:04,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147706976] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:49:04,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805805462] [2024-10-13 23:49:04,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:49:04,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:49:04,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:49:04,943 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:49:04,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 23:49:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:49:05,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:49:05,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:49:05,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 585 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2024-10-13 23:49:05,248 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:49:05,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805805462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:49:05,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:49:05,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 23:49:05,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328103093] [2024-10-13 23:49:05,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:49:05,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:49:05,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:49:05,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:49:05,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:49:05,251 INFO L87 Difference]: Start difference. First operand 14157 states and 16065 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:06,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:49:06,389 INFO L93 Difference]: Finished difference Result 27711 states and 31489 transitions. [2024-10-13 23:49:06,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:49:06,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 619 [2024-10-13 23:49:06,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:49:06,403 INFO L225 Difference]: With dead ends: 27711 [2024-10-13 23:49:06,403 INFO L226 Difference]: Without dead ends: 13854 [2024-10-13 23:49:06,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 618 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-10-13 23:49:06,417 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 252 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:49:06,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 601 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 23:49:06,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13854 states. [2024-10-13 23:49:06,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13854 to 13853. [2024-10-13 23:49:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13853 states, 13852 states have (on average 1.081648859370488) internal successors, (14983), 13852 states have internal predecessors, (14983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:06,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13853 states to 13853 states and 14983 transitions. [2024-10-13 23:49:06,644 INFO L78 Accepts]: Start accepts. Automaton has 13853 states and 14983 transitions. Word has length 619 [2024-10-13 23:49:06,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:49:06,645 INFO L471 AbstractCegarLoop]: Abstraction has 13853 states and 14983 transitions. [2024-10-13 23:49:06,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:06,645 INFO L276 IsEmpty]: Start isEmpty. Operand 13853 states and 14983 transitions. [2024-10-13 23:49:06,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2024-10-13 23:49:06,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:49:06,656 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:49:06,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 23:49:06,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-13 23:49:06,858 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:49:06,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:49:06,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1789458965, now seen corresponding path program 1 times [2024-10-13 23:49:06,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:49:06,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868652362] [2024-10-13 23:49:06,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:49:06,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:49:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:49:07,525 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 603 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-10-13 23:49:07,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:49:07,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868652362] [2024-10-13 23:49:07,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868652362] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:49:07,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753966878] [2024-10-13 23:49:07,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:49:07,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:49:07,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:49:07,530 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:49:07,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 23:49:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:49:07,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 23:49:07,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:49:08,442 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-10-13 23:49:08,442 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:49:08,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753966878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:49:08,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:49:08,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 23:49:08,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391178961] [2024-10-13 23:49:08,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:49:08,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:49:08,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:49:08,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:49:08,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:49:08,444 INFO L87 Difference]: Start difference. First operand 13853 states and 14983 transitions. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:09,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:49:09,924 INFO L93 Difference]: Finished difference Result 28903 states and 31297 transitions. [2024-10-13 23:49:09,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:49:09,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 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 620 [2024-10-13 23:49:09,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:49:09,940 INFO L225 Difference]: With dead ends: 28903 [2024-10-13 23:49:09,940 INFO L226 Difference]: Without dead ends: 15051 [2024-10-13 23:49:09,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 618 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:49:09,950 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 317 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:49:09,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 355 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 23:49:09,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15051 states. [2024-10-13 23:49:10,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15051 to 14751. [2024-10-13 23:49:10,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14751 states, 14750 states have (on average 1.079728813559322) internal successors, (15926), 14750 states have internal predecessors, (15926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:10,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14751 states to 14751 states and 15926 transitions. [2024-10-13 23:49:10,067 INFO L78 Accepts]: Start accepts. Automaton has 14751 states and 15926 transitions. Word has length 620 [2024-10-13 23:49:10,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:49:10,067 INFO L471 AbstractCegarLoop]: Abstraction has 14751 states and 15926 transitions. [2024-10-13 23:49:10,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:10,068 INFO L276 IsEmpty]: Start isEmpty. Operand 14751 states and 15926 transitions. [2024-10-13 23:49:10,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2024-10-13 23:49:10,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:49:10,075 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-13 23:49:10,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 23:49:10,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:49:10,277 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:49:10,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:49:10,277 INFO L85 PathProgramCache]: Analyzing trace with hash -350607262, now seen corresponding path program 1 times [2024-10-13 23:49:10,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:49:10,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260082129] [2024-10-13 23:49:10,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:49:10,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:49:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:49:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-10-13 23:49:10,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:49:10,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260082129] [2024-10-13 23:49:10,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260082129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:49:10,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:49:10,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:49:10,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307139903] [2024-10-13 23:49:10,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:49:10,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:49:10,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:49:10,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:49:10,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:49:10,579 INFO L87 Difference]: Start difference. First operand 14751 states and 15926 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:12,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:49:12,018 INFO L93 Difference]: Finished difference Result 37569 states and 40550 transitions. [2024-10-13 23:49:12,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:49:12,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 657 [2024-10-13 23:49:12,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:49:12,036 INFO L225 Difference]: With dead ends: 37569 [2024-10-13 23:49:12,036 INFO L226 Difference]: Without dead ends: 18932 [2024-10-13 23:49:12,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:49:12,047 INFO L432 NwaCegarLoop]: 605 mSDtfsCounter, 259 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:49:12,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 643 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:49:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18932 states. [2024-10-13 23:49:12,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18932 to 17138. [2024-10-13 23:49:12,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17138 states, 17137 states have (on average 1.0516426445702283) internal successors, (18022), 17137 states have internal predecessors, (18022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:12,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17138 states to 17138 states and 18022 transitions. [2024-10-13 23:49:12,196 INFO L78 Accepts]: Start accepts. Automaton has 17138 states and 18022 transitions. Word has length 657 [2024-10-13 23:49:12,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:49:12,196 INFO L471 AbstractCegarLoop]: Abstraction has 17138 states and 18022 transitions. [2024-10-13 23:49:12,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:12,196 INFO L276 IsEmpty]: Start isEmpty. Operand 17138 states and 18022 transitions. [2024-10-13 23:49:12,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 682 [2024-10-13 23:49:12,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:49:12,204 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-13 23:49:12,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 23:49:12,204 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:49:12,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:49:12,205 INFO L85 PathProgramCache]: Analyzing trace with hash 36797954, now seen corresponding path program 1 times [2024-10-13 23:49:12,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:49:12,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607662728] [2024-10-13 23:49:12,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:49:12,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:49:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:49:12,504 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2024-10-13 23:49:12,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:49:12,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607662728] [2024-10-13 23:49:12,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607662728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:49:12,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:49:12,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:49:12,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130301699] [2024-10-13 23:49:12,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:49:12,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:49:12,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:49:12,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:49:12,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:49:12,505 INFO L87 Difference]: Start difference. First operand 17138 states and 18022 transitions. Second operand has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:14,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:49:14,561 INFO L93 Difference]: Finished difference Result 44740 states and 47075 transitions. [2024-10-13 23:49:14,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:49:14,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 681 [2024-10-13 23:49:14,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:49:14,582 INFO L225 Difference]: With dead ends: 44740 [2024-10-13 23:49:14,582 INFO L226 Difference]: Without dead ends: 21623 [2024-10-13 23:49:14,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:49:14,595 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 692 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 1990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:49:14,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 449 Invalid, 1990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 23:49:14,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21623 states. [2024-10-13 23:49:14,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21623 to 18633. [2024-10-13 23:49:14,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18633 states, 18632 states have (on average 1.0338127951910692) internal successors, (19262), 18632 states have internal predecessors, (19262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:14,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18633 states to 18633 states and 19262 transitions. [2024-10-13 23:49:14,751 INFO L78 Accepts]: Start accepts. Automaton has 18633 states and 19262 transitions. Word has length 681 [2024-10-13 23:49:14,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:49:14,751 INFO L471 AbstractCegarLoop]: Abstraction has 18633 states and 19262 transitions. [2024-10-13 23:49:14,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:14,751 INFO L276 IsEmpty]: Start isEmpty. Operand 18633 states and 19262 transitions. [2024-10-13 23:49:14,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 713 [2024-10-13 23:49:14,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:49:14,760 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:49:14,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 23:49:14,760 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:49:14,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:49:14,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1315884154, now seen corresponding path program 1 times [2024-10-13 23:49:14,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:49:14,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090160253] [2024-10-13 23:49:14,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:49:14,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:49:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:49:15,003 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 547 proven. 0 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2024-10-13 23:49:15,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:49:15,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090160253] [2024-10-13 23:49:15,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090160253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:49:15,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:49:15,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:49:15,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66237674] [2024-10-13 23:49:15,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:49:15,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:49:15,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:49:15,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:49:15,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:49:15,006 INFO L87 Difference]: Start difference. First operand 18633 states and 19262 transitions. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:15,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:49:15,784 INFO L93 Difference]: Finished difference Result 37561 states and 38830 transitions. [2024-10-13 23:49:15,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:49:15,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 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 712 [2024-10-13 23:49:15,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:49:15,802 INFO L225 Difference]: With dead ends: 37561 [2024-10-13 23:49:15,802 INFO L226 Difference]: Without dead ends: 18929 [2024-10-13 23:49:15,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:49:15,815 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 460 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:49:15,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 65 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:49:15,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18929 states. [2024-10-13 23:49:16,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18929 to 18629. [2024-10-13 23:49:16,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18629 states, 18628 states have (on average 1.033659007945029) internal successors, (19255), 18628 states have internal predecessors, (19255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:16,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18629 states to 18629 states and 19255 transitions. [2024-10-13 23:49:16,066 INFO L78 Accepts]: Start accepts. Automaton has 18629 states and 19255 transitions. Word has length 712 [2024-10-13 23:49:16,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:49:16,066 INFO L471 AbstractCegarLoop]: Abstraction has 18629 states and 19255 transitions. [2024-10-13 23:49:16,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:16,066 INFO L276 IsEmpty]: Start isEmpty. Operand 18629 states and 19255 transitions. [2024-10-13 23:49:16,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 784 [2024-10-13 23:49:16,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:49:16,083 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, 5, 5, 5, 5, 5, 5, 5, 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] [2024-10-13 23:49:16,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 23:49:16,083 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:49:16,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:49:16,084 INFO L85 PathProgramCache]: Analyzing trace with hash 847063737, now seen corresponding path program 1 times [2024-10-13 23:49:16,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:49:16,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309407182] [2024-10-13 23:49:16,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:49:16,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:49:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:49:16,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 728 proven. 0 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2024-10-13 23:49:16,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:49:16,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309407182] [2024-10-13 23:49:16,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309407182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:49:16,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:49:16,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:49:16,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364941569] [2024-10-13 23:49:16,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:49:16,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:49:16,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:49:16,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:49:16,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:49:16,555 INFO L87 Difference]: Start difference. First operand 18629 states and 19255 transitions. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:17,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:49:17,336 INFO L93 Difference]: Finished difference Result 39945 states and 41308 transitions. [2024-10-13 23:49:17,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:49:17,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 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 783 [2024-10-13 23:49:17,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:49:17,355 INFO L225 Difference]: With dead ends: 39945 [2024-10-13 23:49:17,355 INFO L226 Difference]: Without dead ends: 21317 [2024-10-13 23:49:17,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:49:17,367 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 183 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:49:17,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 165 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:49:17,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21317 states. [2024-10-13 23:49:17,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21317 to 19822. [2024-10-13 23:49:17,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19822 states, 19821 states have (on average 1.03112860097876) internal successors, (20438), 19821 states have internal predecessors, (20438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:17,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19822 states to 19822 states and 20438 transitions. [2024-10-13 23:49:17,522 INFO L78 Accepts]: Start accepts. Automaton has 19822 states and 20438 transitions. Word has length 783 [2024-10-13 23:49:17,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:49:17,522 INFO L471 AbstractCegarLoop]: Abstraction has 19822 states and 20438 transitions. [2024-10-13 23:49:17,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:17,523 INFO L276 IsEmpty]: Start isEmpty. Operand 19822 states and 20438 transitions. [2024-10-13 23:49:17,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 805 [2024-10-13 23:49:17,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:49:17,533 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:49:17,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 23:49:17,533 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:49:17,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:49:17,534 INFO L85 PathProgramCache]: Analyzing trace with hash -619475680, now seen corresponding path program 1 times [2024-10-13 23:49:17,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:49:17,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088389153] [2024-10-13 23:49:17,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:49:17,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:49:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:49:17,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 749 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2024-10-13 23:49:17,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:49:17,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088389153] [2024-10-13 23:49:17,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088389153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:49:17,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:49:17,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:49:17,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71491147] [2024-10-13 23:49:17,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:49:17,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:49:17,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:49:17,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:49:17,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:49:17,845 INFO L87 Difference]: Start difference. First operand 19822 states and 20438 transitions. Second operand has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:18,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:49:18,670 INFO L93 Difference]: Finished difference Result 42032 states and 43365 transitions. [2024-10-13 23:49:18,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:49:18,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 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 804 [2024-10-13 23:49:18,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:49:18,688 INFO L225 Difference]: With dead ends: 42032 [2024-10-13 23:49:18,688 INFO L226 Difference]: Without dead ends: 21912 [2024-10-13 23:49:18,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:49:18,699 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 163 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:49:18,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 483 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:49:18,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21912 states. [2024-10-13 23:49:18,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21912 to 18021. [2024-10-13 23:49:18,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18021 states, 18020 states have (on average 1.0299112097669256) internal successors, (18559), 18020 states have internal predecessors, (18559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:18,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18021 states to 18021 states and 18559 transitions. [2024-10-13 23:49:18,837 INFO L78 Accepts]: Start accepts. Automaton has 18021 states and 18559 transitions. Word has length 804 [2024-10-13 23:49:18,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:49:18,837 INFO L471 AbstractCegarLoop]: Abstraction has 18021 states and 18559 transitions. [2024-10-13 23:49:18,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:18,837 INFO L276 IsEmpty]: Start isEmpty. Operand 18021 states and 18559 transitions. [2024-10-13 23:49:18,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2024-10-13 23:49:18,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:49:18,847 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-10-13 23:49:18,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 23:49:18,847 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:49:18,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:49:18,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1274054762, now seen corresponding path program 1 times [2024-10-13 23:49:18,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:49:18,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293622673] [2024-10-13 23:49:18,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:49:18,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:49:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:49:19,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2024-10-13 23:49:19,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:49:19,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293622673] [2024-10-13 23:49:19,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293622673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:49:19,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:49:19,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:49:19,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674534782] [2024-10-13 23:49:19,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:49:19,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:49:19,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:49:19,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:49:19,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:49:19,146 INFO L87 Difference]: Start difference. First operand 18021 states and 18559 transitions. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:19,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:49:19,965 INFO L93 Difference]: Finished difference Result 37834 states and 38974 transitions. [2024-10-13 23:49:19,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:49:19,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 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 841 [2024-10-13 23:49:19,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:49:19,983 INFO L225 Difference]: With dead ends: 37834 [2024-10-13 23:49:19,983 INFO L226 Difference]: Without dead ends: 19814 [2024-10-13 23:49:19,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:49:19,994 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 310 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:49:19,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 527 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:49:20,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19814 states. [2024-10-13 23:49:20,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19814 to 18618. [2024-10-13 23:49:20,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18618 states, 18617 states have (on average 1.0289520330880377) internal successors, (19156), 18617 states have internal predecessors, (19156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18618 states to 18618 states and 19156 transitions. [2024-10-13 23:49:20,286 INFO L78 Accepts]: Start accepts. Automaton has 18618 states and 19156 transitions. Word has length 841 [2024-10-13 23:49:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:49:20,286 INFO L471 AbstractCegarLoop]: Abstraction has 18618 states and 19156 transitions. [2024-10-13 23:49:20,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:20,286 INFO L276 IsEmpty]: Start isEmpty. Operand 18618 states and 19156 transitions. [2024-10-13 23:49:20,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 863 [2024-10-13 23:49:20,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:49:20,294 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-10-13 23:49:20,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 23:49:20,294 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:49:20,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:49:20,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1721338048, now seen corresponding path program 1 times [2024-10-13 23:49:20,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:49:20,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893787931] [2024-10-13 23:49:20,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:49:20,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:49:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:49:21,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 629 proven. 269 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2024-10-13 23:49:21,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:49:21,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893787931] [2024-10-13 23:49:21,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893787931] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:49:21,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206228522] [2024-10-13 23:49:21,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:49:21,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:49:21,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:49:21,367 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:49:21,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 23:49:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:49:21,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 23:49:21,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:49:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2024-10-13 23:49:21,694 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:49:21,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206228522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:49:21,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:49:21,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 23:49:21,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147238001] [2024-10-13 23:49:21,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:49:21,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:49:21,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:49:21,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:49:21,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:49:21,696 INFO L87 Difference]: Start difference. First operand 18618 states and 19156 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:49:22,692 INFO L93 Difference]: Finished difference Result 41435 states and 42633 transitions. [2024-10-13 23:49:22,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:49:22,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 862 [2024-10-13 23:49:22,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:49:22,709 INFO L225 Difference]: With dead ends: 41435 [2024-10-13 23:49:22,710 INFO L226 Difference]: Without dead ends: 22519 [2024-10-13 23:49:22,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 865 GetRequests, 861 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-10-13 23:49:22,721 INFO L432 NwaCegarLoop]: 476 mSDtfsCounter, 271 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:49:22,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 505 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 23:49:22,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22519 states. [2024-10-13 23:49:22,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22519 to 20416. [2024-10-13 23:49:22,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20416 states, 20415 states have (on average 1.0293411707078128) internal successors, (21014), 20415 states have internal predecessors, (21014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:22,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20416 states to 20416 states and 21014 transitions. [2024-10-13 23:49:22,946 INFO L78 Accepts]: Start accepts. Automaton has 20416 states and 21014 transitions. Word has length 862 [2024-10-13 23:49:22,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:49:22,947 INFO L471 AbstractCegarLoop]: Abstraction has 20416 states and 21014 transitions. [2024-10-13 23:49:22,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:22,947 INFO L276 IsEmpty]: Start isEmpty. Operand 20416 states and 21014 transitions. [2024-10-13 23:49:22,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 900 [2024-10-13 23:49:22,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:49:22,963 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-10-13 23:49:22,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 23:49:23,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:49:23,164 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:49:23,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:49:23,165 INFO L85 PathProgramCache]: Analyzing trace with hash -915942911, now seen corresponding path program 1 times [2024-10-13 23:49:23,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:49:23,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103892710] [2024-10-13 23:49:23,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:49:23,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:49:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:49:24,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 703 proven. 269 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2024-10-13 23:49:24,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:49:24,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103892710] [2024-10-13 23:49:24,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103892710] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:49:24,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778779502] [2024-10-13 23:49:24,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:49:24,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:49:24,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:49:24,553 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:49:24,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 23:49:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:49:24,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:49:24,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:49:31,551 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-10-13 23:49:31,558 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-10-13 23:49:31,565 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-10-13 23:49:31,698 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-10-13 23:49:31,891 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-10-13 23:49:32,018 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-10-13 23:49:32,023 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-10-13 23:49:32,030 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-10-13 23:49:32,116 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-10-13 23:49:33,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-10-13 23:49:33,145 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:49:33,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778779502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:49:33,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:49:33,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 23:49:33,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17694129] [2024-10-13 23:49:33,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:49:33,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:49:33,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:49:33,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:49:33,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:49:33,147 INFO L87 Difference]: Start difference. First operand 20416 states and 21014 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:34,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:49:34,099 INFO L93 Difference]: Finished difference Result 46231 states and 47564 transitions. [2024-10-13 23:49:34,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:49:34,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 899 [2024-10-13 23:49:34,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:49:34,102 INFO L225 Difference]: With dead ends: 46231 [2024-10-13 23:49:34,102 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 23:49:34,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 902 GetRequests, 898 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:49:34,118 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 297 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:49:34,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 408 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 23:49:34,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 23:49:34,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 23:49:34,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 23:49:34,120 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 899 [2024-10-13 23:49:34,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:49:34,120 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 23:49:34,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:49:34,121 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 23:49:34,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 23:49:34,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 23:49:34,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 23:49:34,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-13 23:49:34,336 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:49:34,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 23:49:37,548 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 23:49:37,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 11:49:37 BoogieIcfgContainer [2024-10-13 23:49:37,565 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 23:49:37,566 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 23:49:37,566 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 23:49:37,566 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 23:49:37,566 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:48:45" (3/4) ... [2024-10-13 23:49:37,567 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 23:49:37,584 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-13 23:49:37,586 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 23:49:37,587 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 23:49:37,588 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 23:49:37,728 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 23:49:37,728 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 23:49:37,729 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 23:49:37,729 INFO L158 Benchmark]: Toolchain (without parser) took 55446.43ms. Allocated memory was 157.3MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 82.0MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 502.9MB. Max. memory is 16.1GB. [2024-10-13 23:49:37,729 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 157.3MB. Free memory is still 111.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 23:49:37,729 INFO L158 Benchmark]: CACSL2BoogieTranslator took 732.76ms. Allocated memory is still 157.3MB. Free memory was 81.8MB in the beginning and 54.5MB in the end (delta: 27.3MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2024-10-13 23:49:37,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 213.37ms. Allocated memory was 157.3MB in the beginning and 241.2MB in the end (delta: 83.9MB). Free memory was 54.5MB in the beginning and 171.6MB in the end (delta: -117.2MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2024-10-13 23:49:37,730 INFO L158 Benchmark]: Boogie Preprocessor took 230.02ms. Allocated memory is still 241.2MB. Free memory was 171.6MB in the beginning and 113.9MB in the end (delta: 57.7MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-10-13 23:49:37,730 INFO L158 Benchmark]: RCFGBuilder took 1896.08ms. Allocated memory was 241.2MB in the beginning and 350.2MB in the end (delta: 109.1MB). Free memory was 113.9MB in the beginning and 157.3MB in the end (delta: -43.3MB). Peak memory consumption was 76.2MB. Max. memory is 16.1GB. [2024-10-13 23:49:37,731 INFO L158 Benchmark]: TraceAbstraction took 52204.37ms. Allocated memory was 350.2MB in the beginning and 2.6GB in the end (delta: 2.3GB). Free memory was 156.2MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-10-13 23:49:37,731 INFO L158 Benchmark]: Witness Printer took 163.00ms. Allocated memory is still 2.6GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-13 23:49:37,732 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 157.3MB. Free memory is still 111.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 732.76ms. Allocated memory is still 157.3MB. Free memory was 81.8MB in the beginning and 54.5MB in the end (delta: 27.3MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 213.37ms. Allocated memory was 157.3MB in the beginning and 241.2MB in the end (delta: 83.9MB). Free memory was 54.5MB in the beginning and 171.6MB in the end (delta: -117.2MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 230.02ms. Allocated memory is still 241.2MB. Free memory was 171.6MB in the beginning and 113.9MB in the end (delta: 57.7MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1896.08ms. Allocated memory was 241.2MB in the beginning and 350.2MB in the end (delta: 109.1MB). Free memory was 113.9MB in the beginning and 157.3MB in the end (delta: -43.3MB). Peak memory consumption was 76.2MB. Max. memory is 16.1GB. * TraceAbstraction took 52204.37ms. Allocated memory was 350.2MB in the beginning and 2.6GB in the end (delta: 2.3GB). Free memory was 156.2MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 163.00ms. Allocated memory is still 2.6GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 188]: 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, 362 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.9s, OverallIterations: 22, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 25.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5884 SdHoareTripleChecker+Valid, 23.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5884 mSDsluCounter, 9816 SdHoareTripleChecker+Invalid, 20.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 724 mSDsCounter, 3728 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19728 IncrementalHoareTripleChecker+Invalid, 23456 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3728 mSolverCounterUnsat, 9092 mSDtfsCounter, 19728 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3601 GetRequests, 3563 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20416occurred in iteration=21, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 20094 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 16.7s InterpolantComputationTime, 14703 NumberOfCodeBlocks, 14703 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 14676 ConstructedInterpolants, 0 QuantifiedInterpolants, 48154 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4232 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 27 InterpolantComputations, 22 PerfectInterpolantSequences, 17522/18177 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: ((((((((((((((((((((((((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a0 + 60))) && (0 <= ((long long) 41 + a29))) && (5 <= a2)) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (44 <= a29)) && (0 <= ((long long) a0 + 60)))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a0 + 60))) && (((long long) a29 + 127) <= 0))) || (((((long long) 89 + a4) <= 0) && (0 <= ((long long) 41 + a29))) && (5 <= a2))) || (((((long long) 89 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (5 <= a2))) || (((((long long) 42 + a4) <= 0) && (3 == a2)) && (((long long) a0 + 61) <= 0))) || (((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) 41 + a29))) && (((long long) a0 + 61) <= 0))) || (((((long long) 42 + a4) <= 0) && (0 <= ((long long) 41 + a29))) && (3 == a2))) || (((((long long) 42 + a4) <= 0) && (a2 == 1)) && (((long long) a29 + 127) <= 0))) || (((((long long) a0 + 105) <= 0) && (((long long) 42 + a4) <= 0)) && (5 <= a2))) || ((2 == a2) && (((long long) 89 + a4) <= 0))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) a29 + 127) <= 0))) || (((((long long) 42 + a4) <= 0) && (44 <= a29)) && (5 <= a2))) || (((((long long) 42 + a4) <= 0) && (a2 == 1)) && (8 <= a29))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (5 <= a2)) && (((long long) a0 + 61) <= 0))) || ((((a2 == 1) && (((long long) a0 + 61) <= 0)) || ((0 <= ((long long) a4 + 85)) && (a2 == 1))) && (((long long) 42 + a4) <= 0))) || (((((long long) a0 + 105) <= 0) && (((long long) 42 + a4) <= 0)) && (a2 == 4))) || (((((long long) a0 + 105) <= 0) && (2 == a2)) && (44 <= a29))) || (((((long long) 89 + a4) <= 0) && (3 == a2)) && (((long long) a29 + 127) <= 0))) || (((0 <= ((long long) 97 + a0)) && (((long long) 42 + a4) <= 0)) && (a2 == 4))) || ((((long long) 89 + a4) <= 0) && (a2 == 4))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0))) || ((((long long) 89 + a4) <= 0) && (a2 == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-13 23:49:37,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE