./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/Problem03_label36.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label36.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 62e9241ba979767c8bca2756b2edfc882f7b20aa81fc6f783856c8cd54d80552 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:19:39,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:19:39,270 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:19:39,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:19:39,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:19:39,308 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:19:39,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:19:39,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:19:39,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:19:39,311 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:19:39,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:19:39,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:19:39,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:19:39,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:19:39,314 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:19:39,314 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:19:39,314 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:19:39,314 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:19:39,315 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:19:39,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:19:39,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:19:39,319 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:19:39,319 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:19:39,319 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:19:39,320 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:19:39,320 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:19:39,320 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:19:39,320 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:19:39,320 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:19:39,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:19:39,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:19:39,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:19:39,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:19:39,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:19:39,321 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:19:39,322 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:19:39,322 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:19:39,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:19:39,322 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:19:39,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:19:39,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:19:39,324 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:19:39,324 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 62e9241ba979767c8bca2756b2edfc882f7b20aa81fc6f783856c8cd54d80552 [2024-10-12 15:19:39,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:19:39,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:19:39,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:19:39,602 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:19:39,602 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:19:39,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label36.c [2024-10-12 15:19:41,001 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:19:41,273 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:19:41,274 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label36.c [2024-10-12 15:19:41,291 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be1c0a3cc/c981a8ed1b6444a7bdbace5a066e45dc/FLAGd2c1e4b79 [2024-10-12 15:19:41,569 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be1c0a3cc/c981a8ed1b6444a7bdbace5a066e45dc [2024-10-12 15:19:41,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:19:41,572 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:19:41,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:19:41,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:19:41,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:19:41,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:19:41" (1/1) ... [2024-10-12 15:19:41,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c16476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:41, skipping insertion in model container [2024-10-12 15:19:41,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:19:41" (1/1) ... [2024-10-12 15:19:41,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:19:42,056 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/Problem03_label36.c[58393,58406] [2024-10-12 15:19:42,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:19:42,096 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:19:42,220 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/Problem03_label36.c[58393,58406] [2024-10-12 15:19:42,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:19:42,248 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:19:42,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:42 WrapperNode [2024-10-12 15:19:42,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:19:42,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:19:42,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:19:42,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:19:42,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:42" (1/1) ... [2024-10-12 15:19:42,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:42" (1/1) ... [2024-10-12 15:19:42,350 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-10-12 15:19:42,351 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:19:42,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:19:42,352 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:19:42,352 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:19:42,361 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:42" (1/1) ... [2024-10-12 15:19:42,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:42" (1/1) ... [2024-10-12 15:19:42,367 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:42" (1/1) ... [2024-10-12 15:19:42,408 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-12 15:19:42,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:42" (1/1) ... [2024-10-12 15:19:42,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:42" (1/1) ... [2024-10-12 15:19:42,481 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:42" (1/1) ... [2024-10-12 15:19:42,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:42" (1/1) ... [2024-10-12 15:19:42,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:42" (1/1) ... [2024-10-12 15:19:42,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:42" (1/1) ... [2024-10-12 15:19:42,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:19:42,529 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:19:42,529 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:19:42,529 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:19:42,530 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:42" (1/1) ... [2024-10-12 15:19:42,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:19:42,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:19:42,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 15:19:42,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 15:19:42,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:19:42,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:19:42,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:19:42,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:19:42,682 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:19:42,684 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:19:44,142 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-12 15:19:44,143 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:19:44,185 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:19:44,186 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:19:44,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:19:44 BoogieIcfgContainer [2024-10-12 15:19:44,186 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:19:44,188 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:19:44,188 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:19:44,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:19:44,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:19:41" (1/3) ... [2024-10-12 15:19:44,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed0453c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:19:44, skipping insertion in model container [2024-10-12 15:19:44,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:42" (2/3) ... [2024-10-12 15:19:44,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed0453c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:19:44, skipping insertion in model container [2024-10-12 15:19:44,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:19:44" (3/3) ... [2024-10-12 15:19:44,193 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label36.c [2024-10-12 15:19:44,207 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:19:44,208 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:19:44,267 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:19:44,275 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;@31c8c091, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:19:44,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:19:44,281 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 0 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-12 15:19:44,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-12 15:19:44,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:44,297 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:19:44,297 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:44,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:44,303 INFO L85 PathProgramCache]: Analyzing trace with hash 512171391, now seen corresponding path program 1 times [2024-10-12 15:19:44,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:44,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936593877] [2024-10-12 15:19:44,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:44,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:44,774 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-12 15:19:44,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:44,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936593877] [2024-10-12 15:19:44,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936593877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:44,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:44,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:44,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925720339] [2024-10-12 15:19:44,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:44,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:19:44,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:44,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:19:44,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:19:44,809 INFO L87 Difference]: Start difference. First operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 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 89.0) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 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-12 15:19:44,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:44,849 INFO L93 Difference]: Finished difference Result 479 states and 913 transitions. [2024-10-12 15:19:44,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:19:44,852 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 89.0) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2024-10-12 15:19:44,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:44,861 INFO L225 Difference]: With dead ends: 479 [2024-10-12 15:19:44,861 INFO L226 Difference]: Without dead ends: 238 [2024-10-12 15:19:44,864 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-12 15:19:44,867 INFO L432 NwaCegarLoop]: 392 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, 392 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-12 15:19:44,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:19:44,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-12 15:19:44,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-12 15:19:44,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:44,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2024-10-12 15:19:44,918 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 178 [2024-10-12 15:19:44,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:44,923 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2024-10-12 15:19:44,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 89.0) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 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-12 15:19:44,923 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2024-10-12 15:19:44,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-12 15:19:44,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:44,928 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:19:44,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:19:44,929 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:44,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:44,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1099174822, now seen corresponding path program 1 times [2024-10-12 15:19:44,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:44,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357200728] [2024-10-12 15:19:44,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:44,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:45,313 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-12 15:19:45,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:45,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357200728] [2024-10-12 15:19:45,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357200728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:45,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:45,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:45,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410122711] [2024-10-12 15:19:45,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:45,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:45,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:45,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:45,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:45,317 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 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-12 15:19:46,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:46,125 INFO L93 Difference]: Finished difference Result 698 states and 1151 transitions. [2024-10-12 15:19:46,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:46,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2024-10-12 15:19:46,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:46,130 INFO L225 Difference]: With dead ends: 698 [2024-10-12 15:19:46,130 INFO L226 Difference]: Without dead ends: 461 [2024-10-12 15:19:46,131 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-12 15:19:46,132 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 77 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:46,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 148 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:19:46,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-10-12 15:19:46,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 459. [2024-10-12 15:19:46,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.539301310043668) internal successors, (705), 458 states have internal predecessors, (705), 0 states have call successors, (0), 0 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-12 15:19:46,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 705 transitions. [2024-10-12 15:19:46,148 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 705 transitions. Word has length 178 [2024-10-12 15:19:46,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:46,148 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 705 transitions. [2024-10-12 15:19:46,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 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-12 15:19:46,149 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 705 transitions. [2024-10-12 15:19:46,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-12 15:19:46,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:46,151 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:19:46,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:19:46,152 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:46,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:46,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1425034407, now seen corresponding path program 1 times [2024-10-12 15:19:46,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:46,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973363618] [2024-10-12 15:19:46,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:46,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:46,369 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:19:46,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:46,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973363618] [2024-10-12 15:19:46,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973363618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:46,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:46,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:46,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31181728] [2024-10-12 15:19:46,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:46,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:46,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:46,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:46,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:46,371 INFO L87 Difference]: Start difference. First operand 459 states and 705 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 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-12 15:19:47,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:47,076 INFO L93 Difference]: Finished difference Result 1343 states and 2078 transitions. [2024-10-12 15:19:47,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:47,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 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 186 [2024-10-12 15:19:47,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:47,079 INFO L225 Difference]: With dead ends: 1343 [2024-10-12 15:19:47,079 INFO L226 Difference]: Without dead ends: 885 [2024-10-12 15:19:47,081 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-12 15:19:47,082 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:47,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 88 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:19:47,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-10-12 15:19:47,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 869. [2024-10-12 15:19:47,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.5138248847926268) internal successors, (1314), 868 states have internal predecessors, (1314), 0 states have call successors, (0), 0 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-12 15:19:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1314 transitions. [2024-10-12 15:19:47,114 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1314 transitions. Word has length 186 [2024-10-12 15:19:47,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:47,115 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1314 transitions. [2024-10-12 15:19:47,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 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-12 15:19:47,115 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1314 transitions. [2024-10-12 15:19:47,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-12 15:19:47,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:47,123 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-10-12 15:19:47,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:19:47,124 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:47,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:47,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1359264694, now seen corresponding path program 1 times [2024-10-12 15:19:47,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:47,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074793904] [2024-10-12 15:19:47,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:47,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:47,645 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:19:47,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:47,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074793904] [2024-10-12 15:19:47,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074793904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:47,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:47,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:19:47,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838308535] [2024-10-12 15:19:47,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:47,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:19:47,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:47,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:19:47,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:19:47,648 INFO L87 Difference]: Start difference. First operand 869 states and 1314 transitions. Second operand has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 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-12 15:19:48,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:48,416 INFO L93 Difference]: Finished difference Result 1883 states and 2885 transitions. [2024-10-12 15:19:48,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:19:48,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 193 [2024-10-12 15:19:48,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:48,420 INFO L225 Difference]: With dead ends: 1883 [2024-10-12 15:19:48,420 INFO L226 Difference]: Without dead ends: 841 [2024-10-12 15:19:48,422 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-12 15:19:48,423 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 330 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:48,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 44 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:19:48,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2024-10-12 15:19:48,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 841. [2024-10-12 15:19:48,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 1.3654761904761905) internal successors, (1147), 840 states have internal predecessors, (1147), 0 states have call successors, (0), 0 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-12 15:19:48,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1147 transitions. [2024-10-12 15:19:48,438 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1147 transitions. Word has length 193 [2024-10-12 15:19:48,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:48,439 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1147 transitions. [2024-10-12 15:19:48,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 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-12 15:19:48,439 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1147 transitions. [2024-10-12 15:19:48,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-12 15:19:48,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:48,441 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:19:48,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:19:48,442 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:48,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:48,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1971158141, now seen corresponding path program 1 times [2024-10-12 15:19:48,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:48,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068964645] [2024-10-12 15:19:48,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:48,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:48,725 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:19:48,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:48,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068964645] [2024-10-12 15:19:48,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068964645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:48,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:48,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:48,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947710672] [2024-10-12 15:19:48,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:48,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:48,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:48,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:48,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:48,730 INFO L87 Difference]: Start difference. First operand 841 states and 1147 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-12 15:19:49,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:49,242 INFO L93 Difference]: Finished difference Result 2506 states and 3423 transitions. [2024-10-12 15:19:49,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:49,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 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 201 [2024-10-12 15:19:49,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:49,247 INFO L225 Difference]: With dead ends: 2506 [2024-10-12 15:19:49,247 INFO L226 Difference]: Without dead ends: 1666 [2024-10-12 15:19:49,248 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-12 15:19:49,252 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 230 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:49,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 47 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:19:49,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2024-10-12 15:19:49,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1657. [2024-10-12 15:19:49,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1656 states have (on average 1.3568840579710144) internal successors, (2247), 1656 states have internal predecessors, (2247), 0 states have call successors, (0), 0 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-12 15:19:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2247 transitions. [2024-10-12 15:19:49,276 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2247 transitions. Word has length 201 [2024-10-12 15:19:49,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:49,277 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2247 transitions. [2024-10-12 15:19:49,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-12 15:19:49,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2247 transitions. [2024-10-12 15:19:49,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-12 15:19:49,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:49,281 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:19:49,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:19:49,281 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:49,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:49,282 INFO L85 PathProgramCache]: Analyzing trace with hash 383531451, now seen corresponding path program 1 times [2024-10-12 15:19:49,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:49,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083820792] [2024-10-12 15:19:49,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:49,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:49,500 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:19:49,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:49,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083820792] [2024-10-12 15:19:49,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083820792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:49,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:49,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:49,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134562169] [2024-10-12 15:19:49,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:49,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:49,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:49,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:49,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:49,503 INFO L87 Difference]: Start difference. First operand 1657 states and 2247 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 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-12 15:19:50,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:50,050 INFO L93 Difference]: Finished difference Result 4951 states and 6719 transitions. [2024-10-12 15:19:50,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:50,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2024-10-12 15:19:50,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:50,060 INFO L225 Difference]: With dead ends: 4951 [2024-10-12 15:19:50,060 INFO L226 Difference]: Without dead ends: 3295 [2024-10-12 15:19:50,063 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-12 15:19:50,063 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 205 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:50,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 118 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:19:50,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3295 states. [2024-10-12 15:19:50,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3295 to 3287. [2024-10-12 15:19:50,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3287 states, 3286 states have (on average 1.3429701765063908) internal successors, (4413), 3286 states have internal predecessors, (4413), 0 states have call successors, (0), 0 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-12 15:19:50,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3287 states to 3287 states and 4413 transitions. [2024-10-12 15:19:50,114 INFO L78 Accepts]: Start accepts. Automaton has 3287 states and 4413 transitions. Word has length 204 [2024-10-12 15:19:50,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:50,114 INFO L471 AbstractCegarLoop]: Abstraction has 3287 states and 4413 transitions. [2024-10-12 15:19:50,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 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-12 15:19:50,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3287 states and 4413 transitions. [2024-10-12 15:19:50,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-12 15:19:50,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:50,120 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:19:50,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 15:19:50,120 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:50,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:50,120 INFO L85 PathProgramCache]: Analyzing trace with hash -53653504, now seen corresponding path program 1 times [2024-10-12 15:19:50,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:50,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591743344] [2024-10-12 15:19:50,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:50,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:50,329 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:19:50,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:50,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591743344] [2024-10-12 15:19:50,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591743344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:50,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:50,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:50,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959307602] [2024-10-12 15:19:50,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:50,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:50,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:50,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:50,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:50,332 INFO L87 Difference]: Start difference. First operand 3287 states and 4413 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 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-12 15:19:50,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:50,942 INFO L93 Difference]: Finished difference Result 8212 states and 11000 transitions. [2024-10-12 15:19:50,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:50,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2024-10-12 15:19:50,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:50,956 INFO L225 Difference]: With dead ends: 8212 [2024-10-12 15:19:50,957 INFO L226 Difference]: Without dead ends: 4926 [2024-10-12 15:19:50,962 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-12 15:19:50,964 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 203 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:50,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 55 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:19:50,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4926 states. [2024-10-12 15:19:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4926 to 4923. [2024-10-12 15:19:51,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4923 states, 4922 states have (on average 1.334213734254368) internal successors, (6567), 4922 states have internal predecessors, (6567), 0 states have call successors, (0), 0 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-12 15:19:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4923 states to 4923 states and 6567 transitions. [2024-10-12 15:19:51,045 INFO L78 Accepts]: Start accepts. Automaton has 4923 states and 6567 transitions. Word has length 206 [2024-10-12 15:19:51,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:51,045 INFO L471 AbstractCegarLoop]: Abstraction has 4923 states and 6567 transitions. [2024-10-12 15:19:51,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 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-12 15:19:51,046 INFO L276 IsEmpty]: Start isEmpty. Operand 4923 states and 6567 transitions. [2024-10-12 15:19:51,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-12 15:19:51,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:51,053 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:19:51,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:19:51,054 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:51,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:51,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1000138171, now seen corresponding path program 1 times [2024-10-12 15:19:51,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:51,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727050881] [2024-10-12 15:19:51,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:51,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:51,334 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:19:51,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:51,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727050881] [2024-10-12 15:19:51,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727050881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:51,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:51,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:51,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602170339] [2024-10-12 15:19:51,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:51,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:51,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:51,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:51,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:51,337 INFO L87 Difference]: Start difference. First operand 4923 states and 6567 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 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-12 15:19:51,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:51,986 INFO L93 Difference]: Finished difference Result 14746 states and 19678 transitions. [2024-10-12 15:19:51,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:51,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2024-10-12 15:19:51,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:52,016 INFO L225 Difference]: With dead ends: 14746 [2024-10-12 15:19:52,017 INFO L226 Difference]: Without dead ends: 9824 [2024-10-12 15:19:52,025 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-12 15:19:52,025 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 200 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:52,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 106 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:19:52,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9824 states. [2024-10-12 15:19:52,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9824 to 9811. [2024-10-12 15:19:52,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9811 states, 9810 states have (on average 1.3283384301732926) internal successors, (13031), 9810 states have internal predecessors, (13031), 0 states have call successors, (0), 0 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-12 15:19:52,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9811 states to 9811 states and 13031 transitions. [2024-10-12 15:19:52,214 INFO L78 Accepts]: Start accepts. Automaton has 9811 states and 13031 transitions. Word has length 208 [2024-10-12 15:19:52,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:52,214 INFO L471 AbstractCegarLoop]: Abstraction has 9811 states and 13031 transitions. [2024-10-12 15:19:52,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 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-12 15:19:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand 9811 states and 13031 transitions. [2024-10-12 15:19:52,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-12 15:19:52,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:52,226 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:19:52,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 15:19:52,226 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:52,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:52,227 INFO L85 PathProgramCache]: Analyzing trace with hash 382129169, now seen corresponding path program 1 times [2024-10-12 15:19:52,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:52,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786539223] [2024-10-12 15:19:52,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:52,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:52,687 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:19:52,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:52,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786539223] [2024-10-12 15:19:52,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786539223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:52,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:52,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:19:52,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019162102] [2024-10-12 15:19:52,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:52,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:19:52,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:52,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:19:52,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:19:52,691 INFO L87 Difference]: Start difference. First operand 9811 states and 13031 transitions. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 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-12 15:19:53,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:53,769 INFO L93 Difference]: Finished difference Result 26482 states and 35143 transitions. [2024-10-12 15:19:53,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:19:53,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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 209 [2024-10-12 15:19:53,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:53,808 INFO L225 Difference]: With dead ends: 26482 [2024-10-12 15:19:53,809 INFO L226 Difference]: Without dead ends: 16324 [2024-10-12 15:19:53,824 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-12 15:19:53,825 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 198 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:53,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 111 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 15:19:53,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16324 states. [2024-10-12 15:19:54,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16324 to 16323. [2024-10-12 15:19:54,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16323 states, 16322 states have (on average 1.308724421026835) internal successors, (21361), 16322 states have internal predecessors, (21361), 0 states have call successors, (0), 0 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-12 15:19:54,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16323 states to 16323 states and 21361 transitions. [2024-10-12 15:19:54,091 INFO L78 Accepts]: Start accepts. Automaton has 16323 states and 21361 transitions. Word has length 209 [2024-10-12 15:19:54,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:54,091 INFO L471 AbstractCegarLoop]: Abstraction has 16323 states and 21361 transitions. [2024-10-12 15:19:54,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 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-12 15:19:54,092 INFO L276 IsEmpty]: Start isEmpty. Operand 16323 states and 21361 transitions. [2024-10-12 15:19:54,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-12 15:19:54,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:54,105 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:54,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 15:19:54,105 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:54,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:54,109 INFO L85 PathProgramCache]: Analyzing trace with hash 910860687, now seen corresponding path program 1 times [2024-10-12 15:19:54,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:54,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385195660] [2024-10-12 15:19:54,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:54,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:54,387 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:19:54,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:54,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385195660] [2024-10-12 15:19:54,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385195660] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:19:54,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329997938] [2024-10-12 15:19:54,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:54,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:19:54,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:19:54,393 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:19:54,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 15:19:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:54,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:19:54,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:19:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-12 15:19:54,780 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:19:54,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329997938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:54,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:19:54,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-12 15:19:54,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739979037] [2024-10-12 15:19:54,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:54,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:54,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:54,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:54,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:19:54,785 INFO L87 Difference]: Start difference. First operand 16323 states and 21361 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 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-12 15:19:55,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:55,503 INFO L93 Difference]: Finished difference Result 45071 states and 59111 transitions. [2024-10-12 15:19:55,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:55,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 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 213 [2024-10-12 15:19:55,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:55,554 INFO L225 Difference]: With dead ends: 45071 [2024-10-12 15:19:55,554 INFO L226 Difference]: Without dead ends: 28749 [2024-10-12 15:19:55,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:19:55,574 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 70 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:55,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 71 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:19:55,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28749 states. [2024-10-12 15:19:55,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28749 to 28747. [2024-10-12 15:19:55,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28747 states, 28746 states have (on average 1.2863702776038406) internal successors, (36978), 28746 states have internal predecessors, (36978), 0 states have call successors, (0), 0 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-12 15:19:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28747 states to 28747 states and 36978 transitions. [2024-10-12 15:19:56,011 INFO L78 Accepts]: Start accepts. Automaton has 28747 states and 36978 transitions. Word has length 213 [2024-10-12 15:19:56,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:56,012 INFO L471 AbstractCegarLoop]: Abstraction has 28747 states and 36978 transitions. [2024-10-12 15:19:56,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 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-12 15:19:56,013 INFO L276 IsEmpty]: Start isEmpty. Operand 28747 states and 36978 transitions. [2024-10-12 15:19:56,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-12 15:19:56,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:56,035 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:19:56,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 15:19:56,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-12 15:19:56,237 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:56,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:56,238 INFO L85 PathProgramCache]: Analyzing trace with hash 893183010, now seen corresponding path program 1 times [2024-10-12 15:19:56,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:56,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528878135] [2024-10-12 15:19:56,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:56,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:56,568 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:19:56,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:56,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528878135] [2024-10-12 15:19:56,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528878135] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:19:56,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055696487] [2024-10-12 15:19:56,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:56,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:19:56,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:19:56,571 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:19:56,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 15:19:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:56,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:19:56,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:19:56,917 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-12 15:19:56,918 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:19:56,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055696487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:56,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:19:56,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:19:56,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509342926] [2024-10-12 15:19:56,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:56,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:56,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:56,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:56,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:19:56,920 INFO L87 Difference]: Start difference. First operand 28747 states and 36978 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 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-12 15:19:57,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:57,692 INFO L93 Difference]: Finished difference Result 56081 states and 72202 transitions. [2024-10-12 15:19:57,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:57,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 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 216 [2024-10-12 15:19:57,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:57,733 INFO L225 Difference]: With dead ends: 56081 [2024-10-12 15:19:57,733 INFO L226 Difference]: Without dead ends: 27538 [2024-10-12 15:19:57,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:19:57,752 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 45 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:57,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 316 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:19:57,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27538 states. [2024-10-12 15:19:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27538 to 27529. [2024-10-12 15:19:58,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27529 states, 27528 states have (on average 1.2775356001162452) internal successors, (35168), 27528 states have internal predecessors, (35168), 0 states have call successors, (0), 0 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-12 15:19:58,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27529 states to 27529 states and 35168 transitions. [2024-10-12 15:19:58,039 INFO L78 Accepts]: Start accepts. Automaton has 27529 states and 35168 transitions. Word has length 216 [2024-10-12 15:19:58,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:58,040 INFO L471 AbstractCegarLoop]: Abstraction has 27529 states and 35168 transitions. [2024-10-12 15:19:58,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 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-12 15:19:58,040 INFO L276 IsEmpty]: Start isEmpty. Operand 27529 states and 35168 transitions. [2024-10-12 15:19:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-12 15:19:58,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:58,061 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:19:58,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 15:19:58,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-12 15:19:58,262 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:58,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:58,264 INFO L85 PathProgramCache]: Analyzing trace with hash -2069134082, now seen corresponding path program 1 times [2024-10-12 15:19:58,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:58,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331207697] [2024-10-12 15:19:58,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:58,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:58,572 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:19:58,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:58,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331207697] [2024-10-12 15:19:58,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331207697] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:19:58,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954989449] [2024-10-12 15:19:58,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:58,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:19:58,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:19:58,575 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:19:58,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 15:19:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:58,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:19:58,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:19:58,858 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 15:19:58,858 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:19:58,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954989449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:58,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:19:58,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:19:58,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694068429] [2024-10-12 15:19:58,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:58,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:58,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:58,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:58,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:19:58,860 INFO L87 Difference]: Start difference. First operand 27529 states and 35168 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 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-12 15:19:59,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:59,593 INFO L93 Difference]: Finished difference Result 67641 states and 86328 transitions. [2024-10-12 15:19:59,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:59,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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 222 [2024-10-12 15:19:59,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:59,648 INFO L225 Difference]: With dead ends: 67641 [2024-10-12 15:19:59,648 INFO L226 Difference]: Without dead ends: 40316 [2024-10-12 15:19:59,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:19:59,674 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 40 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:59,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 340 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:19:59,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40316 states. [2024-10-12 15:20:00,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40316 to 32190. [2024-10-12 15:20:00,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32190 states, 32189 states have (on average 1.2113454906955792) internal successors, (38992), 32189 states have internal predecessors, (38992), 0 states have call successors, (0), 0 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-12 15:20:00,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32190 states to 32190 states and 38992 transitions. [2024-10-12 15:20:00,251 INFO L78 Accepts]: Start accepts. Automaton has 32190 states and 38992 transitions. Word has length 222 [2024-10-12 15:20:00,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:00,251 INFO L471 AbstractCegarLoop]: Abstraction has 32190 states and 38992 transitions. [2024-10-12 15:20:00,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 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-12 15:20:00,252 INFO L276 IsEmpty]: Start isEmpty. Operand 32190 states and 38992 transitions. [2024-10-12 15:20:00,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-12 15:20:00,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:00,277 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:20:00,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 15:20:00,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:00,482 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:00,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:00,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2026909118, now seen corresponding path program 1 times [2024-10-12 15:20:00,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:00,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315647850] [2024-10-12 15:20:00,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:00,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:00,750 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:20:00,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:00,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315647850] [2024-10-12 15:20:00,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315647850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:00,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:00,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:20:00,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933506196] [2024-10-12 15:20:00,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:00,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:00,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:00,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:00,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:20:00,753 INFO L87 Difference]: Start difference. First operand 32190 states and 38992 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 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-12 15:20:01,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:01,471 INFO L93 Difference]: Finished difference Result 77573 states and 94964 transitions. [2024-10-12 15:20:01,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:01,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 232 [2024-10-12 15:20:01,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:01,523 INFO L225 Difference]: With dead ends: 77573 [2024-10-12 15:20:01,524 INFO L226 Difference]: Without dead ends: 45791 [2024-10-12 15:20:01,551 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-12 15:20:01,551 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 210 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:01,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 124 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:20:01,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45791 states. [2024-10-12 15:20:01,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45791 to 45791. [2024-10-12 15:20:01,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45791 states, 45790 states have (on average 1.136754749945403) internal successors, (52052), 45790 states have internal predecessors, (52052), 0 states have call successors, (0), 0 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-12 15:20:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45791 states to 45791 states and 52052 transitions. [2024-10-12 15:20:02,245 INFO L78 Accepts]: Start accepts. Automaton has 45791 states and 52052 transitions. Word has length 232 [2024-10-12 15:20:02,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:02,246 INFO L471 AbstractCegarLoop]: Abstraction has 45791 states and 52052 transitions. [2024-10-12 15:20:02,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 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-12 15:20:02,246 INFO L276 IsEmpty]: Start isEmpty. Operand 45791 states and 52052 transitions. [2024-10-12 15:20:02,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-10-12 15:20:02,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:02,274 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:20:02,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 15:20:02,274 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:02,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:02,275 INFO L85 PathProgramCache]: Analyzing trace with hash -934429327, now seen corresponding path program 1 times [2024-10-12 15:20:02,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:02,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223489053] [2024-10-12 15:20:02,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:02,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:02,460 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:20:02,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:02,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223489053] [2024-10-12 15:20:02,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223489053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:02,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:02,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:20:02,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164366222] [2024-10-12 15:20:02,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:02,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:02,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:02,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:02,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:20:02,463 INFO L87 Difference]: Start difference. First operand 45791 states and 52052 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:03,254 INFO L93 Difference]: Finished difference Result 108659 states and 123833 transitions. [2024-10-12 15:20:03,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:03,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2024-10-12 15:20:03,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:03,328 INFO L225 Difference]: With dead ends: 108659 [2024-10-12 15:20:03,328 INFO L226 Difference]: Without dead ends: 63276 [2024-10-12 15:20:03,362 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-12 15:20:03,362 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 56 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:03,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 308 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:20:03,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63276 states. [2024-10-12 15:20:04,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63276 to 63267. [2024-10-12 15:20:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63267 states, 63266 states have (on average 1.1274618278380173) internal successors, (71330), 63266 states have internal predecessors, (71330), 0 states have call successors, (0), 0 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-12 15:20:04,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63267 states to 63267 states and 71330 transitions. [2024-10-12 15:20:04,371 INFO L78 Accepts]: Start accepts. Automaton has 63267 states and 71330 transitions. Word has length 274 [2024-10-12 15:20:04,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:04,372 INFO L471 AbstractCegarLoop]: Abstraction has 63267 states and 71330 transitions. [2024-10-12 15:20:04,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:04,372 INFO L276 IsEmpty]: Start isEmpty. Operand 63267 states and 71330 transitions. [2024-10-12 15:20:04,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-10-12 15:20:04,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:04,398 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:20:04,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 15:20:04,398 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:04,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:04,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1187228125, now seen corresponding path program 1 times [2024-10-12 15:20:04,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:04,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181535021] [2024-10-12 15:20:04,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:04,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:04,880 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 68 proven. 6 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-12 15:20:04,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:04,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181535021] [2024-10-12 15:20:04,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181535021] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:04,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326260045] [2024-10-12 15:20:04,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:04,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:04,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:04,883 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:20:04,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 15:20:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:05,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:20:05,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:05,251 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-12 15:20:05,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:05,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326260045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:05,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:05,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:20:05,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804104485] [2024-10-12 15:20:05,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:05,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:05,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:05,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:05,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:05,253 INFO L87 Difference]: Start difference. First operand 63267 states and 71330 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:06,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:06,015 INFO L93 Difference]: Finished difference Result 125523 states and 141610 transitions. [2024-10-12 15:20:06,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:06,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 286 [2024-10-12 15:20:06,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:06,099 INFO L225 Difference]: With dead ends: 125523 [2024-10-12 15:20:06,099 INFO L226 Difference]: Without dead ends: 62664 [2024-10-12 15:20:06,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:06,147 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 84 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:06,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 274 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:20:06,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62664 states. [2024-10-12 15:20:06,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62664 to 62252. [2024-10-12 15:20:06,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62252 states, 62251 states have (on average 1.1212831922378756) internal successors, (69801), 62251 states have internal predecessors, (69801), 0 states have call successors, (0), 0 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-12 15:20:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62252 states to 62252 states and 69801 transitions. [2024-10-12 15:20:06,971 INFO L78 Accepts]: Start accepts. Automaton has 62252 states and 69801 transitions. Word has length 286 [2024-10-12 15:20:06,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:06,971 INFO L471 AbstractCegarLoop]: Abstraction has 62252 states and 69801 transitions. [2024-10-12 15:20:06,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:06,972 INFO L276 IsEmpty]: Start isEmpty. Operand 62252 states and 69801 transitions. [2024-10-12 15:20:06,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-10-12 15:20:06,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:06,999 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:20:07,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 15:20:07,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-12 15:20:07,200 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:07,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:07,200 INFO L85 PathProgramCache]: Analyzing trace with hash 299852992, now seen corresponding path program 1 times [2024-10-12 15:20:07,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:07,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132204010] [2024-10-12 15:20:07,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:07,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:07,746 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-10-12 15:20:07,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:07,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132204010] [2024-10-12 15:20:07,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132204010] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:07,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632697949] [2024-10-12 15:20:07,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:07,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:07,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:07,748 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:20:07,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 15:20:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:07,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:20:07,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:08,025 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-12 15:20:08,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:08,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632697949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:08,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:08,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:20:08,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762110197] [2024-10-12 15:20:08,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:08,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:08,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:08,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:08,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:08,028 INFO L87 Difference]: Start difference. First operand 62252 states and 69801 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 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-12 15:20:08,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:08,836 INFO L93 Difference]: Finished difference Result 111267 states and 124569 transitions. [2024-10-12 15:20:08,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:08,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 328 [2024-10-12 15:20:08,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:08,906 INFO L225 Difference]: With dead ends: 111267 [2024-10-12 15:20:08,906 INFO L226 Difference]: Without dead ends: 49423 [2024-10-12 15:20:08,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:08,948 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 200 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:08,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 309 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:20:08,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49423 states. [2024-10-12 15:20:09,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49423 to 48608. [2024-10-12 15:20:09,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48608 states, 48607 states have (on average 1.0965910259839118) internal successors, (53302), 48607 states have internal predecessors, (53302), 0 states have call successors, (0), 0 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-12 15:20:09,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48608 states to 48608 states and 53302 transitions. [2024-10-12 15:20:09,759 INFO L78 Accepts]: Start accepts. Automaton has 48608 states and 53302 transitions. Word has length 328 [2024-10-12 15:20:09,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:09,759 INFO L471 AbstractCegarLoop]: Abstraction has 48608 states and 53302 transitions. [2024-10-12 15:20:09,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 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-12 15:20:09,760 INFO L276 IsEmpty]: Start isEmpty. Operand 48608 states and 53302 transitions. [2024-10-12 15:20:09,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2024-10-12 15:20:09,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:09,788 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:20:09,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-12 15:20:09,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-12 15:20:09,989 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:09,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:09,989 INFO L85 PathProgramCache]: Analyzing trace with hash -325765968, now seen corresponding path program 1 times [2024-10-12 15:20:09,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:09,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970682211] [2024-10-12 15:20:09,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:09,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:10,424 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-10-12 15:20:10,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:10,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970682211] [2024-10-12 15:20:10,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970682211] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:10,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540436910] [2024-10-12 15:20:10,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:10,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:10,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:10,426 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:20:10,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 15:20:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:10,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:20:10,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:10,682 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:20:10,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:10,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540436910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:10,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:10,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:20:10,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755654966] [2024-10-12 15:20:10,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:10,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:10,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:10,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:10,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:10,684 INFO L87 Difference]: Start difference. First operand 48608 states and 53302 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:11,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:11,356 INFO L93 Difference]: Finished difference Result 92739 states and 101681 transitions. [2024-10-12 15:20:11,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:11,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 346 [2024-10-12 15:20:11,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:11,410 INFO L225 Difference]: With dead ends: 92739 [2024-10-12 15:20:11,410 INFO L226 Difference]: Without dead ends: 44742 [2024-10-12 15:20:11,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:11,438 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 111 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:11,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 287 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:20:11,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44742 states. [2024-10-12 15:20:12,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44742 to 39459. [2024-10-12 15:20:12,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39459 states, 39458 states have (on average 1.0767398246236504) internal successors, (42486), 39458 states have internal predecessors, (42486), 0 states have call successors, (0), 0 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-12 15:20:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39459 states to 39459 states and 42486 transitions. [2024-10-12 15:20:12,260 INFO L78 Accepts]: Start accepts. Automaton has 39459 states and 42486 transitions. Word has length 346 [2024-10-12 15:20:12,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:12,261 INFO L471 AbstractCegarLoop]: Abstraction has 39459 states and 42486 transitions. [2024-10-12 15:20:12,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:12,261 INFO L276 IsEmpty]: Start isEmpty. Operand 39459 states and 42486 transitions. [2024-10-12 15:20:12,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2024-10-12 15:20:12,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:12,299 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:20:12,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-12 15:20:12,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-12 15:20:12,500 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:12,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:12,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1942716751, now seen corresponding path program 1 times [2024-10-12 15:20:12,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:12,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397576762] [2024-10-12 15:20:12,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:12,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-10-12 15:20:12,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:12,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397576762] [2024-10-12 15:20:12,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397576762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:12,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:12,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:20:12,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408296525] [2024-10-12 15:20:12,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:12,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:12,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:12,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:12,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:20:12,720 INFO L87 Difference]: Start difference. First operand 39459 states and 42486 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 2 states have internal predecessors, (304), 0 states have call successors, (0), 0 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-12 15:20:13,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:13,196 INFO L93 Difference]: Finished difference Result 113901 states and 122629 transitions. [2024-10-12 15:20:13,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:13,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 2 states have internal predecessors, (304), 0 states have call successors, (0), 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 396 [2024-10-12 15:20:13,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:13,284 INFO L225 Difference]: With dead ends: 113901 [2024-10-12 15:20:13,284 INFO L226 Difference]: Without dead ends: 75459 [2024-10-12 15:20:13,304 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-12 15:20:13,305 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 185 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:13,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 483 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:20:13,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75459 states. [2024-10-12 15:20:13,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75459 to 68145. [2024-10-12 15:20:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68145 states, 68144 states have (on average 1.0788770838224935) internal successors, (73519), 68144 states have internal predecessors, (73519), 0 states have call successors, (0), 0 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-12 15:20:14,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68145 states to 68145 states and 73519 transitions. [2024-10-12 15:20:14,083 INFO L78 Accepts]: Start accepts. Automaton has 68145 states and 73519 transitions. Word has length 396 [2024-10-12 15:20:14,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:14,083 INFO L471 AbstractCegarLoop]: Abstraction has 68145 states and 73519 transitions. [2024-10-12 15:20:14,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 2 states have internal predecessors, (304), 0 states have call successors, (0), 0 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-12 15:20:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 68145 states and 73519 transitions. [2024-10-12 15:20:14,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2024-10-12 15:20:14,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:14,107 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:20:14,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 15:20:14,107 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:14,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:14,108 INFO L85 PathProgramCache]: Analyzing trace with hash -602761134, now seen corresponding path program 1 times [2024-10-12 15:20:14,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:14,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886110459] [2024-10-12 15:20:14,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:14,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-10-12 15:20:14,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:14,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886110459] [2024-10-12 15:20:14,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886110459] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:14,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707172348] [2024-10-12 15:20:14,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:14,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:14,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:14,771 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:20:14,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 15:20:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:14,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:20:14,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:15,121 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-10-12 15:20:15,122 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:15,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707172348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:15,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:15,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:20:15,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570630106] [2024-10-12 15:20:15,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:15,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:15,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:15,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:15,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:15,124 INFO L87 Difference]: Start difference. First operand 68145 states and 73519 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:15,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:15,932 INFO L93 Difference]: Finished difference Result 149313 states and 161081 transitions. [2024-10-12 15:20:15,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:15,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 400 [2024-10-12 15:20:15,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:15,935 INFO L225 Difference]: With dead ends: 149313 [2024-10-12 15:20:15,935 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 15:20:15,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:15,982 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 51 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:15,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 316 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:20:15,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 15:20:15,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 15:20:15,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:15,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 15:20:15,984 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 400 [2024-10-12 15:20:15,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:15,984 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 15:20:15,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:15,984 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 15:20:15,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 15:20:15,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:20:16,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-12 15:20:16,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:16,191 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:20:16,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 15:20:23,036 WARN L286 SmtUtils]: Spent 6.84s on a formula simplification. DAG size of input: 527 DAG size of output: 515 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-12 15:20:27,450 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:20:27,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:20:27 BoogieIcfgContainer [2024-10-12 15:20:27,495 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:20:27,496 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:20:27,496 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:20:27,496 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:20:27,496 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:19:44" (3/4) ... [2024-10-12 15:20:27,505 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 15:20:27,537 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-12 15:20:27,539 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 15:20:27,541 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 15:20:27,543 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 15:20:27,749 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 15:20:27,750 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 15:20:27,750 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:20:27,750 INFO L158 Benchmark]: Toolchain (without parser) took 46177.77ms. Allocated memory was 155.2MB in the beginning and 11.0GB in the end (delta: 10.8GB). Free memory was 82.2MB in the beginning and 4.1GB in the end (delta: -4.1GB). Peak memory consumption was 6.8GB. Max. memory is 16.1GB. [2024-10-12 15:20:27,750 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 155.2MB. Free memory is still 112.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:20:27,750 INFO L158 Benchmark]: CACSL2BoogieTranslator took 670.51ms. Allocated memory is still 155.2MB. Free memory was 82.0MB in the beginning and 67.7MB in the end (delta: 14.3MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-10-12 15:20:27,751 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.44ms. Allocated memory is still 155.2MB. Free memory was 67.7MB in the beginning and 52.5MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 15:20:27,751 INFO L158 Benchmark]: Boogie Preprocessor took 176.90ms. Allocated memory is still 155.2MB. Free memory was 52.5MB in the beginning and 109.8MB in the end (delta: -57.3MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2024-10-12 15:20:27,751 INFO L158 Benchmark]: RCFGBuilder took 1657.32ms. Allocated memory was 155.2MB in the beginning and 230.7MB in the end (delta: 75.5MB). Free memory was 109.8MB in the beginning and 102.6MB in the end (delta: 7.2MB). Peak memory consumption was 100.0MB. Max. memory is 16.1GB. [2024-10-12 15:20:27,751 INFO L158 Benchmark]: TraceAbstraction took 43307.40ms. Allocated memory was 230.7MB in the beginning and 11.0GB in the end (delta: 10.7GB). Free memory was 101.5MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 6.7GB. Max. memory is 16.1GB. [2024-10-12 15:20:27,751 INFO L158 Benchmark]: Witness Printer took 254.15ms. Allocated memory is still 11.0GB. Free memory was 4.2GB in the beginning and 4.1GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-12 15:20:27,753 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 155.2MB. Free memory is still 112.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 670.51ms. Allocated memory is still 155.2MB. Free memory was 82.0MB in the beginning and 67.7MB in the end (delta: 14.3MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.44ms. Allocated memory is still 155.2MB. Free memory was 67.7MB in the beginning and 52.5MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 176.90ms. Allocated memory is still 155.2MB. Free memory was 52.5MB in the beginning and 109.8MB in the end (delta: -57.3MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1657.32ms. Allocated memory was 155.2MB in the beginning and 230.7MB in the end (delta: 75.5MB). Free memory was 109.8MB in the beginning and 102.6MB in the end (delta: 7.2MB). Peak memory consumption was 100.0MB. Max. memory is 16.1GB. * TraceAbstraction took 43307.40ms. Allocated memory was 230.7MB in the beginning and 11.0GB in the end (delta: 10.7GB). Free memory was 101.5MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 6.7GB. Max. memory is 16.1GB. * Witness Printer took 254.15ms. Allocated memory is still 11.0GB. Free memory was 4.2GB in the beginning and 4.1GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1582]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 240 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.9s, OverallIterations: 19, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2744 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2744 mSDsluCounter, 3937 SdHoareTripleChecker+Invalid, 8.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 552 mSDsCounter, 1407 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10252 IncrementalHoareTripleChecker+Invalid, 11659 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1407 mSolverCounterUnsat, 3385 mSDtfsCounter, 10252 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2053 GetRequests, 2019 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68145occurred in iteration=18, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.9s AutomataMinimizationTime, 19 MinimizatonAttempts, 22022 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 6687 NumberOfCodeBlocks, 6687 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 6661 ConstructedInterpolants, 0 QuantifiedInterpolants, 20753 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3634 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 26 InterpolantComputations, 19 PerfectInterpolantSequences, 2830/2872 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1668]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((a5 == 1) && (a3 <= 0)) && (a11 == 1)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0)) || ((((((a26 == 0) && (a5 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || (((((((a5 == 1) && (a12 == 1)) && (a3 <= 0)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || (((((a5 == 1) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1))) || (((((((a26 == 1) && (a5 == 1)) && (a3 == 1)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a6 == 1)) && (a18 == 1)) && (a27 <= 0))) || ((((((a5 == 1) && (2 <= a3)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) && (a18 == 1))) || ((((((a5 == 1) && (a11 == 1)) && (a3 == 1)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || ((((((((a26 == 0) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a3 == 1)) && (a6 == 1)) && (a18 == 1)) && (a27 <= 0))) || ((((((a5 == 1) && (a3 <= 0)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || ((((((a26 == 0) && (a5 == 1)) && (a11 == 1)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || (((((((a26 == 0) && (a5 == 1)) && (2 <= a3)) && (a11 == 1)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || (((((((a26 == 0) && (a5 == 1)) && (a3 == 1)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a3 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a3 == 1)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || ((((((((a7 <= 0) && (a5 == 1)) && (a12 == 1)) && (a3 <= 0)) && (a6 == 1)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a3 <= 0)) && (a11 == 1)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || (((((((a26 == 0) && (a5 == 1)) && (2 <= a3)) && (a6 == 1)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) && (a18 == 1))) || (((((((a5 == 1) && (a12 == 1)) && (a3 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0))) || ((((((a5 == 1) && (a3 <= 0)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) && (a18 == 1))) || ((((((a26 == 1) && (a5 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || (((((((a15 == 1) && (a5 == 1)) && (2 <= a3)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) RESULT: Ultimate proved your program to be correct! [2024-10-12 15:20:27,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE