./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_label49.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label49.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 6eed2c2d5e428bcec2beb9a0ebe7c478639dba36839dc4adf5520912920088de --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:38:55,210 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:38:55,247 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:38:55,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:38:55,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:38:55,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:38:55,281 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:38:55,282 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:38:55,282 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:38:55,285 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:38:55,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:38:55,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:38:55,297 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:38:55,297 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:38:55,297 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:38:55,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:38:55,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:38:55,297 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:38:55,298 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:38:55,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:38:55,298 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:38:55,299 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:38:55,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:38:55,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:38:55,300 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:38:55,300 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:38:55,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:38:55,300 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:38:55,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:38:55,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:38:55,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:38:55,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:38:55,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:38:55,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:38:55,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:38:55,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:38:55,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:38:55,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:38:55,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:38:55,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:38:55,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:38:55,303 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:38:55,303 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-clean/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-clean/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 -> 6eed2c2d5e428bcec2beb9a0ebe7c478639dba36839dc4adf5520912920088de [2024-10-10 23:38:55,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:38:55,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:38:55,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:38:55,516 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:38:55,517 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:38:55,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label49.c [2024-10-10 23:38:56,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:38:56,983 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:38:56,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label49.c [2024-10-10 23:38:57,004 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b061548ac/fc6f1163e003413789e881b14b818d2f/FLAGe63a79981 [2024-10-10 23:38:57,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b061548ac/fc6f1163e003413789e881b14b818d2f [2024-10-10 23:38:57,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:38:57,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:38:57,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:38:57,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:38:57,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:38:57,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:38:57" (1/1) ... [2024-10-10 23:38:57,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ea85985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:38:57, skipping insertion in model container [2024-10-10 23:38:57,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:38:57" (1/1) ... [2024-10-10 23:38:57,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:38:57,566 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_label49.c[6430,6443] [2024-10-10 23:38:57,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:38:57,893 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:38:57,916 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_label49.c[6430,6443] [2024-10-10 23:38:58,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:38:58,093 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:38:58,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:38:58 WrapperNode [2024-10-10 23:38:58,093 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:38:58,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:38:58,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:38:58,094 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:38:58,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:38:58" (1/1) ... [2024-10-10 23:38:58,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:38:58" (1/1) ... [2024-10-10 23:38:58,257 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-10-10 23:38:58,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:38:58,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:38:58,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:38:58,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:38:58,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:38:58" (1/1) ... [2024-10-10 23:38:58,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:38:58" (1/1) ... [2024-10-10 23:38:58,296 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:38:58" (1/1) ... [2024-10-10 23:38:58,350 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-10 23:38:58,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:38:58" (1/1) ... [2024-10-10 23:38:58,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:38:58" (1/1) ... [2024-10-10 23:38:58,437 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:38:58" (1/1) ... [2024-10-10 23:38:58,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:38:58" (1/1) ... [2024-10-10 23:38:58,462 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:38:58" (1/1) ... [2024-10-10 23:38:58,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:38:58" (1/1) ... [2024-10-10 23:38:58,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:38:58,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:38:58,524 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:38:58,524 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:38:58,524 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:38:58" (1/1) ... [2024-10-10 23:38:58,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:38:58,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:38:58,552 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:38:58,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:38:58,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:38:58,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:38:58,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:38:58,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:38:58,638 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:38:58,640 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:39:00,411 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-10-10 23:39:00,411 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:39:00,467 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:39:00,470 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:39:00,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:39:00 BoogieIcfgContainer [2024-10-10 23:39:00,471 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:39:00,472 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:39:00,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:39:00,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:39:00,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:38:57" (1/3) ... [2024-10-10 23:39:00,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67306d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:39:00, skipping insertion in model container [2024-10-10 23:39:00,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:38:58" (2/3) ... [2024-10-10 23:39:00,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67306d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:39:00, skipping insertion in model container [2024-10-10 23:39:00,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:39:00" (3/3) ... [2024-10-10 23:39:00,479 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label49.c [2024-10-10 23:39:00,492 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:39:00,493 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:39:00,557 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:39:00,564 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;@20fc41ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:39:00,565 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:39:00,570 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-10 23:39:00,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-10 23:39:00,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:00,578 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] [2024-10-10 23:39:00,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:00,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:00,584 INFO L85 PathProgramCache]: Analyzing trace with hash -825206426, now seen corresponding path program 1 times [2024-10-10 23:39:00,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:00,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568226988] [2024-10-10 23:39:00,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:00,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:00,743 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-10 23:39:00,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:00,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568226988] [2024-10-10 23:39:00,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568226988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:00,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:00,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:39:00,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262871664] [2024-10-10 23:39:00,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:00,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:39:00,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:00,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:39:00,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:39:00,777 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 25.5) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 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-10 23:39:00,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:00,834 INFO L93 Difference]: Finished difference Result 723 states and 1375 transitions. [2024-10-10 23:39:00,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:39:00,838 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-10 23:39:00,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:00,848 INFO L225 Difference]: With dead ends: 723 [2024-10-10 23:39:00,848 INFO L226 Difference]: Without dead ends: 360 [2024-10-10 23:39:00,852 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-10 23:39:00,856 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-10 23:39:00,857 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-10 23:39:00,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-10 23:39:00,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-10-10 23:39:00,915 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-10 23:39:00,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 623 transitions. [2024-10-10 23:39:00,919 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 623 transitions. Word has length 51 [2024-10-10 23:39:00,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:00,919 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 623 transitions. [2024-10-10 23:39:00,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 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-10 23:39:00,921 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 623 transitions. [2024-10-10 23:39:00,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-10 23:39:00,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:00,923 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] [2024-10-10 23:39:00,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:39:00,923 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:00,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:00,924 INFO L85 PathProgramCache]: Analyzing trace with hash 827939816, now seen corresponding path program 1 times [2024-10-10 23:39:00,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:00,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238722100] [2024-10-10 23:39:00,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:00,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:01,096 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-10 23:39:01,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:01,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238722100] [2024-10-10 23:39:01,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238722100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:01,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:01,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:39:01,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199833588] [2024-10-10 23:39:01,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:01,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:01,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:01,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:01,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:39:01,100 INFO L87 Difference]: Start difference. First operand 360 states and 623 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 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-10 23:39:02,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:02,721 INFO L93 Difference]: Finished difference Result 1046 states and 1824 transitions. [2024-10-10 23:39:02,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:02,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-10 23:39:02,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:02,726 INFO L225 Difference]: With dead ends: 1046 [2024-10-10 23:39:02,728 INFO L226 Difference]: Without dead ends: 687 [2024-10-10 23:39:02,730 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-10 23:39:02,732 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 285 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:02,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 193 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:39:02,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-10-10 23:39:02,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 679. [2024-10-10 23:39:02,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 678 states have (on average 1.6106194690265487) internal successors, (1092), 678 states have internal predecessors, (1092), 0 states have call successors, (0), 0 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-10 23:39:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1092 transitions. [2024-10-10 23:39:02,757 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1092 transitions. Word has length 51 [2024-10-10 23:39:02,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:02,757 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 1092 transitions. [2024-10-10 23:39:02,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 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-10 23:39:02,757 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1092 transitions. [2024-10-10 23:39:02,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-10 23:39:02,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:02,760 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, 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-10 23:39:02,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:39:02,760 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:02,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:02,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1065031383, now seen corresponding path program 1 times [2024-10-10 23:39:02,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:02,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187768805] [2024-10-10 23:39:02,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:02,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:39:02,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:02,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187768805] [2024-10-10 23:39:02,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187768805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:02,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:02,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:39:02,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22355391] [2024-10-10 23:39:02,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:02,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:02,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:02,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:02,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:39:02,938 INFO L87 Difference]: Start difference. First operand 679 states and 1092 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:04,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:04,127 INFO L93 Difference]: Finished difference Result 1963 states and 3170 transitions. [2024-10-10 23:39:04,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:04,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2024-10-10 23:39:04,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:04,133 INFO L225 Difference]: With dead ends: 1963 [2024-10-10 23:39:04,134 INFO L226 Difference]: Without dead ends: 1285 [2024-10-10 23:39:04,134 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-10 23:39:04,136 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 282 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:04,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 358 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:39:04,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2024-10-10 23:39:04,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1280. [2024-10-10 23:39:04,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 1.3956215793588742) internal successors, (1785), 1279 states have internal predecessors, (1785), 0 states have call successors, (0), 0 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-10 23:39:04,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1785 transitions. [2024-10-10 23:39:04,170 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1785 transitions. Word has length 119 [2024-10-10 23:39:04,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:04,172 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1785 transitions. [2024-10-10 23:39:04,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:04,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1785 transitions. [2024-10-10 23:39:04,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-10 23:39:04,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:04,177 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, 1, 1, 1, 1, 1, 1, 1, 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-10 23:39:04,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:39:04,179 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:04,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:04,179 INFO L85 PathProgramCache]: Analyzing trace with hash -607771197, now seen corresponding path program 1 times [2024-10-10 23:39:04,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:04,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820960710] [2024-10-10 23:39:04,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:04,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:39:04,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:04,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820960710] [2024-10-10 23:39:04,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820960710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:04,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:04,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:39:04,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824144675] [2024-10-10 23:39:04,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:04,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:04,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:04,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:04,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:39:04,358 INFO L87 Difference]: Start difference. First operand 1280 states and 1785 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 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-10 23:39:05,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:05,566 INFO L93 Difference]: Finished difference Result 3765 states and 5245 transitions. [2024-10-10 23:39:05,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:05,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2024-10-10 23:39:05,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:05,574 INFO L225 Difference]: With dead ends: 3765 [2024-10-10 23:39:05,574 INFO L226 Difference]: Without dead ends: 2486 [2024-10-10 23:39:05,575 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-10 23:39:05,576 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 276 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:05,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 634 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:39:05,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2024-10-10 23:39:05,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2486. [2024-10-10 23:39:05,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2485 states have (on average 1.2446680080482897) internal successors, (3093), 2485 states have internal predecessors, (3093), 0 states have call successors, (0), 0 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-10 23:39:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 3093 transitions. [2024-10-10 23:39:05,604 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 3093 transitions. Word has length 127 [2024-10-10 23:39:05,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:05,604 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 3093 transitions. [2024-10-10 23:39:05,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 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-10 23:39:05,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 3093 transitions. [2024-10-10 23:39:05,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-10 23:39:05,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:05,606 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:39:05,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:39:05,606 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:05,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:05,607 INFO L85 PathProgramCache]: Analyzing trace with hash -2027027561, now seen corresponding path program 1 times [2024-10-10 23:39:05,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:05,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41430100] [2024-10-10 23:39:05,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:05,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:39:05,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:05,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41430100] [2024-10-10 23:39:05,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41430100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:05,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:05,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:39:05,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160491474] [2024-10-10 23:39:05,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:05,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:05,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:05,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:05,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:39:05,703 INFO L87 Difference]: Start difference. First operand 2486 states and 3093 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-10 23:39:07,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:07,391 INFO L93 Difference]: Finished difference Result 6172 states and 7858 transitions. [2024-10-10 23:39:07,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:07,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2024-10-10 23:39:07,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:07,401 INFO L225 Difference]: With dead ends: 6172 [2024-10-10 23:39:07,401 INFO L226 Difference]: Without dead ends: 3687 [2024-10-10 23:39:07,403 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-10 23:39:07,406 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 233 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:07,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 362 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:39:07,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3687 states. [2024-10-10 23:39:07,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3687 to 3386. [2024-10-10 23:39:07,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.2115214180206795) internal successors, (4101), 3385 states have internal predecessors, (4101), 0 states have call successors, (0), 0 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-10 23:39:07,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 4101 transitions. [2024-10-10 23:39:07,447 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 4101 transitions. Word has length 133 [2024-10-10 23:39:07,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:07,447 INFO L471 AbstractCegarLoop]: Abstraction has 3386 states and 4101 transitions. [2024-10-10 23:39:07,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-10 23:39:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 4101 transitions. [2024-10-10 23:39:07,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-10 23:39:07,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:07,451 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:39:07,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:39:07,452 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:07,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:07,452 INFO L85 PathProgramCache]: Analyzing trace with hash 826252920, now seen corresponding path program 1 times [2024-10-10 23:39:07,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:07,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882617953] [2024-10-10 23:39:07,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:07,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-10 23:39:07,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:07,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882617953] [2024-10-10 23:39:07,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882617953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:07,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:07,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:39:07,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064345053] [2024-10-10 23:39:07,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:07,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:07,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:07,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:07,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:39:07,639 INFO L87 Difference]: Start difference. First operand 3386 states and 4101 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 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-10 23:39:08,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:08,770 INFO L93 Difference]: Finished difference Result 9171 states and 11159 transitions. [2024-10-10 23:39:08,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:08,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 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 247 [2024-10-10 23:39:08,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:08,784 INFO L225 Difference]: With dead ends: 9171 [2024-10-10 23:39:08,784 INFO L226 Difference]: Without dead ends: 5786 [2024-10-10 23:39:08,789 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-10 23:39:08,789 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 117 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:08,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 315 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:39:08,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5786 states. [2024-10-10 23:39:08,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5786 to 5185. [2024-10-10 23:39:08,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5185 states, 5184 states have (on average 1.177854938271605) internal successors, (6106), 5184 states have internal predecessors, (6106), 0 states have call successors, (0), 0 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-10 23:39:08,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5185 states to 5185 states and 6106 transitions. [2024-10-10 23:39:08,851 INFO L78 Accepts]: Start accepts. Automaton has 5185 states and 6106 transitions. Word has length 247 [2024-10-10 23:39:08,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:08,852 INFO L471 AbstractCegarLoop]: Abstraction has 5185 states and 6106 transitions. [2024-10-10 23:39:08,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 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-10 23:39:08,852 INFO L276 IsEmpty]: Start isEmpty. Operand 5185 states and 6106 transitions. [2024-10-10 23:39:08,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-10-10 23:39:08,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:08,857 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:39:08,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:39:08,857 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:08,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:08,858 INFO L85 PathProgramCache]: Analyzing trace with hash -944353768, now seen corresponding path program 1 times [2024-10-10 23:39:08,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:08,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846471400] [2024-10-10 23:39:08,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:08,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-10 23:39:09,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:09,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846471400] [2024-10-10 23:39:09,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846471400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:09,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:09,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:39:09,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980700680] [2024-10-10 23:39:09,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:09,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:09,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:09,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:09,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:39:09,405 INFO L87 Difference]: Start difference. First operand 5185 states and 6106 transitions. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 2 states have internal predecessors, (279), 0 states have call successors, (0), 0 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-10 23:39:10,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:10,289 INFO L93 Difference]: Finished difference Result 10668 states and 12522 transitions. [2024-10-10 23:39:10,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:10,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 2 states have internal predecessors, (279), 0 states have call successors, (0), 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-10 23:39:10,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:10,301 INFO L225 Difference]: With dead ends: 10668 [2024-10-10 23:39:10,302 INFO L226 Difference]: Without dead ends: 5484 [2024-10-10 23:39:10,305 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-10 23:39:10,306 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:10,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 357 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:39:10,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5484 states. [2024-10-10 23:39:10,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5484 to 5484. [2024-10-10 23:39:10,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5484 states, 5483 states have (on average 1.1692504103592924) internal successors, (6411), 5483 states have internal predecessors, (6411), 0 states have call successors, (0), 0 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-10 23:39:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5484 states to 5484 states and 6411 transitions. [2024-10-10 23:39:10,369 INFO L78 Accepts]: Start accepts. Automaton has 5484 states and 6411 transitions. Word has length 328 [2024-10-10 23:39:10,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:10,370 INFO L471 AbstractCegarLoop]: Abstraction has 5484 states and 6411 transitions. [2024-10-10 23:39:10,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 2 states have internal predecessors, (279), 0 states have call successors, (0), 0 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-10 23:39:10,370 INFO L276 IsEmpty]: Start isEmpty. Operand 5484 states and 6411 transitions. [2024-10-10 23:39:10,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-10-10 23:39:10,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:10,373 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10 23:39:10,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:39:10,373 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:10,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:10,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1974727976, now seen corresponding path program 1 times [2024-10-10 23:39:10,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:10,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896042948] [2024-10-10 23:39:10,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:10,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:10,565 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-10 23:39:10,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:10,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896042948] [2024-10-10 23:39:10,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896042948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:10,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:10,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:39:10,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821193036] [2024-10-10 23:39:10,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:10,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:10,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:10,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:10,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:39:10,567 INFO L87 Difference]: Start difference. First operand 5484 states and 6411 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 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-10 23:39:11,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:11,736 INFO L93 Difference]: Finished difference Result 12761 states and 15151 transitions. [2024-10-10 23:39:11,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:11,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 338 [2024-10-10 23:39:11,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:11,753 INFO L225 Difference]: With dead ends: 12761 [2024-10-10 23:39:11,753 INFO L226 Difference]: Without dead ends: 7577 [2024-10-10 23:39:11,758 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-10 23:39:11,759 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 262 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:11,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 320 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:39:11,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7577 states. [2024-10-10 23:39:11,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7577 to 4882. [2024-10-10 23:39:11,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4882 states, 4881 states have (on average 1.1798811718910058) internal successors, (5759), 4881 states have internal predecessors, (5759), 0 states have call successors, (0), 0 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-10 23:39:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4882 states to 4882 states and 5759 transitions. [2024-10-10 23:39:11,838 INFO L78 Accepts]: Start accepts. Automaton has 4882 states and 5759 transitions. Word has length 338 [2024-10-10 23:39:11,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:11,838 INFO L471 AbstractCegarLoop]: Abstraction has 4882 states and 5759 transitions. [2024-10-10 23:39:11,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 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-10 23:39:11,838 INFO L276 IsEmpty]: Start isEmpty. Operand 4882 states and 5759 transitions. [2024-10-10 23:39:11,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2024-10-10 23:39:11,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:11,842 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:39:11,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:39:11,843 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:11,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:11,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1636679303, now seen corresponding path program 1 times [2024-10-10 23:39:11,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:11,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868367060] [2024-10-10 23:39:11,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:11,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:39:12,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:12,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868367060] [2024-10-10 23:39:12,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868367060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:12,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:12,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:39:12,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483200548] [2024-10-10 23:39:12,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:12,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:12,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:12,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:12,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:39:12,060 INFO L87 Difference]: Start difference. First operand 4882 states and 5759 transitions. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 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-10 23:39:13,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:13,140 INFO L93 Difference]: Finished difference Result 11269 states and 13600 transitions. [2024-10-10 23:39:13,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:13,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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 403 [2024-10-10 23:39:13,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:13,166 INFO L225 Difference]: With dead ends: 11269 [2024-10-10 23:39:13,166 INFO L226 Difference]: Without dead ends: 6687 [2024-10-10 23:39:13,171 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-10 23:39:13,171 INFO L432 NwaCegarLoop]: 562 mSDtfsCounter, 248 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:13,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 600 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:39:13,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6687 states. [2024-10-10 23:39:13,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6687 to 6086. [2024-10-10 23:39:13,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6086 states, 6085 states have (on average 1.1625308134757601) internal successors, (7074), 6085 states have internal predecessors, (7074), 0 states have call successors, (0), 0 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-10 23:39:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6086 states to 6086 states and 7074 transitions. [2024-10-10 23:39:13,239 INFO L78 Accepts]: Start accepts. Automaton has 6086 states and 7074 transitions. Word has length 403 [2024-10-10 23:39:13,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:13,240 INFO L471 AbstractCegarLoop]: Abstraction has 6086 states and 7074 transitions. [2024-10-10 23:39:13,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 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-10 23:39:13,240 INFO L276 IsEmpty]: Start isEmpty. Operand 6086 states and 7074 transitions. [2024-10-10 23:39:13,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2024-10-10 23:39:13,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:13,244 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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:39:13,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:39:13,245 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:13,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:13,247 INFO L85 PathProgramCache]: Analyzing trace with hash -373467513, now seen corresponding path program 1 times [2024-10-10 23:39:13,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:13,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765558338] [2024-10-10 23:39:13,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:13,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:13,470 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-10 23:39:13,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:13,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765558338] [2024-10-10 23:39:13,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765558338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:13,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:13,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:39:13,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935013642] [2024-10-10 23:39:13,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:13,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:13,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:13,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:13,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:39:13,473 INFO L87 Difference]: Start difference. First operand 6086 states and 7074 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:14,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:14,851 INFO L93 Difference]: Finished difference Result 13666 states and 16217 transitions. [2024-10-10 23:39:14,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:14,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 420 [2024-10-10 23:39:14,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:14,863 INFO L225 Difference]: With dead ends: 13666 [2024-10-10 23:39:14,863 INFO L226 Difference]: Without dead ends: 7880 [2024-10-10 23:39:14,868 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-10 23:39:14,869 INFO L432 NwaCegarLoop]: 577 mSDtfsCounter, 248 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:14,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 614 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:39:14,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7880 states. [2024-10-10 23:39:14,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7880 to 7876. [2024-10-10 23:39:14,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7876 states, 7875 states have (on average 1.1452698412698412) internal successors, (9019), 7875 states have internal predecessors, (9019), 0 states have call successors, (0), 0 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-10 23:39:14,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7876 states to 7876 states and 9019 transitions. [2024-10-10 23:39:14,944 INFO L78 Accepts]: Start accepts. Automaton has 7876 states and 9019 transitions. Word has length 420 [2024-10-10 23:39:14,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:14,945 INFO L471 AbstractCegarLoop]: Abstraction has 7876 states and 9019 transitions. [2024-10-10 23:39:14,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:14,945 INFO L276 IsEmpty]: Start isEmpty. Operand 7876 states and 9019 transitions. [2024-10-10 23:39:14,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2024-10-10 23:39:14,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:14,948 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:39:14,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:39:14,948 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:14,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:14,949 INFO L85 PathProgramCache]: Analyzing trace with hash -999346633, now seen corresponding path program 1 times [2024-10-10 23:39:14,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:14,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135063349] [2024-10-10 23:39:14,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:14,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 50 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:39:15,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:15,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135063349] [2024-10-10 23:39:15,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135063349] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:39:15,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529519287] [2024-10-10 23:39:15,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:15,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:39:15,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:39:15,419 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:39:15,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:39:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:15,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:39:15,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:39:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-10 23:39:19,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:39:19,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529519287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:19,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:39:19,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:39:19,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097388651] [2024-10-10 23:39:19,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:19,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:19,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:19,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:19,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:39:19,677 INFO L87 Difference]: Start difference. First operand 7876 states and 9019 transitions. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 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-10 23:39:20,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:20,786 INFO L93 Difference]: Finished difference Result 19640 states and 22591 transitions. [2024-10-10 23:39:20,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:20,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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 428 [2024-10-10 23:39:20,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:20,798 INFO L225 Difference]: With dead ends: 19640 [2024-10-10 23:39:20,798 INFO L226 Difference]: Without dead ends: 9672 [2024-10-10 23:39:20,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:39:20,806 INFO L432 NwaCegarLoop]: 555 mSDtfsCounter, 301 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:20,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 587 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:39:20,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9672 states. [2024-10-10 23:39:20,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9672 to 9672. [2024-10-10 23:39:20,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9672 states, 9671 states have (on average 1.087891634784407) internal successors, (10521), 9671 states have internal predecessors, (10521), 0 states have call successors, (0), 0 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-10 23:39:20,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9672 states to 9672 states and 10521 transitions. [2024-10-10 23:39:20,922 INFO L78 Accepts]: Start accepts. Automaton has 9672 states and 10521 transitions. Word has length 428 [2024-10-10 23:39:20,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:20,923 INFO L471 AbstractCegarLoop]: Abstraction has 9672 states and 10521 transitions. [2024-10-10 23:39:20,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 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-10 23:39:20,923 INFO L276 IsEmpty]: Start isEmpty. Operand 9672 states and 10521 transitions. [2024-10-10 23:39:20,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2024-10-10 23:39:20,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:20,927 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:39:20,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:39:21,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-10 23:39:21,128 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:21,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:21,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1294462979, now seen corresponding path program 1 times [2024-10-10 23:39:21,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:21,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791143304] [2024-10-10 23:39:21,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:21,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 251 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:39:22,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:22,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791143304] [2024-10-10 23:39:22,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791143304] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:39:22,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860800653] [2024-10-10 23:39:22,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:22,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:39:22,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:39:22,265 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:39:22,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:39:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:22,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 23:39:22,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:39:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 399 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:39:22,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:39:23,874 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 399 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:39:23,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860800653] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:39:23,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:39:23,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2024-10-10 23:39:23,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145361378] [2024-10-10 23:39:23,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:39:23,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 23:39:23,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:23,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 23:39:23,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-10 23:39:23,878 INFO L87 Difference]: Start difference. First operand 9672 states and 10521 transitions. Second operand has 10 states, 10 states have (on average 134.9) internal successors, (1349), 10 states have internal predecessors, (1349), 0 states have call successors, (0), 0 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-10 23:39:29,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:29,405 INFO L93 Difference]: Finished difference Result 33821 states and 37263 transitions. [2024-10-10 23:39:29,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-10 23:39:29,406 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 134.9) internal successors, (1349), 10 states have internal predecessors, (1349), 0 states have call successors, (0), 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 573 [2024-10-10 23:39:29,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:29,432 INFO L225 Difference]: With dead ends: 33821 [2024-10-10 23:39:29,432 INFO L226 Difference]: Without dead ends: 24449 [2024-10-10 23:39:29,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1186 GetRequests, 1160 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-10-10 23:39:29,439 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 6652 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 7271 mSolverCounterSat, 2323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6652 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 9594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2323 IncrementalHoareTripleChecker+Valid, 7271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:29,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6652 Valid, 279 Invalid, 9594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2323 Valid, 7271 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-10-10 23:39:29,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24449 states. [2024-10-10 23:39:29,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24449 to 19254. [2024-10-10 23:39:29,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19254 states, 19253 states have (on average 1.0747935386692984) internal successors, (20693), 19253 states have internal predecessors, (20693), 0 states have call successors, (0), 0 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-10 23:39:29,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19254 states to 19254 states and 20693 transitions. [2024-10-10 23:39:29,623 INFO L78 Accepts]: Start accepts. Automaton has 19254 states and 20693 transitions. Word has length 573 [2024-10-10 23:39:29,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:29,624 INFO L471 AbstractCegarLoop]: Abstraction has 19254 states and 20693 transitions. [2024-10-10 23:39:29,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 134.9) internal successors, (1349), 10 states have internal predecessors, (1349), 0 states have call successors, (0), 0 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-10 23:39:29,625 INFO L276 IsEmpty]: Start isEmpty. Operand 19254 states and 20693 transitions. [2024-10-10 23:39:29,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2024-10-10 23:39:29,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:29,633 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:39:29,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 23:39:29,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:39:29,834 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:29,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:29,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1801670330, now seen corresponding path program 1 times [2024-10-10 23:39:29,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:29,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650952447] [2024-10-10 23:39:29,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:29,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:30,279 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 478 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2024-10-10 23:39:30,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:30,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650952447] [2024-10-10 23:39:30,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650952447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:30,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:30,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:39:30,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325926384] [2024-10-10 23:39:30,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:30,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:30,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:30,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:30,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:39:30,282 INFO L87 Difference]: Start difference. First operand 19254 states and 20693 transitions. Second operand has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:31,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:31,105 INFO L93 Difference]: Finished difference Result 42093 states and 45194 transitions. [2024-10-10 23:39:31,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:31,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 700 [2024-10-10 23:39:31,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:31,131 INFO L225 Difference]: With dead ends: 42093 [2024-10-10 23:39:31,132 INFO L226 Difference]: Without dead ends: 23139 [2024-10-10 23:39:31,149 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-10 23:39:31,150 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 218 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:31,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 571 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:39:31,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23139 states. [2024-10-10 23:39:31,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23139 to 22240. [2024-10-10 23:39:31,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22240 states, 22239 states have (on average 1.0680786006565044) internal successors, (23753), 22239 states have internal predecessors, (23753), 0 states have call successors, (0), 0 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-10 23:39:31,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22240 states to 22240 states and 23753 transitions. [2024-10-10 23:39:31,382 INFO L78 Accepts]: Start accepts. Automaton has 22240 states and 23753 transitions. Word has length 700 [2024-10-10 23:39:31,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:31,383 INFO L471 AbstractCegarLoop]: Abstraction has 22240 states and 23753 transitions. [2024-10-10 23:39:31,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:31,384 INFO L276 IsEmpty]: Start isEmpty. Operand 22240 states and 23753 transitions. [2024-10-10 23:39:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 749 [2024-10-10 23:39:31,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:31,398 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:39:31,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:39:31,399 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:31,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:31,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1268879394, now seen corresponding path program 1 times [2024-10-10 23:39:31,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:31,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949259003] [2024-10-10 23:39:31,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:31,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:31,991 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 504 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2024-10-10 23:39:31,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:31,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949259003] [2024-10-10 23:39:31,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949259003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:31,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:31,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:39:31,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054195960] [2024-10-10 23:39:31,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:31,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:39:31,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:31,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:39:31,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:39:31,995 INFO L87 Difference]: Start difference. First operand 22240 states and 23753 transitions. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 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-10 23:39:33,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:33,426 INFO L93 Difference]: Finished difference Result 51082 states and 54402 transitions. [2024-10-10 23:39:33,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:39:33,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 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 748 [2024-10-10 23:39:33,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:33,457 INFO L225 Difference]: With dead ends: 51082 [2024-10-10 23:39:33,458 INFO L226 Difference]: Without dead ends: 29142 [2024-10-10 23:39:33,473 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-10 23:39:33,474 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 522 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1704 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 2032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 1704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:33,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 95 Invalid, 2032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 1704 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:39:33,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29142 states. [2024-10-10 23:39:33,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29142 to 25531. [2024-10-10 23:39:33,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25531 states, 25530 states have (on average 1.0662358010184096) internal successors, (27221), 25530 states have internal predecessors, (27221), 0 states have call successors, (0), 0 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-10 23:39:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25531 states to 25531 states and 27221 transitions. [2024-10-10 23:39:33,741 INFO L78 Accepts]: Start accepts. Automaton has 25531 states and 27221 transitions. Word has length 748 [2024-10-10 23:39:33,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:33,741 INFO L471 AbstractCegarLoop]: Abstraction has 25531 states and 27221 transitions. [2024-10-10 23:39:33,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 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-10 23:39:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 25531 states and 27221 transitions. [2024-10-10 23:39:33,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2024-10-10 23:39:33,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:33,761 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:39:33,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:39:33,761 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:33,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:33,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2029996079, now seen corresponding path program 1 times [2024-10-10 23:39:33,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:33,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204973768] [2024-10-10 23:39:33,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:33,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:34,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 575 proven. 511 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2024-10-10 23:39:34,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:34,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204973768] [2024-10-10 23:39:34,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204973768] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:39:34,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907756590] [2024-10-10 23:39:34,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:34,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:39:34,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:39:34,829 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:39:34,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:39:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:35,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 1010 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:39:35,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:39:35,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 710 proven. 0 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2024-10-10 23:39:35,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:39:35,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907756590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:35,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:39:35,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-10 23:39:35,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451413310] [2024-10-10 23:39:35,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:35,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:35,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:35,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:35,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:39:35,142 INFO L87 Difference]: Start difference. First operand 25531 states and 27221 transitions. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 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-10 23:39:35,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:35,953 INFO L93 Difference]: Finished difference Result 49862 states and 53211 transitions. [2024-10-10 23:39:35,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:35,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 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 852 [2024-10-10 23:39:35,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:35,976 INFO L225 Difference]: With dead ends: 49862 [2024-10-10 23:39:35,976 INFO L226 Difference]: Without dead ends: 24631 [2024-10-10 23:39:35,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 856 GetRequests, 852 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:39:35,993 INFO L432 NwaCegarLoop]: 509 mSDtfsCounter, 191 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:35,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 542 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:39:36,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24631 states. [2024-10-10 23:39:36,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24631 to 24631. [2024-10-10 23:39:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24631 states, 24630 states have (on average 1.051847340641494) internal successors, (25907), 24630 states have internal predecessors, (25907), 0 states have call successors, (0), 0 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-10 23:39:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24631 states to 24631 states and 25907 transitions. [2024-10-10 23:39:36,333 INFO L78 Accepts]: Start accepts. Automaton has 24631 states and 25907 transitions. Word has length 852 [2024-10-10 23:39:36,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:36,334 INFO L471 AbstractCegarLoop]: Abstraction has 24631 states and 25907 transitions. [2024-10-10 23:39:36,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 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-10 23:39:36,334 INFO L276 IsEmpty]: Start isEmpty. Operand 24631 states and 25907 transitions. [2024-10-10 23:39:36,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 912 [2024-10-10 23:39:36,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:36,364 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:39:36,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 23:39:36,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:39:36,564 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:36,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:36,565 INFO L85 PathProgramCache]: Analyzing trace with hash -563606268, now seen corresponding path program 1 times [2024-10-10 23:39:36,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:36,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605369158] [2024-10-10 23:39:36,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:36,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:37,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1769 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 996 trivial. 0 not checked. [2024-10-10 23:39:37,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:37,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605369158] [2024-10-10 23:39:37,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605369158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:37,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:37,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:39:37,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450887278] [2024-10-10 23:39:37,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:37,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:37,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:37,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:37,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:39:37,056 INFO L87 Difference]: Start difference. First operand 24631 states and 25907 transitions. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 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-10 23:39:37,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:37,993 INFO L93 Difference]: Finished difference Result 54042 states and 56966 transitions. [2024-10-10 23:39:37,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:37,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 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 911 [2024-10-10 23:39:37,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:38,022 INFO L225 Difference]: With dead ends: 54042 [2024-10-10 23:39:38,022 INFO L226 Difference]: Without dead ends: 29711 [2024-10-10 23:39:38,039 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-10 23:39:38,039 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 233 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:38,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 215 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:39:38,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29711 states. [2024-10-10 23:39:38,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29711 to 27319. [2024-10-10 23:39:38,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27319 states, 27318 states have (on average 1.0520901969397467) internal successors, (28741), 27318 states have internal predecessors, (28741), 0 states have call successors, (0), 0 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-10 23:39:38,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27319 states to 27319 states and 28741 transitions. [2024-10-10 23:39:38,355 INFO L78 Accepts]: Start accepts. Automaton has 27319 states and 28741 transitions. Word has length 911 [2024-10-10 23:39:38,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:38,356 INFO L471 AbstractCegarLoop]: Abstraction has 27319 states and 28741 transitions. [2024-10-10 23:39:38,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 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-10 23:39:38,356 INFO L276 IsEmpty]: Start isEmpty. Operand 27319 states and 28741 transitions. [2024-10-10 23:39:38,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 950 [2024-10-10 23:39:38,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:38,379 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10 23:39:38,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:39:38,379 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:38,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:38,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1348945090, now seen corresponding path program 1 times [2024-10-10 23:39:38,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:38,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201674255] [2024-10-10 23:39:38,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:38,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:38,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2024-10-10 23:39:38,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:38,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201674255] [2024-10-10 23:39:38,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201674255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:38,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:38,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:39:38,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134193979] [2024-10-10 23:39:38,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:38,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:39:38,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:38,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:39:38,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:39:38,956 INFO L87 Difference]: Start difference. First operand 27319 states and 28741 transitions. Second operand has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 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-10 23:39:40,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:40,269 INFO L93 Difference]: Finished difference Result 62413 states and 65611 transitions. [2024-10-10 23:39:40,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:39:40,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 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 949 [2024-10-10 23:39:40,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:40,299 INFO L225 Difference]: With dead ends: 62413 [2024-10-10 23:39:40,300 INFO L226 Difference]: Without dead ends: 30012 [2024-10-10 23:39:40,317 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-10 23:39:40,318 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 688 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1500 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:40,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 456 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1500 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:39:40,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30012 states. [2024-10-10 23:39:40,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30012 to 23416. [2024-10-10 23:39:40,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23416 states, 23415 states have (on average 1.0297672432201581) internal successors, (24112), 23415 states have internal predecessors, (24112), 0 states have call successors, (0), 0 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-10 23:39:40,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23416 states to 23416 states and 24112 transitions. [2024-10-10 23:39:40,632 INFO L78 Accepts]: Start accepts. Automaton has 23416 states and 24112 transitions. Word has length 949 [2024-10-10 23:39:40,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:40,633 INFO L471 AbstractCegarLoop]: Abstraction has 23416 states and 24112 transitions. [2024-10-10 23:39:40,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 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-10 23:39:40,637 INFO L276 IsEmpty]: Start isEmpty. Operand 23416 states and 24112 transitions. [2024-10-10 23:39:40,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 980 [2024-10-10 23:39:40,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:40,663 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 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-10 23:39:40,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:39:40,663 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:40,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:40,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1877922504, now seen corresponding path program 1 times [2024-10-10 23:39:40,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:40,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042626579] [2024-10-10 23:39:40,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:40,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:41,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 892 proven. 0 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2024-10-10 23:39:41,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:41,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042626579] [2024-10-10 23:39:41,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042626579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:41,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:41,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:39:41,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294761476] [2024-10-10 23:39:41,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:41,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:41,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:41,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:41,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:39:41,452 INFO L87 Difference]: Start difference. First operand 23416 states and 24112 transitions. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 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-10 23:39:42,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:42,189 INFO L93 Difference]: Finished difference Result 48324 states and 49787 transitions. [2024-10-10 23:39:42,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:42,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 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 979 [2024-10-10 23:39:42,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:42,215 INFO L225 Difference]: With dead ends: 48324 [2024-10-10 23:39:42,215 INFO L226 Difference]: Without dead ends: 25208 [2024-10-10 23:39:42,229 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-10 23:39:42,230 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 72 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:42,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 479 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:39:42,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25208 states. [2024-10-10 23:39:42,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25208 to 21914. [2024-10-10 23:39:42,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21914 states, 21913 states have (on average 1.0284762469766806) internal successors, (22537), 21913 states have internal predecessors, (22537), 0 states have call successors, (0), 0 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-10 23:39:42,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21914 states to 21914 states and 22537 transitions. [2024-10-10 23:39:42,413 INFO L78 Accepts]: Start accepts. Automaton has 21914 states and 22537 transitions. Word has length 979 [2024-10-10 23:39:42,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:42,414 INFO L471 AbstractCegarLoop]: Abstraction has 21914 states and 22537 transitions. [2024-10-10 23:39:42,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 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-10 23:39:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 21914 states and 22537 transitions. [2024-10-10 23:39:42,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1064 [2024-10-10 23:39:42,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:42,429 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:39:42,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:39:42,429 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:42,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:42,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1295132738, now seen corresponding path program 1 times [2024-10-10 23:39:42,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:42,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146450941] [2024-10-10 23:39:42,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:42,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:43,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1842 backedges. 1472 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-10 23:39:43,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:43,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146450941] [2024-10-10 23:39:43,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146450941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:43,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:43,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:39:43,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006770244] [2024-10-10 23:39:43,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:43,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:43,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:43,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:43,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:39:43,066 INFO L87 Difference]: Start difference. First operand 21914 states and 22537 transitions. Second operand has 3 states, 3 states have (on average 248.66666666666666) internal successors, (746), 3 states have internal predecessors, (746), 0 states have call successors, (0), 0 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-10 23:39:44,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:44,005 INFO L93 Difference]: Finished difference Result 48328 states and 49701 transitions. [2024-10-10 23:39:44,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:44,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 248.66666666666666) internal successors, (746), 3 states have internal predecessors, (746), 0 states have call successors, (0), 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 1063 [2024-10-10 23:39:44,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:44,029 INFO L225 Difference]: With dead ends: 48328 [2024-10-10 23:39:44,029 INFO L226 Difference]: Without dead ends: 26714 [2024-10-10 23:39:44,043 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-10 23:39:44,043 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 103 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:44,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 134 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:39:44,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26714 states. [2024-10-10 23:39:44,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26714 to 23110. [2024-10-10 23:39:44,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23110 states, 23109 states have (on average 1.0279112034272362) internal successors, (23754), 23109 states have internal predecessors, (23754), 0 states have call successors, (0), 0 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-10 23:39:44,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23110 states to 23110 states and 23754 transitions. [2024-10-10 23:39:44,262 INFO L78 Accepts]: Start accepts. Automaton has 23110 states and 23754 transitions. Word has length 1063 [2024-10-10 23:39:44,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:44,263 INFO L471 AbstractCegarLoop]: Abstraction has 23110 states and 23754 transitions. [2024-10-10 23:39:44,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.66666666666666) internal successors, (746), 3 states have internal predecessors, (746), 0 states have call successors, (0), 0 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-10 23:39:44,263 INFO L276 IsEmpty]: Start isEmpty. Operand 23110 states and 23754 transitions. [2024-10-10 23:39:44,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1692 [2024-10-10 23:39:44,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:44,287 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-10 23:39:44,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:39:44,288 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:44,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:44,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1739673393, now seen corresponding path program 1 times [2024-10-10 23:39:44,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:44,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595013114] [2024-10-10 23:39:44,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:44,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:45,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6183 backedges. 4139 proven. 0 refuted. 0 times theorem prover too weak. 2044 trivial. 0 not checked. [2024-10-10 23:39:45,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:45,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595013114] [2024-10-10 23:39:45,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595013114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:45,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:45,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:39:45,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778301201] [2024-10-10 23:39:45,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:45,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:45,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:45,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:45,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:39:45,325 INFO L87 Difference]: Start difference. First operand 23110 states and 23754 transitions. Second operand has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 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-10 23:39:46,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:46,029 INFO L93 Difference]: Finished difference Result 40196 states and 41295 transitions. [2024-10-10 23:39:46,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:46,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 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 1691 [2024-10-10 23:39:46,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:46,031 INFO L225 Difference]: With dead ends: 40196 [2024-10-10 23:39:46,031 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:39:46,043 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-10 23:39:46,043 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 172 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:46,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 120 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:39:46,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:39:46,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:39:46,044 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-10 23:39:46,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:39:46,044 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1691 [2024-10-10 23:39:46,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:46,045 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:39:46,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 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-10 23:39:46,045 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:39:46,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:39:46,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:39:46,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 23:39:46,051 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] [2024-10-10 23:39:46,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:39:48,753 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:39:48,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:39:48 BoogieIcfgContainer [2024-10-10 23:39:48,780 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:39:48,780 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:39:48,780 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:39:48,780 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:39:48,781 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:39:00" (3/4) ... [2024-10-10 23:39:48,782 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:39:48,806 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-10 23:39:48,808 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:39:48,809 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:39:48,811 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:39:48,964 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:39:48,964 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:39:48,964 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:39:48,965 INFO L158 Benchmark]: Toolchain (without parser) took 51673.38ms. Allocated memory was 163.6MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 91.4MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 875.9MB. Max. memory is 16.1GB. [2024-10-10 23:39:48,965 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 98.6MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:39:48,965 INFO L158 Benchmark]: CACSL2BoogieTranslator took 801.02ms. Allocated memory is still 163.6MB. Free memory was 91.1MB in the beginning and 71.7MB in the end (delta: 19.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-10 23:39:48,965 INFO L158 Benchmark]: Boogie Procedure Inliner took 163.61ms. Allocated memory is still 163.6MB. Free memory was 71.7MB in the beginning and 97.2MB in the end (delta: -25.5MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2024-10-10 23:39:48,968 INFO L158 Benchmark]: Boogie Preprocessor took 265.13ms. Allocated memory was 163.6MB in the beginning and 260.0MB in the end (delta: 96.5MB). Free memory was 97.2MB in the beginning and 196.6MB in the end (delta: -99.4MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB. [2024-10-10 23:39:48,968 INFO L158 Benchmark]: RCFGBuilder took 1947.17ms. Allocated memory was 260.0MB in the beginning and 371.2MB in the end (delta: 111.1MB). Free memory was 196.6MB in the beginning and 287.5MB in the end (delta: -90.9MB). Peak memory consumption was 105.8MB. Max. memory is 16.1GB. [2024-10-10 23:39:48,968 INFO L158 Benchmark]: TraceAbstraction took 48307.34ms. Allocated memory was 371.2MB in the beginning and 3.3GB in the end (delta: 3.0GB). Free memory was 286.4MB in the beginning and 2.4GB in the end (delta: -2.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-10-10 23:39:48,968 INFO L158 Benchmark]: Witness Printer took 184.21ms. Allocated memory is still 3.3GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-10 23:39:48,969 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.15ms. Allocated memory is still 98.6MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 801.02ms. Allocated memory is still 163.6MB. Free memory was 91.1MB in the beginning and 71.7MB in the end (delta: 19.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 163.61ms. Allocated memory is still 163.6MB. Free memory was 71.7MB in the beginning and 97.2MB in the end (delta: -25.5MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 265.13ms. Allocated memory was 163.6MB in the beginning and 260.0MB in the end (delta: 96.5MB). Free memory was 97.2MB in the beginning and 196.6MB in the end (delta: -99.4MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1947.17ms. Allocated memory was 260.0MB in the beginning and 371.2MB in the end (delta: 111.1MB). Free memory was 196.6MB in the beginning and 287.5MB in the end (delta: -90.9MB). Peak memory consumption was 105.8MB. Max. memory is 16.1GB. * TraceAbstraction took 48307.34ms. Allocated memory was 371.2MB in the beginning and 3.3GB in the end (delta: 3.0GB). Free memory was 286.4MB in the beginning and 2.4GB in the end (delta: -2.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 184.21ms. Allocated memory is still 3.3GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 173]: 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: 45.5s, OverallIterations: 20, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 26.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11208 SdHoareTripleChecker+Valid, 23.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11208 mSDsluCounter, 7854 SdHoareTripleChecker+Invalid, 20.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 881 mSDsCounter, 5850 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24095 IncrementalHoareTripleChecker+Invalid, 29945 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5850 mSolverCounterUnsat, 6973 mSDtfsCounter, 24095 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2520 GetRequests, 2468 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27319occurred in iteration=16, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 29806 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 12964 NumberOfCodeBlocks, 12964 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 13513 ConstructedInterpolants, 0 QuantifiedInterpolants, 35152 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2221 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 24 InterpolantComputations, 19 PerfectInterpolantSequences, 19551/20686 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: ((((((((((((((((((((((((((((((((0 <= ((long long) a29 + 15)) && (0 <= ((long long) a0 + 60))) && (((long long) a4 + 86) <= 0)) && (a29 <= 599998)) && (3 == a2)) || ((((2 == a2) && (0 <= ((long long) a29 + 127))) && (((long long) a0 + 99) <= 0)) && (a29 <= 599998))) || ((((((long long) 89 + a4) <= 0) && (a29 <= 599998)) && (a2 == 4)) && ((43 < a29) || (((long long) a29 + 15) < 0)))) || ((((long long) a0 + 147) <= 0) && (a2 == 4))) || ((((a29 <= 41) && (2 == a2)) && (0 <= ((long long) a29 + 127))) && (((long long) 98 + a0) <= 0))) || ((((a29 <= 41) && (0 <= ((long long) a29 + 127))) && (((long long) 98 + a0) <= 0)) && (5 <= a2))) || ((((2 == a2) && (0 <= ((long long) a29 + 127))) && (((long long) 89 + a4) <= 0)) && (a29 <= 599998))) || (((((0 <= ((long long) 97 + a0)) && (44 <= a29)) && (((long long) 89 + a4) <= 0)) && (a29 <= 599998)) && (3 == a2))) || ((2 == a2) && (((long long) a0 + 147) <= 0))) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && (((long long) a29 + 107481) <= 0))) || ((((2 == a2) && (0 <= ((long long) a0 + 60))) && (((long long) a29 + 107481) <= 0)) && (((long long) a4 + 86) <= 0))) || ((((long long) a0 + 147) <= 0) && (a2 == 1))) || ((((((long long) 89 + a4) <= 0) && (a2 == 1)) && (a29 <= 599998)) && (((long long) a0 + 61) <= 0))) || (((a29 <= 41) && (0 <= ((long long) a29 + 127))) && (a2 == 1))) || (((((long long) 107 + a0) <= 0) && (5 <= a2)) && (((long long) a29 + 127) <= 0))) || (((((2 == a2) && (0 <= ((long long) a29 + 127))) && (0 <= ((long long) a0 + 60))) && (((long long) a4 + 86) <= 0)) && (a29 <= 599998))) || (((134656 <= a29) && (((long long) 98 + a0) <= 0)) && (5 <= a2))) || ((((((0 <= ((long long) 97 + a0)) && (0 <= ((long long) a29 + 127))) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 16) <= 0)) && (3 == a2)) && (((long long) a0 + 61) <= 0))) || (((((0 <= ((long long) a29 + 127)) && (0 <= ((long long) a0 + 60))) && (5 <= a2)) && (((long long) a4 + 86) <= 0)) && (a29 <= 599998))) || ((((long long) a0 + 99) <= 0) && (((long long) 89 + a4) <= 0))) || ((((0 <= ((long long) a29 + 127)) && (((long long) 98 + a0) <= 0)) && (a29 <= 599998)) && (a2 == 4))) || ((((0 <= ((long long) a29 + 127)) && (((long long) 89 + a4) <= 0)) && (5 <= a2)) && (a29 <= 599998))) || ((((long long) a0 + 99) <= 0) && (3 == a2))) || (((((0 <= ((long long) a29 + 127)) && (0 <= ((long long) a0 + 60))) && (((long long) a4 + 86) <= 0)) && (a29 <= 599998)) && (a2 == 4))) || (((((long long) 89 + a4) <= 0) && (3 == a2)) && (((long long) a29 + 127) <= 0))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 127) <= 0))) || (((a29 <= 41) && (a2 == 1)) && (((long long) a0 + 61) <= 0))) || ((((long long) a0 + 147) <= 0) && (5 <= a2))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:39:48,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE