./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label17.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label17.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 d5ce10b415c8706a9c163992802d3ffc66c067ac6ef9711912e3377baf22b40a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:21:46,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:21:46,941 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:21:46,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:21:46,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:21:46,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:21:46,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:21:46,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:21:46,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:21:46,985 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:21:46,985 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:21:46,985 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:21:46,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:21:46,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:21:46,987 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:21:46,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:21:46,988 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:21:46,988 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:21:46,988 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:21:46,988 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:21:46,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:21:46,990 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:21:46,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:21:46,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:21:46,991 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:21:46,991 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:21:46,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:21:46,992 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:21:46,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:21:46,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:21:46,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:21:46,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:21:46,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:21:46,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:21:46,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:21:46,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:21:46,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:21:46,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:21:46,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:21:46,995 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:21:46,995 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:21:46,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:21:46,996 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 -> d5ce10b415c8706a9c163992802d3ffc66c067ac6ef9711912e3377baf22b40a [2024-10-10 23:21:47,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:21:47,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:21:47,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:21:47,294 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:21:47,294 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:21:47,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label17.c [2024-10-10 23:21:48,787 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:21:49,234 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:21:49,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label17.c [2024-10-10 23:21:49,275 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e311007cf/814638e246f04950bf0e1a45877419ea/FLAG14cc460dd [2024-10-10 23:21:49,374 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e311007cf/814638e246f04950bf0e1a45877419ea [2024-10-10 23:21:49,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:21:49,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:21:49,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:21:49,382 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:21:49,387 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:21:49,388 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:21:49" (1/1) ... [2024-10-10 23:21:49,389 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff4627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:49, skipping insertion in model container [2024-10-10 23:21:49,390 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:21:49" (1/1) ... [2024-10-10 23:21:49,500 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:21:49,765 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label17.c[5134,5147] [2024-10-10 23:21:50,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:21:50,525 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:21:50,587 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label17.c[5134,5147] [2024-10-10 23:21:50,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:21:50,997 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:21:50,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:50 WrapperNode [2024-10-10 23:21:50,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:21:50,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:21:50,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:21:50,999 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:21:51,007 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:21:50" (1/1) ... [2024-10-10 23:21:51,082 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:21:50" (1/1) ... [2024-10-10 23:21:51,358 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-10-10 23:21:51,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:21:51,360 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:21:51,360 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:21:51,360 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:21:51,370 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:50" (1/1) ... [2024-10-10 23:21:51,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:50" (1/1) ... [2024-10-10 23:21:51,415 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:50" (1/1) ... [2024-10-10 23:21:51,629 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:21:51,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:50" (1/1) ... [2024-10-10 23:21:51,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:50" (1/1) ... [2024-10-10 23:21:51,800 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:50" (1/1) ... [2024-10-10 23:21:51,821 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:50" (1/1) ... [2024-10-10 23:21:51,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:50" (1/1) ... [2024-10-10 23:21:51,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:50" (1/1) ... [2024-10-10 23:21:51,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:21:51,982 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:21:51,983 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:21:51,983 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:21:51,984 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:50" (1/1) ... [2024-10-10 23:21:51,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:21:52,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:21:52,039 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:21:52,041 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:21:52,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:21:52,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:21:52,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:21:52,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:21:52,313 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:21:52,315 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:21:56,745 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-10-10 23:21:56,745 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:21:56,820 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:21:56,821 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:21:56,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:21:56 BoogieIcfgContainer [2024-10-10 23:21:56,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:21:56,825 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:21:56,825 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:21:56,828 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:21:56,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:21:49" (1/3) ... [2024-10-10 23:21:56,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db0d381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:21:56, skipping insertion in model container [2024-10-10 23:21:56,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:50" (2/3) ... [2024-10-10 23:21:56,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db0d381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:21:56, skipping insertion in model container [2024-10-10 23:21:56,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:21:56" (3/3) ... [2024-10-10 23:21:56,831 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label17.c [2024-10-10 23:21:56,848 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:21:56,848 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:21:56,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:21:56,953 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;@700b1743, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:21:56,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:21:56,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:21:56,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-10 23:21:56,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:21:56,973 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:21:56,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:21:56,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:21:56,980 INFO L85 PathProgramCache]: Analyzing trace with hash -286904278, now seen corresponding path program 1 times [2024-10-10 23:21:56,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:21:56,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942714489] [2024-10-10 23:21:56,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:21:56,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:21:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:21:57,163 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:21:57,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:21:57,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942714489] [2024-10-10 23:21:57,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942714489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:21:57,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:21:57,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:21:57,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632132486] [2024-10-10 23:21:57,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:21:57,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:21:57,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:21:57,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:21:57,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:21:57,210 INFO L87 Difference]: Start difference. First operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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:21:57,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:21:57,306 INFO L93 Difference]: Finished difference Result 1511 states and 3005 transitions. [2024-10-10 23:21:57,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:21:57,312 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-10-10 23:21:57,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:21:57,377 INFO L225 Difference]: With dead ends: 1511 [2024-10-10 23:21:57,378 INFO L226 Difference]: Without dead ends: 754 [2024-10-10 23:21:57,385 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:21:57,389 INFO L432 NwaCegarLoop]: 1438 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:21:57,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:21:57,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-10-10 23:21:57,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-10-10 23:21:57,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:21:57,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2024-10-10 23:21:57,483 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 39 [2024-10-10 23:21:57,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:21:57,484 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2024-10-10 23:21:57,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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:21:57,485 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2024-10-10 23:21:57,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-10 23:21:57,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:21:57,486 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:21:57,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:21:57,487 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:21:57,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:21:57,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2141793457, now seen corresponding path program 1 times [2024-10-10 23:21:57,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:21:57,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041517774] [2024-10-10 23:21:57,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:21:57,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:21:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:21:57,671 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:21:57,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:21:57,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041517774] [2024-10-10 23:21:57,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041517774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:21:57,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:21:57,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:21:57,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539537586] [2024-10-10 23:21:57,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:21:57,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:21:57,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:21:57,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:21:57,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:21:57,677 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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:22:00,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:00,971 INFO L93 Difference]: Finished difference Result 2258 states and 4311 transitions. [2024-10-10 23:22:00,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:00,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-10-10 23:22:00,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:00,980 INFO L225 Difference]: With dead ends: 2258 [2024-10-10 23:22:00,980 INFO L226 Difference]: Without dead ends: 1505 [2024-10-10 23:22:00,984 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:22:00,985 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 829 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2378 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 3089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 2378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:00,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 113 Invalid, 3089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 2378 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-10 23:22:00,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2024-10-10 23:22:01,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2024-10-10 23:22:01,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 1.846409574468085) internal successors, (2777), 1504 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states 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:22:01,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2777 transitions. [2024-10-10 23:22:01,094 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2777 transitions. Word has length 39 [2024-10-10 23:22:01,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:01,096 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2777 transitions. [2024-10-10 23:22:01,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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:22:01,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2777 transitions. [2024-10-10 23:22:01,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-10 23:22:01,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:01,101 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:01,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:22:01,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:01,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:01,103 INFO L85 PathProgramCache]: Analyzing trace with hash 2012728423, now seen corresponding path program 1 times [2024-10-10 23:22:01,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:01,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537489478] [2024-10-10 23:22:01,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:01,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:01,346 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:22:01,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:01,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537489478] [2024-10-10 23:22:01,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537489478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:01,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:01,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:22:01,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350378823] [2024-10-10 23:22:01,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:01,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:01,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:01,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:01,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:01,349 INFO L87 Difference]: Start difference. First operand 1505 states and 2777 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:22:04,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:04,508 INFO L93 Difference]: Finished difference Result 3760 states and 6892 transitions. [2024-10-10 23:22:04,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:04,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2024-10-10 23:22:04,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:04,520 INFO L225 Difference]: With dead ends: 3760 [2024-10-10 23:22:04,520 INFO L226 Difference]: Without dead ends: 2256 [2024-10-10 23:22:04,523 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:22:04,525 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 780 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 864 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 2860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:04,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 446 Invalid, 2860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 1996 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-10 23:22:04,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2024-10-10 23:22:04,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2256. [2024-10-10 23:22:04,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2256 states, 2255 states have (on average 1.4421286031042129) internal successors, (3252), 2255 states have internal predecessors, (3252), 0 states have call successors, (0), 0 states 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:22:04,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 3252 transitions. [2024-10-10 23:22:04,574 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 3252 transitions. Word has length 108 [2024-10-10 23:22:04,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:04,575 INFO L471 AbstractCegarLoop]: Abstraction has 2256 states and 3252 transitions. [2024-10-10 23:22:04,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:22:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 3252 transitions. [2024-10-10 23:22:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-10 23:22:04,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:04,578 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:04,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:22:04,578 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:04,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:04,579 INFO L85 PathProgramCache]: Analyzing trace with hash -348016734, now seen corresponding path program 1 times [2024-10-10 23:22:04,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:04,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68566514] [2024-10-10 23:22:04,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:04,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:05,003 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:22:05,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:05,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68566514] [2024-10-10 23:22:05,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68566514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:05,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:05,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:05,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300375063] [2024-10-10 23:22:05,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:05,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:22:05,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:05,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:22:05,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:22:05,009 INFO L87 Difference]: Start difference. First operand 2256 states and 3252 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:22:08,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:08,614 INFO L93 Difference]: Finished difference Result 6801 states and 9790 transitions. [2024-10-10 23:22:08,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:22:08,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2024-10-10 23:22:08,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:08,634 INFO L225 Difference]: With dead ends: 6801 [2024-10-10 23:22:08,635 INFO L226 Difference]: Without dead ends: 4509 [2024-10-10 23:22:08,642 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:22:08,643 INFO L432 NwaCegarLoop]: 684 mSDtfsCounter, 703 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3106 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 3835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 3106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:08,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 697 Invalid, 3835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 3106 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-10 23:22:08,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4509 states. [2024-10-10 23:22:08,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4509 to 3758. [2024-10-10 23:22:08,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3758 states, 3757 states have (on average 1.2714932126696832) internal successors, (4777), 3757 states have internal predecessors, (4777), 0 states have call successors, (0), 0 states 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:22:08,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3758 states to 3758 states and 4777 transitions. [2024-10-10 23:22:08,734 INFO L78 Accepts]: Start accepts. Automaton has 3758 states and 4777 transitions. Word has length 110 [2024-10-10 23:22:08,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:08,735 INFO L471 AbstractCegarLoop]: Abstraction has 3758 states and 4777 transitions. [2024-10-10 23:22:08,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:22:08,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3758 states and 4777 transitions. [2024-10-10 23:22:08,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-10 23:22:08,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:08,746 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:22:08,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:22:08,748 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:08,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:08,749 INFO L85 PathProgramCache]: Analyzing trace with hash -2069033632, now seen corresponding path program 1 times [2024-10-10 23:22:08,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:08,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201532694] [2024-10-10 23:22:08,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:08,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-10 23:22:09,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:09,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201532694] [2024-10-10 23:22:09,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201532694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:09,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:09,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:09,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369369895] [2024-10-10 23:22:09,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:09,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:22:09,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:09,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:22:09,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:22:09,321 INFO L87 Difference]: Start difference. First operand 3758 states and 4777 transitions. Second operand has 4 states, 4 states have (on average 45.5) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states 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:22:12,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:12,449 INFO L93 Difference]: Finished difference Result 9807 states and 12773 transitions. [2024-10-10 23:22:12,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:22:12,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 251 [2024-10-10 23:22:12,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:12,469 INFO L225 Difference]: With dead ends: 9807 [2024-10-10 23:22:12,470 INFO L226 Difference]: Without dead ends: 6013 [2024-10-10 23:22:12,474 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:22:12,477 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 850 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3409 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 3962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 3409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:12,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 323 Invalid, 3962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 3409 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-10 23:22:12,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6013 states. [2024-10-10 23:22:12,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6013 to 6011. [2024-10-10 23:22:12,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6011 states, 6010 states have (on average 1.2227953410981698) internal successors, (7349), 6010 states have internal predecessors, (7349), 0 states have call successors, (0), 0 states 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:22:12,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6011 states to 6011 states and 7349 transitions. [2024-10-10 23:22:12,569 INFO L78 Accepts]: Start accepts. Automaton has 6011 states and 7349 transitions. Word has length 251 [2024-10-10 23:22:12,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:12,571 INFO L471 AbstractCegarLoop]: Abstraction has 6011 states and 7349 transitions. [2024-10-10 23:22:12,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states 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:22:12,572 INFO L276 IsEmpty]: Start isEmpty. Operand 6011 states and 7349 transitions. [2024-10-10 23:22:12,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-10-10 23:22:12,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:12,575 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:22:12,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:22:12,575 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:12,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:12,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1844386835, now seen corresponding path program 1 times [2024-10-10 23:22:12,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:12,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984331229] [2024-10-10 23:22:12,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:12,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-10 23:22:13,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:13,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984331229] [2024-10-10 23:22:13,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984331229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:13,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:13,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:13,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816208350] [2024-10-10 23:22:13,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:13,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:22:13,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:13,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:22:13,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:22:13,210 INFO L87 Difference]: Start difference. First operand 6011 states and 7349 transitions. Second operand has 4 states, 4 states have (on average 53.75) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states 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:22:17,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:17,277 INFO L93 Difference]: Finished difference Result 18029 states and 22020 transitions. [2024-10-10 23:22:17,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:22:17,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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 252 [2024-10-10 23:22:17,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:17,317 INFO L225 Difference]: With dead ends: 18029 [2024-10-10 23:22:17,317 INFO L226 Difference]: Without dead ends: 12019 [2024-10-10 23:22:17,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:22:17,334 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 2025 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 4471 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2025 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 5021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 4471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:17,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2025 Valid, 603 Invalid, 5021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 4471 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-10 23:22:17,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12019 states. [2024-10-10 23:22:17,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12019 to 10517. [2024-10-10 23:22:17,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10517 states, 10516 states have (on average 1.156238113351084) internal successors, (12159), 10516 states have internal predecessors, (12159), 0 states have call successors, (0), 0 states 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:22:17,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10517 states to 10517 states and 12159 transitions. [2024-10-10 23:22:17,541 INFO L78 Accepts]: Start accepts. Automaton has 10517 states and 12159 transitions. Word has length 252 [2024-10-10 23:22:17,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:17,545 INFO L471 AbstractCegarLoop]: Abstraction has 10517 states and 12159 transitions. [2024-10-10 23:22:17,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states 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:22:17,546 INFO L276 IsEmpty]: Start isEmpty. Operand 10517 states and 12159 transitions. [2024-10-10 23:22:17,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-10-10 23:22:17,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:17,553 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:17,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:22:17,554 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:17,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:17,554 INFO L85 PathProgramCache]: Analyzing trace with hash -519231205, now seen corresponding path program 1 times [2024-10-10 23:22:17,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:17,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760415102] [2024-10-10 23:22:17,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:17,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-10 23:22:17,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:17,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760415102] [2024-10-10 23:22:17,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760415102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:17,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:17,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:17,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17623596] [2024-10-10 23:22:17,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:17,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:17,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:17,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:17,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:17,924 INFO L87 Difference]: Start difference. First operand 10517 states and 12159 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states 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:22:20,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:20,896 INFO L93 Difference]: Finished difference Result 30796 states and 35715 transitions. [2024-10-10 23:22:20,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:20,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 334 [2024-10-10 23:22:20,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:20,937 INFO L225 Difference]: With dead ends: 30796 [2024-10-10 23:22:20,937 INFO L226 Difference]: Without dead ends: 20280 [2024-10-10 23:22:20,953 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:22:20,954 INFO L432 NwaCegarLoop]: 1376 mSDtfsCounter, 667 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2721 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 3082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 2721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:20,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1383 Invalid, 3082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 2721 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-10 23:22:20,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20280 states. [2024-10-10 23:22:21,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20280 to 18778. [2024-10-10 23:22:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18778 states, 18777 states have (on average 1.1468285668637161) internal successors, (21534), 18777 states have internal predecessors, (21534), 0 states have call successors, (0), 0 states 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:22:21,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18778 states to 18778 states and 21534 transitions. [2024-10-10 23:22:21,428 INFO L78 Accepts]: Start accepts. Automaton has 18778 states and 21534 transitions. Word has length 334 [2024-10-10 23:22:21,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:21,429 INFO L471 AbstractCegarLoop]: Abstraction has 18778 states and 21534 transitions. [2024-10-10 23:22:21,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states 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:22:21,429 INFO L276 IsEmpty]: Start isEmpty. Operand 18778 states and 21534 transitions. [2024-10-10 23:22:21,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-10-10 23:22:21,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:21,435 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:21,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:22:21,436 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:21,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:21,436 INFO L85 PathProgramCache]: Analyzing trace with hash 355769361, now seen corresponding path program 1 times [2024-10-10 23:22:21,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:21,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179286590] [2024-10-10 23:22:21,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:21,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:21,828 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-10 23:22:21,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:21,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179286590] [2024-10-10 23:22:21,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179286590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:21,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:21,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:21,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746421827] [2024-10-10 23:22:21,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:21,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:21,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:21,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:21,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:21,833 INFO L87 Difference]: Start difference. First operand 18778 states and 21534 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states 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:22:24,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:24,406 INFO L93 Difference]: Finished difference Result 45816 states and 53205 transitions. [2024-10-10 23:22:24,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:24,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 338 [2024-10-10 23:22:24,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:24,463 INFO L225 Difference]: With dead ends: 45816 [2024-10-10 23:22:24,463 INFO L226 Difference]: Without dead ends: 27039 [2024-10-10 23:22:24,489 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:22:24,490 INFO L432 NwaCegarLoop]: 1194 mSDtfsCounter, 704 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 2672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:24,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1201 Invalid, 2672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:22:24,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27039 states. [2024-10-10 23:22:24,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27039 to 27039. [2024-10-10 23:22:24,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27039 states, 27038 states have (on average 1.1243805015163844) internal successors, (30401), 27038 states have internal predecessors, (30401), 0 states have call successors, (0), 0 states 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:22:24,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27039 states to 27039 states and 30401 transitions. [2024-10-10 23:22:24,993 INFO L78 Accepts]: Start accepts. Automaton has 27039 states and 30401 transitions. Word has length 338 [2024-10-10 23:22:24,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:24,993 INFO L471 AbstractCegarLoop]: Abstraction has 27039 states and 30401 transitions. [2024-10-10 23:22:24,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states 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:22:24,994 INFO L276 IsEmpty]: Start isEmpty. Operand 27039 states and 30401 transitions. [2024-10-10 23:22:25,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2024-10-10 23:22:25,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:25,002 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:25,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:22:25,002 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:25,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:25,003 INFO L85 PathProgramCache]: Analyzing trace with hash -2093320607, now seen corresponding path program 1 times [2024-10-10 23:22:25,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:25,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545270072] [2024-10-10 23:22:25,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:25,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:25,276 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-10-10 23:22:25,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:25,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545270072] [2024-10-10 23:22:25,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545270072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:25,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:25,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:25,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760647719] [2024-10-10 23:22:25,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:25,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:25,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:25,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:25,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:25,279 INFO L87 Difference]: Start difference. First operand 27039 states and 30401 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states 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:22:28,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:28,107 INFO L93 Difference]: Finished difference Result 66844 states and 75536 transitions. [2024-10-10 23:22:28,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:28,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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 370 [2024-10-10 23:22:28,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:28,170 INFO L225 Difference]: With dead ends: 66844 [2024-10-10 23:22:28,170 INFO L226 Difference]: Without dead ends: 39806 [2024-10-10 23:22:28,196 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:22:28,197 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 735 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 2957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:28,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 402 Invalid, 2957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:22:28,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39806 states. [2024-10-10 23:22:28,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39806 to 38304. [2024-10-10 23:22:28,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38304 states, 38303 states have (on average 1.1223402866616192) internal successors, (42989), 38303 states have internal predecessors, (42989), 0 states have call successors, (0), 0 states 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:22:28,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38304 states to 38304 states and 42989 transitions. [2024-10-10 23:22:28,615 INFO L78 Accepts]: Start accepts. Automaton has 38304 states and 42989 transitions. Word has length 370 [2024-10-10 23:22:28,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:28,616 INFO L471 AbstractCegarLoop]: Abstraction has 38304 states and 42989 transitions. [2024-10-10 23:22:28,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states 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:22:28,617 INFO L276 IsEmpty]: Start isEmpty. Operand 38304 states and 42989 transitions. [2024-10-10 23:22:28,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2024-10-10 23:22:28,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:28,628 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:28,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:22:28,628 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:28,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:28,629 INFO L85 PathProgramCache]: Analyzing trace with hash -838399179, now seen corresponding path program 1 times [2024-10-10 23:22:28,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:28,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894248840] [2024-10-10 23:22:28,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:28,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:28,930 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-10 23:22:28,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:28,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894248840] [2024-10-10 23:22:28,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894248840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:28,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:28,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:28,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768558419] [2024-10-10 23:22:28,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:28,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:28,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:28,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:28,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:28,935 INFO L87 Difference]: Start difference. First operand 38304 states and 42989 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:31,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:31,721 INFO L93 Difference]: Finished difference Result 94631 states and 107673 transitions. [2024-10-10 23:22:31,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:31,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 377 [2024-10-10 23:22:31,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:31,795 INFO L225 Difference]: With dead ends: 94631 [2024-10-10 23:22:31,796 INFO L226 Difference]: Without dead ends: 56328 [2024-10-10 23:22:31,832 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:22:31,833 INFO L432 NwaCegarLoop]: 1249 mSDtfsCounter, 704 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2129 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 2817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 2129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:31,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1256 Invalid, 2817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 2129 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:22:31,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56328 states. [2024-10-10 23:22:32,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56328 to 54075. [2024-10-10 23:22:32,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54075 states, 54074 states have (on average 1.1104782335318268) internal successors, (60048), 54074 states have internal predecessors, (60048), 0 states have call successors, (0), 0 states 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:22:32,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54075 states to 54075 states and 60048 transitions. [2024-10-10 23:22:32,626 INFO L78 Accepts]: Start accepts. Automaton has 54075 states and 60048 transitions. Word has length 377 [2024-10-10 23:22:32,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:32,627 INFO L471 AbstractCegarLoop]: Abstraction has 54075 states and 60048 transitions. [2024-10-10 23:22:32,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:32,628 INFO L276 IsEmpty]: Start isEmpty. Operand 54075 states and 60048 transitions. [2024-10-10 23:22:32,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2024-10-10 23:22:32,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:32,646 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 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] [2024-10-10 23:22:32,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:22:32,647 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:32,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:32,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1026222052, now seen corresponding path program 1 times [2024-10-10 23:22:32,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:32,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884331420] [2024-10-10 23:22:32,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:32,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:33,107 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 399 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-10-10 23:22:33,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:33,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884331420] [2024-10-10 23:22:33,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884331420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:33,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:33,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:33,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647631360] [2024-10-10 23:22:33,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:33,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:33,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:33,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:33,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:33,111 INFO L87 Difference]: Start difference. First operand 54075 states and 60048 transitions. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states 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:22:36,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:36,206 INFO L93 Difference]: Finished difference Result 137438 states and 153696 transitions. [2024-10-10 23:22:36,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:36,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 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 460 [2024-10-10 23:22:36,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:36,487 INFO L225 Difference]: With dead ends: 137438 [2024-10-10 23:22:36,487 INFO L226 Difference]: Without dead ends: 80360 [2024-10-10 23:22:36,526 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:22:36,527 INFO L432 NwaCegarLoop]: 1276 mSDtfsCounter, 707 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2207 mSolverCounterSat, 611 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 2818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 611 IncrementalHoareTripleChecker+Valid, 2207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:36,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1282 Invalid, 2818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [611 Valid, 2207 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:22:36,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80360 states. [2024-10-10 23:22:37,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80360 to 78858. [2024-10-10 23:22:37,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78858 states, 78857 states have (on average 1.0924711820130109) internal successors, (86149), 78857 states have internal predecessors, (86149), 0 states have call successors, (0), 0 states 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:22:37,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78858 states to 78858 states and 86149 transitions. [2024-10-10 23:22:37,292 INFO L78 Accepts]: Start accepts. Automaton has 78858 states and 86149 transitions. Word has length 460 [2024-10-10 23:22:37,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:37,293 INFO L471 AbstractCegarLoop]: Abstraction has 78858 states and 86149 transitions. [2024-10-10 23:22:37,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states 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:22:37,293 INFO L276 IsEmpty]: Start isEmpty. Operand 78858 states and 86149 transitions. [2024-10-10 23:22:37,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2024-10-10 23:22:37,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:37,304 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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:22:37,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:22:37,305 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:37,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:37,306 INFO L85 PathProgramCache]: Analyzing trace with hash 227318782, now seen corresponding path program 1 times [2024-10-10 23:22:37,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:37,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28037952] [2024-10-10 23:22:37,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:37,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:38,035 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 570 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-10-10 23:22:38,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:38,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28037952] [2024-10-10 23:22:38,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28037952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:38,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:38,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:38,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439989272] [2024-10-10 23:22:38,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:38,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:38,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:38,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:38,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:38,038 INFO L87 Difference]: Start difference. First operand 78858 states and 86149 transitions. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states 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:22:40,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:40,994 INFO L93 Difference]: Finished difference Result 158466 states and 173010 transitions. [2024-10-10 23:22:40,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:40,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 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 472 [2024-10-10 23:22:41,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:41,089 INFO L225 Difference]: With dead ends: 158466 [2024-10-10 23:22:41,089 INFO L226 Difference]: Without dead ends: 79609 [2024-10-10 23:22:41,108 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:22:41,109 INFO L432 NwaCegarLoop]: 1150 mSDtfsCounter, 696 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2387 mSolverCounterSat, 525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 525 IncrementalHoareTripleChecker+Valid, 2387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:41,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1156 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [525 Valid, 2387 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:22:41,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79609 states. [2024-10-10 23:22:41,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79609 to 77356. [2024-10-10 23:22:41,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77356 states, 77355 states have (on average 1.0819597957468812) internal successors, (83695), 77355 states have internal predecessors, (83695), 0 states have call successors, (0), 0 states 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:22:42,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77356 states to 77356 states and 83695 transitions. [2024-10-10 23:22:42,222 INFO L78 Accepts]: Start accepts. Automaton has 77356 states and 83695 transitions. Word has length 472 [2024-10-10 23:22:42,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:42,223 INFO L471 AbstractCegarLoop]: Abstraction has 77356 states and 83695 transitions. [2024-10-10 23:22:42,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states 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:22:42,223 INFO L276 IsEmpty]: Start isEmpty. Operand 77356 states and 83695 transitions. [2024-10-10 23:22:42,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2024-10-10 23:22:42,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:42,241 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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:22:42,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:22:42,242 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:42,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:42,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2055727305, now seen corresponding path program 1 times [2024-10-10 23:22:42,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:42,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579646170] [2024-10-10 23:22:42,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:42,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 439 proven. 0 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2024-10-10 23:22:42,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:42,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579646170] [2024-10-10 23:22:42,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579646170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:42,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:42,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:42,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150615297] [2024-10-10 23:22:42,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:42,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:42,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:42,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:42,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:42,702 INFO L87 Difference]: Start difference. First operand 77356 states and 83695 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states 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:22:45,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:45,471 INFO L93 Difference]: Finished difference Result 154711 states and 167389 transitions. [2024-10-10 23:22:45,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:45,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 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 473 [2024-10-10 23:22:45,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:45,578 INFO L225 Difference]: With dead ends: 154711 [2024-10-10 23:22:45,578 INFO L226 Difference]: Without dead ends: 77356 [2024-10-10 23:22:45,608 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:22:45,609 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 699 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2200 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 2689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 2200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:45,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 399 Invalid, 2689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 2200 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:22:45,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77356 states. [2024-10-10 23:22:46,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77356 to 72850. [2024-10-10 23:22:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72850 states, 72849 states have (on average 1.0574064160112013) internal successors, (77031), 72849 states have internal predecessors, (77031), 0 states have call successors, (0), 0 states 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:22:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72850 states to 72850 states and 77031 transitions. [2024-10-10 23:22:46,459 INFO L78 Accepts]: Start accepts. Automaton has 72850 states and 77031 transitions. Word has length 473 [2024-10-10 23:22:46,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:46,459 INFO L471 AbstractCegarLoop]: Abstraction has 72850 states and 77031 transitions. [2024-10-10 23:22:46,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states 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:22:46,460 INFO L276 IsEmpty]: Start isEmpty. Operand 72850 states and 77031 transitions. [2024-10-10 23:22:46,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2024-10-10 23:22:46,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:46,470 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:22:46,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:22:46,471 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:46,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:46,471 INFO L85 PathProgramCache]: Analyzing trace with hash -2002760504, now seen corresponding path program 1 times [2024-10-10 23:22:46,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:46,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029571478] [2024-10-10 23:22:46,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:46,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:46,997 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-10-10 23:22:46,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:46,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029571478] [2024-10-10 23:22:46,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029571478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:46,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:46,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:46,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690486594] [2024-10-10 23:22:46,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:46,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:46,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:47,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:47,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:47,000 INFO L87 Difference]: Start difference. First operand 72850 states and 77031 transitions. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states 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:22:49,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:49,948 INFO L93 Difference]: Finished difference Result 185502 states and 197113 transitions. [2024-10-10 23:22:49,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:49,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 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 479 [2024-10-10 23:22:49,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:50,275 INFO L225 Difference]: With dead ends: 185502 [2024-10-10 23:22:50,275 INFO L226 Difference]: Without dead ends: 112653 [2024-10-10 23:22:50,317 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:22:50,317 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 661 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2246 mSolverCounterSat, 639 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 2885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 639 IncrementalHoareTripleChecker+Valid, 2246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:50,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 470 Invalid, 2885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [639 Valid, 2246 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:22:50,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112653 states. [2024-10-10 23:22:51,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112653 to 109649. [2024-10-10 23:22:51,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109649 states, 109648 states have (on average 1.056398657522253) internal successors, (115832), 109648 states have internal predecessors, (115832), 0 states have call successors, (0), 0 states 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:22:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109649 states to 109649 states and 115832 transitions. [2024-10-10 23:22:51,707 INFO L78 Accepts]: Start accepts. Automaton has 109649 states and 115832 transitions. Word has length 479 [2024-10-10 23:22:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:51,707 INFO L471 AbstractCegarLoop]: Abstraction has 109649 states and 115832 transitions. [2024-10-10 23:22:51,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states 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:22:51,708 INFO L276 IsEmpty]: Start isEmpty. Operand 109649 states and 115832 transitions. [2024-10-10 23:22:51,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2024-10-10 23:22:51,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:51,727 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 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] [2024-10-10 23:22:51,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:22:51,727 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:51,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:51,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1368972520, now seen corresponding path program 1 times [2024-10-10 23:22:51,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:51,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842825541] [2024-10-10 23:22:51,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:51,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:52,428 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2024-10-10 23:22:52,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:52,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842825541] [2024-10-10 23:22:52,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842825541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:52,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:52,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:52,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617963513] [2024-10-10 23:22:52,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:52,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:52,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:52,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:52,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:52,431 INFO L87 Difference]: Start difference. First operand 109649 states and 115832 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states 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:22:55,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:55,180 INFO L93 Difference]: Finished difference Result 241827 states and 255682 transitions. [2024-10-10 23:22:55,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:55,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 564 [2024-10-10 23:22:55,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:55,352 INFO L225 Difference]: With dead ends: 241827 [2024-10-10 23:22:55,352 INFO L226 Difference]: Without dead ends: 132179 [2024-10-10 23:22:55,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:22:55,406 INFO L432 NwaCegarLoop]: 1107 mSDtfsCounter, 834 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2163 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 2578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 2163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:55,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 1114 Invalid, 2578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 2163 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:22:55,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132179 states. [2024-10-10 23:22:57,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132179 to 130677. [2024-10-10 23:22:57,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130677 states, 130676 states have (on average 1.050904527227647) internal successors, (137328), 130676 states have internal predecessors, (137328), 0 states have call successors, (0), 0 states 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:22:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130677 states to 130677 states and 137328 transitions. [2024-10-10 23:22:57,365 INFO L78 Accepts]: Start accepts. Automaton has 130677 states and 137328 transitions. Word has length 564 [2024-10-10 23:22:57,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:57,365 INFO L471 AbstractCegarLoop]: Abstraction has 130677 states and 137328 transitions. [2024-10-10 23:22:57,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states 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:22:57,366 INFO L276 IsEmpty]: Start isEmpty. Operand 130677 states and 137328 transitions. [2024-10-10 23:22:57,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1051 [2024-10-10 23:22:57,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:57,423 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:57,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:22:57,423 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:57,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:57,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1241942846, now seen corresponding path program 1 times [2024-10-10 23:22:57,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:57,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215736166] [2024-10-10 23:22:57,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:57,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 192 proven. 372 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-10-10 23:22:59,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:59,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215736166] [2024-10-10 23:22:59,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215736166] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:22:59,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774766728] [2024-10-10 23:22:59,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:59,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:22:59,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:22:59,198 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:22:59,199 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:22:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:59,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:22:59,557 INFO L278 TraceCheckSpWp]: Computing forward predicates...