./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/Problem12_label37.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/Problem12_label37.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 216d354bd2b39cc08159a7e1d05b12b6bb34b7a88f8458e31e862be3f2691415 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:23:32,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:23:32,100 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:23:32,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:23:32,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:23:32,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:23:32,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:23:32,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:23:32,143 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:23:32,144 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:23:32,145 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:23:32,145 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:23:32,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:23:32,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:23:32,146 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:23:32,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:23:32,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:23:32,150 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:23:32,150 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:23:32,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:23:32,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:23:32,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:23:32,152 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:23:32,153 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:23:32,153 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:23:32,154 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:23:32,154 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:23:32,154 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:23:32,154 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:23:32,155 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:23:32,155 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:23:32,155 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:23:32,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:23:32,156 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:23:32,156 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:23:32,157 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:23:32,157 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:23:32,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:23:32,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:23:32,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:23:32,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:23:32,159 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:23:32,159 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 -> 216d354bd2b39cc08159a7e1d05b12b6bb34b7a88f8458e31e862be3f2691415 [2024-10-10 23:23:32,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:23:32,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:23:32,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:23:32,413 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:23:32,413 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:23:32,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label37.c [2024-10-10 23:23:33,883 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:23:34,337 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:23:34,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label37.c [2024-10-10 23:23:34,366 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/32cab0fdb/5bd0e0432be949e79a26dc142df9a4a4/FLAGfdc471619 [2024-10-10 23:23:34,464 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/32cab0fdb/5bd0e0432be949e79a26dc142df9a4a4 [2024-10-10 23:23:34,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:23:34,470 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:23:34,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:23:34,472 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:23:34,478 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:23:34,479 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:23:34" (1/1) ... [2024-10-10 23:23:34,480 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c55c32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:34, skipping insertion in model container [2024-10-10 23:23:34,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:23:34" (1/1) ... [2024-10-10 23:23:34,583 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:23:34,835 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/Problem12_label37.c[2005,2018] [2024-10-10 23:23:35,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:23:35,545 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:23:35,563 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/Problem12_label37.c[2005,2018] [2024-10-10 23:23:36,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:23:36,037 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:23:36,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:36 WrapperNode [2024-10-10 23:23:36,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:23:36,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:23:36,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:23:36,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:23:36,046 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:23:36" (1/1) ... [2024-10-10 23:23:36,098 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:23:36" (1/1) ... [2024-10-10 23:23:36,500 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-10-10 23:23:36,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:23:36,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:23:36,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:23:36,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:23:36,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:36" (1/1) ... [2024-10-10 23:23:36,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:36" (1/1) ... [2024-10-10 23:23:36,564 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:36" (1/1) ... [2024-10-10 23:23:36,765 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:23:36,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:36" (1/1) ... [2024-10-10 23:23:36,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:36" (1/1) ... [2024-10-10 23:23:36,941 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:36" (1/1) ... [2024-10-10 23:23:36,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:36" (1/1) ... [2024-10-10 23:23:37,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:36" (1/1) ... [2024-10-10 23:23:37,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:36" (1/1) ... [2024-10-10 23:23:37,137 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:23:37,138 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:23:37,139 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:23:37,139 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:23:37,140 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:36" (1/1) ... [2024-10-10 23:23:37,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:23:37,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:23:37,171 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:23:37,173 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:23:37,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:23:37,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:23:37,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:23:37,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:23:37,304 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:23:37,306 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:23:41,360 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-10-10 23:23:41,360 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:23:41,426 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:23:41,426 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:23:41,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:23:41 BoogieIcfgContainer [2024-10-10 23:23:41,427 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:23:41,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:23:41,429 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:23:41,432 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:23:41,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:23:34" (1/3) ... [2024-10-10 23:23:41,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d28070f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:23:41, skipping insertion in model container [2024-10-10 23:23:41,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:36" (2/3) ... [2024-10-10 23:23:41,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d28070f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:23:41, skipping insertion in model container [2024-10-10 23:23:41,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:23:41" (3/3) ... [2024-10-10 23:23:41,438 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label37.c [2024-10-10 23:23:41,455 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:23:41,456 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:23:41,552 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:23:41,559 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;@63f28b54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:23:41,559 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:23:41,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 0 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:23:41,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-10 23:23:41,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:41,573 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:23:41,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:41,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:41,578 INFO L85 PathProgramCache]: Analyzing trace with hash -105395122, now seen corresponding path program 1 times [2024-10-10 23:23:41,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:41,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240713827] [2024-10-10 23:23:41,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:41,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:41,737 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:23:41,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:41,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240713827] [2024-10-10 23:23:41,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240713827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:41,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:41,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:23:41,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356886689] [2024-10-10 23:23:41,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:41,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:23:41,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:41,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:23:41,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:23:41,777 INFO L87 Difference]: Start difference. First operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 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:23:41,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:41,875 INFO L93 Difference]: Finished difference Result 1511 states and 3005 transitions. [2024-10-10 23:23:41,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:23:41,879 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-10-10 23:23:41,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:41,899 INFO L225 Difference]: With dead ends: 1511 [2024-10-10 23:23:41,899 INFO L226 Difference]: Without dead ends: 754 [2024-10-10 23:23:41,908 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:23:41,912 INFO L432 NwaCegarLoop]: 1438 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, 1438 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:23:41,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:23:41,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-10-10 23:23:41,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-10-10 23:23:41,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 0 states have call successors, (0), 0 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:23:41,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2024-10-10 23:23:41,996 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 12 [2024-10-10 23:23:41,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:41,997 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2024-10-10 23:23:41,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 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:23:41,998 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2024-10-10 23:23:41,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-10 23:23:41,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:41,999 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:23:41,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:23:42,000 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:42,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:42,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1143423914, now seen corresponding path program 1 times [2024-10-10 23:23:42,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:42,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004948625] [2024-10-10 23:23:42,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:42,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:42,116 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:23:42,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:42,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004948625] [2024-10-10 23:23:42,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004948625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:42,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:42,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:23:42,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153067062] [2024-10-10 23:23:42,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:42,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:42,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:42,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:42,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:42,123 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 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:23:45,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:45,426 INFO L93 Difference]: Finished difference Result 2258 states and 4311 transitions. [2024-10-10 23:23:45,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:45,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-10-10 23:23:45,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:45,434 INFO L225 Difference]: With dead ends: 2258 [2024-10-10 23:23:45,434 INFO L226 Difference]: Without dead ends: 1505 [2024-10-10 23:23:45,436 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:23:45,437 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 802 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2278 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 3276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 2278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:45,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 75 Invalid, 3276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 2278 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-10 23:23:45,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2024-10-10 23:23:45,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2024-10-10 23:23:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 1.8703457446808511) internal successors, (2813), 1504 states have internal predecessors, (2813), 0 states have call successors, (0), 0 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:23:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2813 transitions. [2024-10-10 23:23:45,499 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2813 transitions. Word has length 12 [2024-10-10 23:23:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:45,499 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2813 transitions. [2024-10-10 23:23:45,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 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:23:45,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2813 transitions. [2024-10-10 23:23:45,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-10 23:23:45,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:45,502 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:23:45,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:23:45,503 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:45,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:45,503 INFO L85 PathProgramCache]: Analyzing trace with hash 327971167, now seen corresponding path program 1 times [2024-10-10 23:23:45,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:45,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230870703] [2024-10-10 23:23:45,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:45,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:45,790 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:23:45,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:45,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230870703] [2024-10-10 23:23:45,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230870703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:45,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:45,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:23:45,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424801896] [2024-10-10 23:23:45,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:45,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:45,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:45,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:45,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:45,794 INFO L87 Difference]: Start difference. First operand 1505 states and 2813 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 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:23:48,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:48,953 INFO L93 Difference]: Finished difference Result 4513 states and 8437 transitions. [2024-10-10 23:23:48,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:48,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-10-10 23:23:48,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:48,965 INFO L225 Difference]: With dead ends: 4513 [2024-10-10 23:23:48,966 INFO L226 Difference]: Without dead ends: 3009 [2024-10-10 23:23:48,972 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:23:48,974 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 918 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2310 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 2860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:48,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 352 Invalid, 2860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2310 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:23:48,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3009 states. [2024-10-10 23:23:49,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 3007. [2024-10-10 23:23:49,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 3006 states have (on average 1.6533599467731204) internal successors, (4970), 3006 states have internal predecessors, (4970), 0 states have call successors, (0), 0 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:23:49,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4970 transitions. [2024-10-10 23:23:49,042 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4970 transitions. Word has length 85 [2024-10-10 23:23:49,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:49,043 INFO L471 AbstractCegarLoop]: Abstraction has 3007 states and 4970 transitions. [2024-10-10 23:23:49,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 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:23:49,044 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4970 transitions. [2024-10-10 23:23:49,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-10 23:23:49,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:49,049 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:23:49,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:23:49,049 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:49,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:49,050 INFO L85 PathProgramCache]: Analyzing trace with hash 498572292, now seen corresponding path program 1 times [2024-10-10 23:23:49,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:49,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084715779] [2024-10-10 23:23:49,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:49,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:49,295 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:23:49,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:49,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084715779] [2024-10-10 23:23:49,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084715779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:49,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:49,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:49,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606481616] [2024-10-10 23:23:49,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:49,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:23:49,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:49,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:23:49,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:23:49,301 INFO L87 Difference]: Start difference. First operand 3007 states and 4970 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:23:53,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:53,693 INFO L93 Difference]: Finished difference Result 8266 states and 13428 transitions. [2024-10-10 23:23:53,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:23:53,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2024-10-10 23:23:53,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:53,710 INFO L225 Difference]: With dead ends: 8266 [2024-10-10 23:23:53,710 INFO L226 Difference]: Without dead ends: 5260 [2024-10-10 23:23:53,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:23:53,717 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 2153 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 4999 mSolverCounterSat, 851 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2153 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 5850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 851 IncrementalHoareTripleChecker+Valid, 4999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:53,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2153 Valid, 351 Invalid, 5850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [851 Valid, 4999 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-10 23:23:53,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5260 states. [2024-10-10 23:23:53,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5260 to 5260. [2024-10-10 23:23:53,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5260 states, 5259 states have (on average 1.510363186917665) internal successors, (7943), 5259 states have internal predecessors, (7943), 0 states have call successors, (0), 0 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:23:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5260 states to 5260 states and 7943 transitions. [2024-10-10 23:23:53,805 INFO L78 Accepts]: Start accepts. Automaton has 5260 states and 7943 transitions. Word has length 98 [2024-10-10 23:23:53,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:53,806 INFO L471 AbstractCegarLoop]: Abstraction has 5260 states and 7943 transitions. [2024-10-10 23:23:53,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:23:53,806 INFO L276 IsEmpty]: Start isEmpty. Operand 5260 states and 7943 transitions. [2024-10-10 23:23:53,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-10 23:23:53,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:53,812 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:23:53,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:23:53,812 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:53,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:53,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1423621321, now seen corresponding path program 1 times [2024-10-10 23:23:53,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:53,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42758076] [2024-10-10 23:23:53,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:53,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:54,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:23:54,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:54,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42758076] [2024-10-10 23:23:54,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42758076] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:23:54,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561923122] [2024-10-10 23:23:54,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:54,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:23:54,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:23:54,277 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:23:54,284 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:23:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:54,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-10 23:23:54,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:23:55,126 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:23:55,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:23:55,774 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:23:55,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561923122] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:23:55,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:23:55,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 5 [2024-10-10 23:23:55,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55353827] [2024-10-10 23:23:55,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:23:55,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 23:23:55,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:55,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 23:23:55,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:23:55,780 INFO L87 Difference]: Start difference. First operand 5260 states and 7943 transitions. Second operand has 6 states, 6 states have (on average 49.0) internal successors, (294), 5 states have internal predecessors, (294), 0 states have call successors, (0), 0 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:24:03,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:03,805 INFO L93 Difference]: Finished difference Result 22535 states and 35159 transitions. [2024-10-10 23:24:03,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 23:24:03,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 49.0) internal successors, (294), 5 states have internal predecessors, (294), 0 states have call successors, (0), 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 153 [2024-10-10 23:24:03,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:03,860 INFO L225 Difference]: With dead ends: 22535 [2024-10-10 23:24:03,860 INFO L226 Difference]: Without dead ends: 18027 [2024-10-10 23:24:03,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:24:03,872 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 6223 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 7622 mSolverCounterSat, 2806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6223 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 10428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2806 IncrementalHoareTripleChecker+Valid, 7622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:03,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6223 Valid, 362 Invalid, 10428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2806 Valid, 7622 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2024-10-10 23:24:03,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18027 states. [2024-10-10 23:24:04,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18027 to 16525. [2024-10-10 23:24:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16525 states, 16524 states have (on average 1.4514645364318568) internal successors, (23984), 16524 states have internal predecessors, (23984), 0 states have call successors, (0), 0 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:24:04,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16525 states to 16525 states and 23984 transitions. [2024-10-10 23:24:04,217 INFO L78 Accepts]: Start accepts. Automaton has 16525 states and 23984 transitions. Word has length 153 [2024-10-10 23:24:04,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:04,219 INFO L471 AbstractCegarLoop]: Abstraction has 16525 states and 23984 transitions. [2024-10-10 23:24:04,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.0) internal successors, (294), 5 states have internal predecessors, (294), 0 states have call successors, (0), 0 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:24:04,219 INFO L276 IsEmpty]: Start isEmpty. Operand 16525 states and 23984 transitions. [2024-10-10 23:24:04,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-10 23:24:04,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:04,225 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:04,243 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:24:04,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:24:04,426 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:04,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:04,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1701945923, now seen corresponding path program 1 times [2024-10-10 23:24:04,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:04,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751248777] [2024-10-10 23:24:04,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:04,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:04,767 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:24:04,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:04,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751248777] [2024-10-10 23:24:04,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751248777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:04,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:04,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:24:04,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413064168] [2024-10-10 23:24:04,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:04,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:24:04,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:04,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:24:04,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:24:04,770 INFO L87 Difference]: Start difference. First operand 16525 states and 23984 transitions. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 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:24:08,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:08,187 INFO L93 Difference]: Finished difference Result 37594 states and 54060 transitions. [2024-10-10 23:24:08,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:24:08,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2024-10-10 23:24:08,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:08,232 INFO L225 Difference]: With dead ends: 37594 [2024-10-10 23:24:08,233 INFO L226 Difference]: Without dead ends: 21033 [2024-10-10 23:24:08,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:24:08,256 INFO L432 NwaCegarLoop]: 693 mSDtfsCounter, 690 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3807 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 4134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 3807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:08,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 711 Invalid, 4134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 3807 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-10 23:24:08,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21033 states. [2024-10-10 23:24:08,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21033 to 21031. [2024-10-10 23:24:08,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21031 states, 21030 states have (on average 1.3596766524013315) internal successors, (28594), 21030 states have internal predecessors, (28594), 0 states have call successors, (0), 0 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:24:08,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21031 states to 21031 states and 28594 transitions. [2024-10-10 23:24:08,572 INFO L78 Accepts]: Start accepts. Automaton has 21031 states and 28594 transitions. Word has length 200 [2024-10-10 23:24:08,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:08,572 INFO L471 AbstractCegarLoop]: Abstraction has 21031 states and 28594 transitions. [2024-10-10 23:24:08,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 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:24:08,573 INFO L276 IsEmpty]: Start isEmpty. Operand 21031 states and 28594 transitions. [2024-10-10 23:24:08,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-10-10 23:24:08,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:08,577 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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:24:08,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:24:08,577 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:08,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:08,577 INFO L85 PathProgramCache]: Analyzing trace with hash 580978766, now seen corresponding path program 1 times [2024-10-10 23:24:08,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:08,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554476496] [2024-10-10 23:24:08,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:08,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:08,835 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:24:08,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:08,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554476496] [2024-10-10 23:24:08,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554476496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:08,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:08,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:24:08,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872692172] [2024-10-10 23:24:08,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:08,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:24:08,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:08,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:24:08,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:24:08,840 INFO L87 Difference]: Start difference. First operand 21031 states and 28594 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 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:24:11,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:11,535 INFO L93 Difference]: Finished difference Result 42061 states and 57187 transitions. [2024-10-10 23:24:11,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:24:11,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 270 [2024-10-10 23:24:11,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:11,575 INFO L225 Difference]: With dead ends: 42061 [2024-10-10 23:24:11,575 INFO L226 Difference]: Without dead ends: 21031 [2024-10-10 23:24:11,599 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:24:11,600 INFO L432 NwaCegarLoop]: 1192 mSDtfsCounter, 651 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2593 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 2908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 2593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:11,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1198 Invalid, 2908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 2593 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:24:11,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21031 states. [2024-10-10 23:24:11,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21031 to 21031. [2024-10-10 23:24:11,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21031 states, 21030 states have (on average 1.3333333333333333) internal successors, (28040), 21030 states have internal predecessors, (28040), 0 states have call successors, (0), 0 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:24:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21031 states to 21031 states and 28040 transitions. [2024-10-10 23:24:11,877 INFO L78 Accepts]: Start accepts. Automaton has 21031 states and 28040 transitions. Word has length 270 [2024-10-10 23:24:11,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:11,878 INFO L471 AbstractCegarLoop]: Abstraction has 21031 states and 28040 transitions. [2024-10-10 23:24:11,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 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:24:11,878 INFO L276 IsEmpty]: Start isEmpty. Operand 21031 states and 28040 transitions. [2024-10-10 23:24:11,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-10-10 23:24:11,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:11,883 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:11,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:24:11,883 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:11,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:11,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1899777084, now seen corresponding path program 1 times [2024-10-10 23:24:11,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:11,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885858665] [2024-10-10 23:24:11,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:11,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:12,107 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-10 23:24:12,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:12,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885858665] [2024-10-10 23:24:12,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885858665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:12,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:12,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:24:12,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670697307] [2024-10-10 23:24:12,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:12,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:24:12,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:12,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:24:12,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:24:12,111 INFO L87 Difference]: Start difference. First operand 21031 states and 28040 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:24:15,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:15,018 INFO L93 Difference]: Finished difference Result 56330 states and 76175 transitions. [2024-10-10 23:24:15,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:24:15,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 274 [2024-10-10 23:24:15,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:15,075 INFO L225 Difference]: With dead ends: 56330 [2024-10-10 23:24:15,076 INFO L226 Difference]: Without dead ends: 35300 [2024-10-10 23:24:15,102 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:24:15,103 INFO L432 NwaCegarLoop]: 1401 mSDtfsCounter, 741 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2355 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 2894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 2355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:15,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 1408 Invalid, 2894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 2355 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:24:15,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35300 states. [2024-10-10 23:24:15,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35300 to 32296. [2024-10-10 23:24:15,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32296 states, 32295 states have (on average 1.2319554110543427) internal successors, (39786), 32295 states have internal predecessors, (39786), 0 states have call successors, (0), 0 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:24:15,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32296 states to 32296 states and 39786 transitions. [2024-10-10 23:24:15,504 INFO L78 Accepts]: Start accepts. Automaton has 32296 states and 39786 transitions. Word has length 274 [2024-10-10 23:24:15,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:15,505 INFO L471 AbstractCegarLoop]: Abstraction has 32296 states and 39786 transitions. [2024-10-10 23:24:15,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:24:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 32296 states and 39786 transitions. [2024-10-10 23:24:15,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2024-10-10 23:24:15,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:15,529 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:15,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:24:15,529 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:15,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:15,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1913687938, now seen corresponding path program 1 times [2024-10-10 23:24:15,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:15,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026847800] [2024-10-10 23:24:15,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:15,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:16,400 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:24:16,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:16,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026847800] [2024-10-10 23:24:16,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026847800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:16,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:16,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:24:16,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586990163] [2024-10-10 23:24:16,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:16,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:24:16,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:16,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:24:16,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:24:16,408 INFO L87 Difference]: Start difference. First operand 32296 states and 39786 transitions. Second operand has 4 states, 4 states have (on average 126.25) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 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:24:20,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:20,460 INFO L93 Difference]: Finished difference Result 75856 states and 95858 transitions. [2024-10-10 23:24:20,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:24:20,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 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 505 [2024-10-10 23:24:20,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:20,515 INFO L225 Difference]: With dead ends: 75856 [2024-10-10 23:24:20,515 INFO L226 Difference]: Without dead ends: 43561 [2024-10-10 23:24:20,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:24:20,672 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 1079 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 4300 mSolverCounterSat, 1017 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 5317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1017 IncrementalHoareTripleChecker+Valid, 4300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:20,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 436 Invalid, 5317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1017 Valid, 4300 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-10 23:24:20,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43561 states. [2024-10-10 23:24:21,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43561 to 39806. [2024-10-10 23:24:21,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39806 states, 39805 states have (on average 1.2020097977641) internal successors, (47846), 39805 states have internal predecessors, (47846), 0 states have call successors, (0), 0 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:24:21,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39806 states to 39806 states and 47846 transitions. [2024-10-10 23:24:21,199 INFO L78 Accepts]: Start accepts. Automaton has 39806 states and 47846 transitions. Word has length 505 [2024-10-10 23:24:21,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:21,200 INFO L471 AbstractCegarLoop]: Abstraction has 39806 states and 47846 transitions. [2024-10-10 23:24:21,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 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:24:21,200 INFO L276 IsEmpty]: Start isEmpty. Operand 39806 states and 47846 transitions. [2024-10-10 23:24:21,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2024-10-10 23:24:21,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:21,226 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:24:21,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:24:21,227 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:21,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:21,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1886334648, now seen corresponding path program 1 times [2024-10-10 23:24:21,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:21,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296456437] [2024-10-10 23:24:21,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:21,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 197 proven. 108 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-10 23:24:22,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:22,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296456437] [2024-10-10 23:24:22,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296456437] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:24:22,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614204775] [2024-10-10 23:24:22,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:22,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:24:22,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:24:22,506 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:24:22,507 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:24:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:22,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-10 23:24:22,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:24:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 221 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:24:24,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:24:26,236 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-10 23:24:26,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614204775] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:24:26,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:24:26,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 5] total 9 [2024-10-10 23:24:26,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721936567] [2024-10-10 23:24:26,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:26,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:24:26,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:26,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:24:26,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:24:26,239 INFO L87 Difference]: Start difference. First operand 39806 states and 47846 transitions. Second operand has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 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:24:29,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:29,084 INFO L93 Difference]: Finished difference Result 89374 states and 108223 transitions. [2024-10-10 23:24:29,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:24:29,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 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 584 [2024-10-10 23:24:29,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:29,143 INFO L225 Difference]: With dead ends: 89374 [2024-10-10 23:24:29,143 INFO L226 Difference]: Without dead ends: 49569 [2024-10-10 23:24:29,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1170 GetRequests, 1163 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:24:29,166 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 471 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2114 mSolverCounterSat, 1122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 3236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1122 IncrementalHoareTripleChecker+Valid, 2114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:29,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 85 Invalid, 3236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1122 Valid, 2114 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:24:29,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49569 states. [2024-10-10 23:24:29,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49569 to 43561. [2024-10-10 23:24:29,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43561 states, 43560 states have (on average 1.2139348025711663) internal successors, (52879), 43560 states have internal predecessors, (52879), 0 states have call successors, (0), 0 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:24:29,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43561 states to 43561 states and 52879 transitions. [2024-10-10 23:24:29,637 INFO L78 Accepts]: Start accepts. Automaton has 43561 states and 52879 transitions. Word has length 584 [2024-10-10 23:24:29,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:29,638 INFO L471 AbstractCegarLoop]: Abstraction has 43561 states and 52879 transitions. [2024-10-10 23:24:29,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 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:24:29,639 INFO L276 IsEmpty]: Start isEmpty. Operand 43561 states and 52879 transitions. [2024-10-10 23:24:29,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2024-10-10 23:24:29,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:29,663 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:24:29,682 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:24:29,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:24:29,864 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:29,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:29,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1472189136, now seen corresponding path program 1 times [2024-10-10 23:24:29,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:29,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776178647] [2024-10-10 23:24:29,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:29,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 854 backedges. 677 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-10-10 23:24:30,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:30,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776178647] [2024-10-10 23:24:30,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776178647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:30,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:30,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:24:30,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890034427] [2024-10-10 23:24:30,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:30,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:24:30,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:30,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:24:30,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:24:30,308 INFO L87 Difference]: Start difference. First operand 43561 states and 52879 transitions. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 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:24:32,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:32,904 INFO L93 Difference]: Finished difference Result 93129 states and 113360 transitions. [2024-10-10 23:24:32,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:24:32,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 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 646 [2024-10-10 23:24:32,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:32,968 INFO L225 Difference]: With dead ends: 93129 [2024-10-10 23:24:32,968 INFO L226 Difference]: Without dead ends: 49569 [2024-10-10 23:24:33,004 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:24:33,005 INFO L432 NwaCegarLoop]: 1206 mSDtfsCounter, 704 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2255 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 2255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:33,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1213 Invalid, 2703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 2255 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:24:33,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49569 states. [2024-10-10 23:24:33,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49569 to 48818. [2024-10-10 23:24:33,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48818 states, 48817 states have (on average 1.1722145973738656) internal successors, (57224), 48817 states have internal predecessors, (57224), 0 states have call successors, (0), 0 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:24:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48818 states to 48818 states and 57224 transitions. [2024-10-10 23:24:33,462 INFO L78 Accepts]: Start accepts. Automaton has 48818 states and 57224 transitions. Word has length 646 [2024-10-10 23:24:33,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:33,463 INFO L471 AbstractCegarLoop]: Abstraction has 48818 states and 57224 transitions. [2024-10-10 23:24:33,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 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:24:33,464 INFO L276 IsEmpty]: Start isEmpty. Operand 48818 states and 57224 transitions. [2024-10-10 23:24:33,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2024-10-10 23:24:33,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:33,485 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:33,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:24:33,485 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:33,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:33,486 INFO L85 PathProgramCache]: Analyzing trace with hash 844974140, now seen corresponding path program 1 times [2024-10-10 23:24:33,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:33,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137782003] [2024-10-10 23:24:33,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:33,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:33,836 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 706 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-10-10 23:24:33,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:33,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137782003] [2024-10-10 23:24:33,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137782003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:33,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:33,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:24:33,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680154208] [2024-10-10 23:24:33,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:33,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:24:33,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:33,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:24:33,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:24:33,840 INFO L87 Difference]: Start difference. First operand 48818 states and 57224 transitions. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:24:36,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:36,719 INFO L93 Difference]: Finished difference Result 132932 states and 156664 transitions. [2024-10-10 23:24:36,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:24:36,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 656 [2024-10-10 23:24:36,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:36,825 INFO L225 Difference]: With dead ends: 132932 [2024-10-10 23:24:36,825 INFO L226 Difference]: Without dead ends: 84115 [2024-10-10 23:24:36,861 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:24:36,861 INFO L432 NwaCegarLoop]: 525 mSDtfsCounter, 702 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2286 mSolverCounterSat, 647 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 647 IncrementalHoareTripleChecker+Valid, 2286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:36,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 531 Invalid, 2933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [647 Valid, 2286 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:24:36,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84115 states. [2024-10-10 23:24:37,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84115 to 82613. [2024-10-10 23:24:37,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82613 states, 82612 states have (on average 1.1471456931196435) internal successors, (94768), 82612 states have internal predecessors, (94768), 0 states have call successors, (0), 0 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:24:37,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82613 states to 82613 states and 94768 transitions. [2024-10-10 23:24:37,578 INFO L78 Accepts]: Start accepts. Automaton has 82613 states and 94768 transitions. Word has length 656 [2024-10-10 23:24:37,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:37,579 INFO L471 AbstractCegarLoop]: Abstraction has 82613 states and 94768 transitions. [2024-10-10 23:24:37,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:24:37,579 INFO L276 IsEmpty]: Start isEmpty. Operand 82613 states and 94768 transitions. [2024-10-10 23:24:37,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2024-10-10 23:24:37,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:37,600 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:24:37,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:24:37,600 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:37,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:37,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2009817052, now seen corresponding path program 1 times [2024-10-10 23:24:37,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:37,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384113588] [2024-10-10 23:24:37,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:37,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:38,978 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 433 proven. 14 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-10-10 23:24:38,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:38,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384113588] [2024-10-10 23:24:38,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384113588] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:24:38,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129008597] [2024-10-10 23:24:38,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:38,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:24:38,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:24:38,981 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:24:38,982 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:24:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:39,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:24:39,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:24:39,578 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 433 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-10 23:24:39,579 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:24:39,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129008597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:39,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:24:39,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 23:24:39,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628292542] [2024-10-10 23:24:39,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:39,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:24:39,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:39,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:24:39,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:24:39,583 INFO L87 Difference]: Start difference. First operand 82613 states and 94768 transitions. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 2 states have internal predecessors, (447), 0 states have call successors, (0), 0 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:24:42,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:42,358 INFO L93 Difference]: Finished difference Result 196767 states and 225337 transitions. [2024-10-10 23:24:42,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:24:42,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 2 states have internal predecessors, (447), 0 states have call successors, (0), 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 678 [2024-10-10 23:24:42,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:42,496 INFO L225 Difference]: With dead ends: 196767 [2024-10-10 23:24:42,497 INFO L226 Difference]: Without dead ends: 114155 [2024-10-10 23:24:42,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 677 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:24:42,545 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 606 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2305 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 2671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 2305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:42,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 522 Invalid, 2671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 2305 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:24:42,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114155 states. [2024-10-10 23:24:43,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114155 to 107396. [2024-10-10 23:24:43,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107396 states, 107395 states have (on average 1.1303691978211277) internal successors, (121396), 107395 states have internal predecessors, (121396), 0 states have call successors, (0), 0 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:24:44,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107396 states to 107396 states and 121396 transitions. [2024-10-10 23:24:44,229 INFO L78 Accepts]: Start accepts. Automaton has 107396 states and 121396 transitions. Word has length 678 [2024-10-10 23:24:44,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:44,229 INFO L471 AbstractCegarLoop]: Abstraction has 107396 states and 121396 transitions. [2024-10-10 23:24:44,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 2 states have internal predecessors, (447), 0 states have call successors, (0), 0 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:24:44,230 INFO L276 IsEmpty]: Start isEmpty. Operand 107396 states and 121396 transitions. [2024-10-10 23:24:44,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2024-10-10 23:24:44,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:44,266 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:24:44,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-10 23:24:44,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:24:44,467 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:44,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:44,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1134975712, now seen corresponding path program 1 times [2024-10-10 23:24:44,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:44,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873602394] [2024-10-10 23:24:44,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:44,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:45,550 INFO L134 CoverageAnalysis]: Checked inductivity of 918 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-10 23:24:45,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:45,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873602394] [2024-10-10 23:24:45,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873602394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:45,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:45,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:24:45,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852935351] [2024-10-10 23:24:45,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:45,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:24:45,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:45,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:24:45,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:24:45,555 INFO L87 Difference]: Start difference. First operand 107396 states and 121396 transitions. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 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:24:48,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:48,231 INFO L93 Difference]: Finished difference Result 226807 states and 256289 transitions. [2024-10-10 23:24:48,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:24:48,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 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 678 [2024-10-10 23:24:48,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:48,590 INFO L225 Difference]: With dead ends: 226807 [2024-10-10 23:24:48,590 INFO L226 Difference]: Without dead ends: 119412 [2024-10-10 23:24:48,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:24:48,688 INFO L432 NwaCegarLoop]: 899 mSDtfsCounter, 795 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2138 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 2138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:48,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 906 Invalid, 2733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 2138 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:24:48,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119412 states.