./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/Problem13_label15.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label15.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9fbc20983083f465b3eede57a226cc56a0e48515578e64c31c2db7f869f449ac --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:27:21,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:27:21,249 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:27:21,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:27:21,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:27:21,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:27:21,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:27:21,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:27:21,301 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:27:21,302 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:27:21,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:27:21,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:27:21,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:27:21,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:27:21,306 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:27:21,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:27:21,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:27:21,307 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:27:21,307 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:27:21,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:27:21,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:27:21,308 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:27:21,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:27:21,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:27:21,309 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:27:21,310 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:27:21,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:27:21,310 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:27:21,311 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:27:21,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:27:21,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:27:21,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:27:21,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:27:21,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:27:21,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:27:21,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:27:21,313 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:27:21,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:27:21,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:27:21,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:27:21,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:27:21,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:27:21,315 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9fbc20983083f465b3eede57a226cc56a0e48515578e64c31c2db7f869f449ac [2024-10-10 23:27:21,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:27:21,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:27:21,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:27:21,590 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:27:21,591 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:27:21,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label15.c [2024-10-10 23:27:23,111 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:27:23,609 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:27:23,611 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label15.c [2024-10-10 23:27:23,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b566c5f72/1c2de5bb85004eeb9b491434a009028d/FLAG81fd06b3c [2024-10-10 23:27:23,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b566c5f72/1c2de5bb85004eeb9b491434a009028d [2024-10-10 23:27:23,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:27:23,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:27:23,682 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:27:23,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:27:23,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:27:23,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:27:23" (1/1) ... [2024-10-10 23:27:23,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@af53466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:23, skipping insertion in model container [2024-10-10 23:27:23,691 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:27:23" (1/1) ... [2024-10-10 23:27:23,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:27:24,113 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/Problem13_label15.c[5297,5310] [2024-10-10 23:27:24,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:27:24,921 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:27:24,940 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/Problem13_label15.c[5297,5310] [2024-10-10 23:27:25,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:27:25,484 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:27:25,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:25 WrapperNode [2024-10-10 23:27:25,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:27:25,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:27:25,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:27:25,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:27:25,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:25" (1/1) ... [2024-10-10 23:27:25,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:25" (1/1) ... [2024-10-10 23:27:26,022 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-10 23:27:26,023 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:27:26,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:27:26,024 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:27:26,025 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:27:26,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:25" (1/1) ... [2024-10-10 23:27:26,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:25" (1/1) ... [2024-10-10 23:27:26,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:25" (1/1) ... [2024-10-10 23:27:26,722 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:27:26,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:25" (1/1) ... [2024-10-10 23:27:26,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:25" (1/1) ... [2024-10-10 23:27:27,011 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:25" (1/1) ... [2024-10-10 23:27:27,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:25" (1/1) ... [2024-10-10 23:27:27,085 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:25" (1/1) ... [2024-10-10 23:27:27,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:25" (1/1) ... [2024-10-10 23:27:27,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:27:27,200 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:27:27,200 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:27:27,200 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:27:27,202 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:25" (1/1) ... [2024-10-10 23:27:27,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:27:27,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:27:27,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:27:27,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:27:27,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:27:27,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:27:27,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:27:27,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:27:27,352 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:27:27,353 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:27:33,457 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-10 23:27:33,457 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:27:33,529 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:27:33,529 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:27:33,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:27:33 BoogieIcfgContainer [2024-10-10 23:27:33,530 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:27:33,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:27:33,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:27:33,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:27:33,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:27:23" (1/3) ... [2024-10-10 23:27:33,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df3fe95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:27:33, skipping insertion in model container [2024-10-10 23:27:33,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:25" (2/3) ... [2024-10-10 23:27:33,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df3fe95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:27:33, skipping insertion in model container [2024-10-10 23:27:33,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:27:33" (3/3) ... [2024-10-10 23:27:33,540 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label15.c [2024-10-10 23:27:33,558 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:27:33,558 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:27:33,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:27:33,676 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;@6c8ee2fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:27:33,677 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:27:33,688 INFO L276 IsEmpty]: Start isEmpty. Operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:33,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-10 23:27:33,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:33,696 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] [2024-10-10 23:27:33,697 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:33,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:33,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1529089843, now seen corresponding path program 1 times [2024-10-10 23:27:33,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:33,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534734758] [2024-10-10 23:27:33,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:33,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:33,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:27:33,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:33,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534734758] [2024-10-10 23:27:33,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534734758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:33,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:33,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:27:33,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366847067] [2024-10-10 23:27:33,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:33,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:27:33,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:33,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:27:33,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:27:33,930 INFO L87 Difference]: Start difference. First operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 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 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:34,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:34,044 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2024-10-10 23:27:34,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:27:34,047 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-10-10 23:27:34,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:34,072 INFO L225 Difference]: With dead ends: 2071 [2024-10-10 23:27:34,073 INFO L226 Difference]: Without dead ends: 1034 [2024-10-10 23:27:34,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:27:34,087 INFO L432 NwaCegarLoop]: 1876 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, 1876 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:34,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1876 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:27:34,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-10 23:27:34,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-10 23:27:34,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:34,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2024-10-10 23:27:34,191 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 35 [2024-10-10 23:27:34,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:34,192 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2024-10-10 23:27:34,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:34,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2024-10-10 23:27:34,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-10 23:27:34,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:34,194 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] [2024-10-10 23:27:34,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:27:34,195 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:34,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:34,195 INFO L85 PathProgramCache]: Analyzing trace with hash 618286059, now seen corresponding path program 1 times [2024-10-10 23:27:34,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:34,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491206197] [2024-10-10 23:27:34,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:34,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:34,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:27:34,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:34,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491206197] [2024-10-10 23:27:34,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491206197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:34,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:34,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:27:34,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146325117] [2024-10-10 23:27:34,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:34,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:34,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:34,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:34,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:34,413 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:38,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:38,768 INFO L93 Difference]: Finished difference Result 3015 states and 5510 transitions. [2024-10-10 23:27:38,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:27:38,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-10-10 23:27:38,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:38,777 INFO L225 Difference]: With dead ends: 3015 [2024-10-10 23:27:38,777 INFO L226 Difference]: Without dead ends: 1982 [2024-10-10 23:27:38,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:38,780 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 1019 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 2956 mSolverCounterSat, 929 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 3885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 929 IncrementalHoareTripleChecker+Valid, 2956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:38,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 317 Invalid, 3885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [929 Valid, 2956 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-10 23:27:38,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2024-10-10 23:27:38,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1929. [2024-10-10 23:27:38,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1928 states have (on average 1.7977178423236515) internal successors, (3466), 1928 states have internal predecessors, (3466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:38,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 3466 transitions. [2024-10-10 23:27:38,823 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 3466 transitions. Word has length 35 [2024-10-10 23:27:38,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:38,824 INFO L471 AbstractCegarLoop]: Abstraction has 1929 states and 3466 transitions. [2024-10-10 23:27:38,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:38,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 3466 transitions. [2024-10-10 23:27:38,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-10 23:27:38,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:38,827 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:27:38,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:27:38,827 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:38,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:38,828 INFO L85 PathProgramCache]: Analyzing trace with hash -219422559, now seen corresponding path program 1 times [2024-10-10 23:27:38,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:38,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221392177] [2024-10-10 23:27:38,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:38,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:39,075 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:27:39,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:39,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221392177] [2024-10-10 23:27:39,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221392177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:39,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:39,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:27:39,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592333537] [2024-10-10 23:27:39,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:39,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:39,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:39,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:39,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:39,084 INFO L87 Difference]: Start difference. First operand 1929 states and 3466 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:42,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:42,817 INFO L93 Difference]: Finished difference Result 5455 states and 9916 transitions. [2024-10-10 23:27:42,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:27:42,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2024-10-10 23:27:42,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:42,833 INFO L225 Difference]: With dead ends: 5455 [2024-10-10 23:27:42,833 INFO L226 Difference]: Without dead ends: 3527 [2024-10-10 23:27:42,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:42,837 INFO L432 NwaCegarLoop]: 853 mSDtfsCounter, 923 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2310 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 3188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:42,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1005 Invalid, 3188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2310 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-10 23:27:42,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3527 states. [2024-10-10 23:27:42,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3527 to 3525. [2024-10-10 23:27:42,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3525 states, 3524 states have (on average 1.5672531214528944) internal successors, (5523), 3524 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 3525 states and 5523 transitions. [2024-10-10 23:27:42,942 INFO L78 Accepts]: Start accepts. Automaton has 3525 states and 5523 transitions. Word has length 100 [2024-10-10 23:27:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:42,943 INFO L471 AbstractCegarLoop]: Abstraction has 3525 states and 5523 transitions. [2024-10-10 23:27:42,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 3525 states and 5523 transitions. [2024-10-10 23:27:42,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-10 23:27:42,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:42,946 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:27:42,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:27:42,946 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:42,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:42,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1135333746, now seen corresponding path program 1 times [2024-10-10 23:27:42,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:42,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377947691] [2024-10-10 23:27:42,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:42,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:27:43,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:43,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377947691] [2024-10-10 23:27:43,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377947691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:43,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:43,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:27:43,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581884663] [2024-10-10 23:27:43,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:43,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:43,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:43,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:43,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:43,194 INFO L87 Difference]: Start difference. First operand 3525 states and 5523 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:46,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:46,565 INFO L93 Difference]: Finished difference Result 10231 states and 16096 transitions. [2024-10-10 23:27:46,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:27:46,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2024-10-10 23:27:46,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:46,589 INFO L225 Difference]: With dead ends: 10231 [2024-10-10 23:27:46,589 INFO L226 Difference]: Without dead ends: 6707 [2024-10-10 23:27:46,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:46,598 INFO L432 NwaCegarLoop]: 715 mSDtfsCounter, 972 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2535 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 3310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 2535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:46,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 848 Invalid, 3310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 2535 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-10 23:27:46,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6707 states. [2024-10-10 23:27:46,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6707 to 6699. [2024-10-10 23:27:46,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6699 states, 6698 states have (on average 1.4131083905643476) internal successors, (9465), 6698 states have internal predecessors, (9465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:46,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6699 states to 6699 states and 9465 transitions. [2024-10-10 23:27:46,737 INFO L78 Accepts]: Start accepts. Automaton has 6699 states and 9465 transitions. Word has length 106 [2024-10-10 23:27:46,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:46,737 INFO L471 AbstractCegarLoop]: Abstraction has 6699 states and 9465 transitions. [2024-10-10 23:27:46,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:46,738 INFO L276 IsEmpty]: Start isEmpty. Operand 6699 states and 9465 transitions. [2024-10-10 23:27:46,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-10 23:27:46,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:46,740 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:27:46,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:27:46,742 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:46,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:46,743 INFO L85 PathProgramCache]: Analyzing trace with hash -73128569, now seen corresponding path program 1 times [2024-10-10 23:27:46,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:46,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330821943] [2024-10-10 23:27:46,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:46,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:46,928 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:27:46,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:46,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330821943] [2024-10-10 23:27:46,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330821943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:46,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:46,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:27:46,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518901140] [2024-10-10 23:27:46,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:46,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:46,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:46,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:46,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:46,932 INFO L87 Difference]: Start difference. First operand 6699 states and 9465 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:50,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:50,398 INFO L93 Difference]: Finished difference Result 17442 states and 24478 transitions. [2024-10-10 23:27:50,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:27:50,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2024-10-10 23:27:50,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:50,429 INFO L225 Difference]: With dead ends: 17442 [2024-10-10 23:27:50,429 INFO L226 Difference]: Without dead ends: 10744 [2024-10-10 23:27:50,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:50,441 INFO L432 NwaCegarLoop]: 832 mSDtfsCounter, 844 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 3292 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 3742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 3292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:50,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 963 Invalid, 3742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 3292 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-10 23:27:50,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10744 states. [2024-10-10 23:27:50,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10744 to 10668. [2024-10-10 23:27:50,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10668 states, 10667 states have (on average 1.3563326146057935) internal successors, (14468), 10667 states have internal predecessors, (14468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:50,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10668 states to 10668 states and 14468 transitions. [2024-10-10 23:27:50,653 INFO L78 Accepts]: Start accepts. Automaton has 10668 states and 14468 transitions. Word has length 136 [2024-10-10 23:27:50,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:50,654 INFO L471 AbstractCegarLoop]: Abstraction has 10668 states and 14468 transitions. [2024-10-10 23:27:50,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 10668 states and 14468 transitions. [2024-10-10 23:27:50,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-10 23:27:50,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:50,656 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:27:50,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:27:50,656 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:50,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:50,657 INFO L85 PathProgramCache]: Analyzing trace with hash 249104654, now seen corresponding path program 1 times [2024-10-10 23:27:50,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:50,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866049583] [2024-10-10 23:27:50,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:50,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:51,010 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:27:51,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:51,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866049583] [2024-10-10 23:27:51,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866049583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:51,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:51,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:27:51,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927505755] [2024-10-10 23:27:51,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:51,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:51,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:51,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:51,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:51,014 INFO L87 Difference]: Start difference. First operand 10668 states and 14468 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:53,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:53,772 INFO L93 Difference]: Finished difference Result 20548 states and 28118 transitions. [2024-10-10 23:27:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:27:53,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2024-10-10 23:27:53,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:53,800 INFO L225 Difference]: With dead ends: 20548 [2024-10-10 23:27:53,800 INFO L226 Difference]: Without dead ends: 10668 [2024-10-10 23:27:53,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:53,810 INFO L432 NwaCegarLoop]: 1081 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 2545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:53,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1210 Invalid, 2545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:27:53,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10668 states. [2024-10-10 23:27:53,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10668 to 10668. [2024-10-10 23:27:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10668 states, 10667 states have (on average 1.3539889378456924) internal successors, (14443), 10667 states have internal predecessors, (14443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:53,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10668 states to 10668 states and 14443 transitions. [2024-10-10 23:27:53,997 INFO L78 Accepts]: Start accepts. Automaton has 10668 states and 14443 transitions. Word has length 146 [2024-10-10 23:27:53,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:53,997 INFO L471 AbstractCegarLoop]: Abstraction has 10668 states and 14443 transitions. [2024-10-10 23:27:53,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:53,998 INFO L276 IsEmpty]: Start isEmpty. Operand 10668 states and 14443 transitions. [2024-10-10 23:27:53,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-10 23:27:53,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:53,999 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:27:53,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:27:53,999 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:54,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:54,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1504628644, now seen corresponding path program 1 times [2024-10-10 23:27:54,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:54,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634704264] [2024-10-10 23:27:54,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:54,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:54,600 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:27:54,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:54,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634704264] [2024-10-10 23:27:54,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634704264] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:27:54,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748641570] [2024-10-10 23:27:54,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:54,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:27:54,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:27:54,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:27:54,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:27:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:54,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:27:54,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:27:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-10 23:27:54,924 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:27:54,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748641570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:54,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:27:54,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-10 23:27:54,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269945317] [2024-10-10 23:27:54,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:54,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:54,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:54,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:54,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:27:54,927 INFO L87 Difference]: Start difference. First operand 10668 states and 14443 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:58,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:58,299 INFO L93 Difference]: Finished difference Result 30030 states and 41216 transitions. [2024-10-10 23:27:58,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:27:58,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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 160 [2024-10-10 23:27:58,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:58,335 INFO L225 Difference]: With dead ends: 30030 [2024-10-10 23:27:58,336 INFO L226 Difference]: Without dead ends: 20150 [2024-10-10 23:27:58,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:27:58,348 INFO L432 NwaCegarLoop]: 1069 mSDtfsCounter, 736 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2528 mSolverCounterSat, 779 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 3307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 779 IncrementalHoareTripleChecker+Valid, 2528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:58,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 1219 Invalid, 3307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [779 Valid, 2528 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:27:58,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20150 states. [2024-10-10 23:27:58,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20150 to 19336. [2024-10-10 23:27:58,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19336 states, 19335 states have (on average 1.2424618567364882) internal successors, (24023), 19335 states have internal predecessors, (24023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:58,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19336 states to 19336 states and 24023 transitions. [2024-10-10 23:27:58,599 INFO L78 Accepts]: Start accepts. Automaton has 19336 states and 24023 transitions. Word has length 160 [2024-10-10 23:27:58,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:58,600 INFO L471 AbstractCegarLoop]: Abstraction has 19336 states and 24023 transitions. [2024-10-10 23:27:58,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 19336 states and 24023 transitions. [2024-10-10 23:27:58,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-10 23:27:58,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:58,604 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:27:58,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:27:58,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:27:58,806 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:58,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:58,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1810403888, now seen corresponding path program 1 times [2024-10-10 23:27:58,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:58,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711338462] [2024-10-10 23:27:58,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:58,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:59,127 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-10 23:27:59,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:59,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711338462] [2024-10-10 23:27:59,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711338462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:59,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:59,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:27:59,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146081560] [2024-10-10 23:27:59,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:59,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:59,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:59,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:59,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:59,130 INFO L87 Difference]: Start difference. First operand 19336 states and 24023 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:28:02,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:02,286 INFO L93 Difference]: Finished difference Result 44988 states and 55627 transitions. [2024-10-10 23:28:02,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:02,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 247 [2024-10-10 23:28:02,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:02,340 INFO L225 Difference]: With dead ends: 44988 [2024-10-10 23:28:02,340 INFO L226 Difference]: Without dead ends: 26440 [2024-10-10 23:28:02,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:02,358 INFO L432 NwaCegarLoop]: 1027 mSDtfsCounter, 728 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 2715 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 2896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 2715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:02,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1211 Invalid, 2896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 2715 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-10 23:28:02,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26440 states. [2024-10-10 23:28:02,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26440 to 26433. [2024-10-10 23:28:02,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26433 states, 26432 states have (on average 1.2005901937046004) internal successors, (31734), 26432 states have internal predecessors, (31734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:28:02,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26433 states to 26433 states and 31734 transitions. [2024-10-10 23:28:02,807 INFO L78 Accepts]: Start accepts. Automaton has 26433 states and 31734 transitions. Word has length 247 [2024-10-10 23:28:02,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:02,808 INFO L471 AbstractCegarLoop]: Abstraction has 26433 states and 31734 transitions. [2024-10-10 23:28:02,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:28:02,808 INFO L276 IsEmpty]: Start isEmpty. Operand 26433 states and 31734 transitions. [2024-10-10 23:28:02,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-10-10 23:28:02,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:02,814 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:28:02,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:28:02,814 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:02,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:02,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1157637044, now seen corresponding path program 1 times [2024-10-10 23:28:02,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:02,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473833353] [2024-10-10 23:28:02,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:02,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:03,009 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:28:03,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:03,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473833353] [2024-10-10 23:28:03,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473833353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:03,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:03,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:28:03,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754912026] [2024-10-10 23:28:03,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:03,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:03,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:03,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:03,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:03,011 INFO L87 Difference]: Start difference. First operand 26433 states and 31734 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:28:06,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:06,292 INFO L93 Difference]: Finished difference Result 72534 states and 87970 transitions. [2024-10-10 23:28:06,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:06,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 249 [2024-10-10 23:28:06,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:06,372 INFO L225 Difference]: With dead ends: 72534 [2024-10-10 23:28:06,373 INFO L226 Difference]: Without dead ends: 46102 [2024-10-10 23:28:06,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:06,406 INFO L432 NwaCegarLoop]: 1846 mSDtfsCounter, 841 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2480 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 1981 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 2480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:06,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 1981 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 2480 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-10 23:28:06,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46102 states. [2024-10-10 23:28:07,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46102 to 43732. [2024-10-10 23:28:07,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43732 states, 43731 states have (on average 1.1691248770894789) internal successors, (51127), 43731 states have internal predecessors, (51127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:28:07,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43732 states to 43732 states and 51127 transitions. [2024-10-10 23:28:07,144 INFO L78 Accepts]: Start accepts. Automaton has 43732 states and 51127 transitions. Word has length 249 [2024-10-10 23:28:07,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:07,144 INFO L471 AbstractCegarLoop]: Abstraction has 43732 states and 51127 transitions. [2024-10-10 23:28:07,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:28:07,145 INFO L276 IsEmpty]: Start isEmpty. Operand 43732 states and 51127 transitions. [2024-10-10 23:28:07,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-10-10 23:28:07,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:07,149 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:28:07,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:28:07,149 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:07,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:07,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2082244430, now seen corresponding path program 1 times [2024-10-10 23:28:07,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:07,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578134192] [2024-10-10 23:28:07,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:07,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:07,337 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:28:07,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:07,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578134192] [2024-10-10 23:28:07,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578134192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:07,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:07,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:28:07,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614411484] [2024-10-10 23:28:07,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:07,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:07,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:07,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:07,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:07,341 INFO L87 Difference]: Start difference. First operand 43732 states and 51127 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:28:10,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:10,793 INFO L93 Difference]: Finished difference Result 106363 states and 126457 transitions. [2024-10-10 23:28:10,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:10,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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 262 [2024-10-10 23:28:10,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:10,878 INFO L225 Difference]: With dead ends: 106363 [2024-10-10 23:28:10,878 INFO L226 Difference]: Without dead ends: 63419 [2024-10-10 23:28:10,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:10,924 INFO L432 NwaCegarLoop]: 810 mSDtfsCounter, 822 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2386 mSolverCounterSat, 900 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 900 IncrementalHoareTripleChecker+Valid, 2386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:10,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 928 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [900 Valid, 2386 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:28:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63419 states. [2024-10-10 23:28:11,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63419 to 61047. [2024-10-10 23:28:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61047 states, 61046 states have (on average 1.1609605870982538) internal successors, (70872), 61046 states have internal predecessors, (70872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:28:12,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61047 states to 61047 states and 70872 transitions. [2024-10-10 23:28:12,182 INFO L78 Accepts]: Start accepts. Automaton has 61047 states and 70872 transitions. Word has length 262 [2024-10-10 23:28:12,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:12,182 INFO L471 AbstractCegarLoop]: Abstraction has 61047 states and 70872 transitions. [2024-10-10 23:28:12,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:28:12,183 INFO L276 IsEmpty]: Start isEmpty. Operand 61047 states and 70872 transitions. [2024-10-10 23:28:12,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-10-10 23:28:12,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:12,189 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:28:12,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:28:12,190 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:12,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:12,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1550948187, now seen corresponding path program 1 times [2024-10-10 23:28:12,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:12,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848885947] [2024-10-10 23:28:12,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:12,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:12,679 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-10 23:28:12,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:12,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848885947] [2024-10-10 23:28:12,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848885947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:12,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:12,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:28:12,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591067299] [2024-10-10 23:28:12,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:12,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:28:12,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:12,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:28:12,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:28:12,683 INFO L87 Difference]: Start difference. First operand 61047 states and 70872 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:28:19,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:19,047 INFO L93 Difference]: Finished difference Result 160081 states and 186749 transitions. [2024-10-10 23:28:19,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:28:19,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 323 [2024-10-10 23:28:19,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:19,205 INFO L225 Difference]: With dead ends: 160081 [2024-10-10 23:28:19,206 INFO L226 Difference]: Without dead ends: 99822 [2024-10-10 23:28:19,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:28:19,235 INFO L432 NwaCegarLoop]: 858 mSDtfsCounter, 1700 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 6253 mSolverCounterSat, 995 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1700 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 7248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 995 IncrementalHoareTripleChecker+Valid, 6253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:19,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1700 Valid, 1054 Invalid, 7248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [995 Valid, 6253 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-10-10 23:28:19,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99822 states. [2024-10-10 23:28:20,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99822 to 76802. [2024-10-10 23:28:20,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76802 states, 76801 states have (on average 1.1463783023658547) internal successors, (88043), 76801 states have internal predecessors, (88043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:28:20,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76802 states to 76802 states and 88043 transitions. [2024-10-10 23:28:20,471 INFO L78 Accepts]: Start accepts. Automaton has 76802 states and 88043 transitions. Word has length 323 [2024-10-10 23:28:20,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:20,472 INFO L471 AbstractCegarLoop]: Abstraction has 76802 states and 88043 transitions. [2024-10-10 23:28:20,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:28:20,472 INFO L276 IsEmpty]: Start isEmpty. Operand 76802 states and 88043 transitions. [2024-10-10 23:28:20,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-10-10 23:28:20,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:20,482 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:28:20,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:28:20,482 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:20,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:20,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1538923492, now seen corresponding path program 1 times [2024-10-10 23:28:20,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:20,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284264962] [2024-10-10 23:28:20,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:20,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:22,002 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 199 proven. 110 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-10 23:28:22,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:22,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284264962] [2024-10-10 23:28:22,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284264962] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:28:22,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969968192] [2024-10-10 23:28:22,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:22,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:28:22,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:28:22,010 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:28:22,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:28:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:22,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:28:22,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:28:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-10 23:28:22,285 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:28:22,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969968192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:22,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:28:22,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:28:22,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979268852] [2024-10-10 23:28:22,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:22,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:22,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:22,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:22,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:28:22,287 INFO L87 Difference]: Start difference. First operand 76802 states and 88043 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:28:25,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:25,347 INFO L93 Difference]: Finished difference Result 152805 states and 175283 transitions. [2024-10-10 23:28:25,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:25,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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 341 [2024-10-10 23:28:25,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:25,447 INFO L225 Difference]: With dead ends: 152805 [2024-10-10 23:28:25,448 INFO L226 Difference]: Without dead ends: 76791 [2024-10-10 23:28:25,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:28:25,486 INFO L432 NwaCegarLoop]: 679 mSDtfsCounter, 1072 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 2921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 2389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:25,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 812 Invalid, 2921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 2389 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:28:25,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76791 states. [2024-10-10 23:28:26,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76791 to 76788. [2024-10-10 23:28:26,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76788 states, 76787 states have (on average 1.1087163191686094) internal successors, (85135), 76787 states have internal predecessors, (85135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:28:26,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76788 states to 76788 states and 85135 transitions. [2024-10-10 23:28:26,445 INFO L78 Accepts]: Start accepts. Automaton has 76788 states and 85135 transitions. Word has length 341 [2024-10-10 23:28:26,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:26,445 INFO L471 AbstractCegarLoop]: Abstraction has 76788 states and 85135 transitions. [2024-10-10 23:28:26,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:28:26,445 INFO L276 IsEmpty]: Start isEmpty. Operand 76788 states and 85135 transitions. [2024-10-10 23:28:26,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2024-10-10 23:28:26,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:26,455 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:28:26,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 23:28:26,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:28:26,656 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:26,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:26,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1006701512, now seen corresponding path program 1 times [2024-10-10 23:28:26,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:26,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342618539] [2024-10-10 23:28:26,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:26,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:28,227 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 293 proven. 110 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-10 23:28:28,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:28,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342618539] [2024-10-10 23:28:28,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342618539] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:28:28,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364696140] [2024-10-10 23:28:28,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:28,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:28:28,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:28:28,230 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:28:28,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:28:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:28,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:28:28,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:28:28,563 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-10-10 23:28:28,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:28:28,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364696140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:28,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:28:28,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:28:28,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404883969] [2024-10-10 23:28:28,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:28,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:28,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:28,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:28,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:28:28,566 INFO L87 Difference]: Start difference. First operand 76788 states and 85135 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:28:31,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:31,708 INFO L93 Difference]: Finished difference Result 153573 states and 170308 transitions. [2024-10-10 23:28:31,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:31,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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 390 [2024-10-10 23:28:31,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:31,793 INFO L225 Difference]: With dead ends: 153573 [2024-10-10 23:28:31,793 INFO L226 Difference]: Without dead ends: 77573 [2024-10-10 23:28:31,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:28:31,824 INFO L432 NwaCegarLoop]: 1341 mSDtfsCounter, 1084 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2462 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 2907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 2462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:31,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 1419 Invalid, 2907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 2462 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:28:31,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77573 states. [2024-10-10 23:28:32,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77573 to 76785. [2024-10-10 23:28:32,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76785 states, 76784 states have (on average 1.0866196082517192) internal successors, (83435), 76784 states have internal predecessors, (83435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:28:32,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76785 states to 76785 states and 83435 transitions. [2024-10-10 23:28:32,896 INFO L78 Accepts]: Start accepts. Automaton has 76785 states and 83435 transitions. Word has length 390 [2024-10-10 23:28:32,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:32,896 INFO L471 AbstractCegarLoop]: Abstraction has 76785 states and 83435 transitions. [2024-10-10 23:28:32,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:28:32,897 INFO L276 IsEmpty]: Start isEmpty. Operand 76785 states and 83435 transitions. [2024-10-10 23:28:32,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2024-10-10 23:28:32,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:32,911 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:28:32,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 23:28:33,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:28:33,113 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:33,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:33,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1525120624, now seen corresponding path program 1 times [2024-10-10 23:28:33,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:33,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056717913] [2024-10-10 23:28:33,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:33,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:33,332 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-10-10 23:28:33,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:33,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056717913] [2024-10-10 23:28:33,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056717913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:33,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:33,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:28:33,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537316605] [2024-10-10 23:28:33,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:33,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:33,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:33,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:33,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:33,336 INFO L87 Difference]: Start difference. First operand 76785 states and 83435 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)