./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_label35.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_label35.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 d2c88e57f95302454037a8b8cda92c4c6c828f58a1c1642f9d0e242d65cc598d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:23:17,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:23:17,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:23:17,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:23:17,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:23:18,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:23:18,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:23:18,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:23:18,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:23:18,026 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:23:18,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:23:18,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:23:18,028 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:23:18,029 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:23:18,029 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:23:18,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:23:18,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:23:18,030 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:23:18,030 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:23:18,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:23:18,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:23:18,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:23:18,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:23:18,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:23:18,032 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:23:18,033 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:23:18,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:23:18,033 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:23:18,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:23:18,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:23:18,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:23:18,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:23:18,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:23:18,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:23:18,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:23:18,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:23:18,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:23:18,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:23:18,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:23:18,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:23:18,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:23:18,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:23:18,037 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 -> d2c88e57f95302454037a8b8cda92c4c6c828f58a1c1642f9d0e242d65cc598d [2024-10-10 23:23:18,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:23:18,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:23:18,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:23:18,378 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:23:18,378 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:23:18,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label35.c [2024-10-10 23:23:19,847 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:23:20,273 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:23:20,275 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label35.c [2024-10-10 23:23:20,307 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/264d46de7/2a66ac7fc5684686aaeef7694fb628b0/FLAG63592fedf [2024-10-10 23:23:20,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/264d46de7/2a66ac7fc5684686aaeef7694fb628b0 [2024-10-10 23:23:20,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:23:20,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:23:20,330 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:23:20,330 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:23:20,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:23:20,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:23:20" (1/1) ... [2024-10-10 23:23:20,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a279c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:20, skipping insertion in model container [2024-10-10 23:23:20,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:23:20" (1/1) ... [2024-10-10 23:23:20,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:23:20,698 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_label35.c[1310,1323] [2024-10-10 23:23:21,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:23:21,552 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:23:21,565 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_label35.c[1310,1323] [2024-10-10 23:23:21,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:23:21,973 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:23:21,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:21 WrapperNode [2024-10-10 23:23:21,974 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:23:21,975 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:23:21,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:23:21,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:23:21,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:21" (1/1) ... [2024-10-10 23:23:22,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:21" (1/1) ... [2024-10-10 23:23:22,368 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-10-10 23:23:22,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:23:22,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:23:22,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:23:22,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:23:22,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:21" (1/1) ... [2024-10-10 23:23:22,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:21" (1/1) ... [2024-10-10 23:23:22,450 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:21" (1/1) ... [2024-10-10 23:23:22,642 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:23:22,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:21" (1/1) ... [2024-10-10 23:23:22,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:21" (1/1) ... [2024-10-10 23:23:22,819 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:21" (1/1) ... [2024-10-10 23:23:22,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:21" (1/1) ... [2024-10-10 23:23:22,881 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:21" (1/1) ... [2024-10-10 23:23:22,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:21" (1/1) ... [2024-10-10 23:23:22,955 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:23:22,957 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:23:22,957 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:23:22,958 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:23:22,958 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:21" (1/1) ... [2024-10-10 23:23:22,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:23:22,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:23:22,994 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:23:22,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:23:23,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:23:23,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:23:23,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:23:23,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:23:23,242 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:23:23,244 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:23:27,960 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-10-10 23:23:27,961 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:23:28,041 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:23:28,042 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:23:28,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:23:28 BoogieIcfgContainer [2024-10-10 23:23:28,043 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:23:28,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:23:28,046 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:23:28,050 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:23:28,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:23:20" (1/3) ... [2024-10-10 23:23:28,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8fd188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:23:28, skipping insertion in model container [2024-10-10 23:23:28,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:21" (2/3) ... [2024-10-10 23:23:28,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8fd188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:23:28, skipping insertion in model container [2024-10-10 23:23:28,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:23:28" (3/3) ... [2024-10-10 23:23:28,053 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label35.c [2024-10-10 23:23:28,071 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:23:28,071 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:23:28,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:23:28,176 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;@1bf9671c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:23:28,176 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:23:28,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:28,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-10 23:23:28,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:28,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-10 23:23:28,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:28,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:28,201 INFO L85 PathProgramCache]: Analyzing trace with hash 2003002367, now seen corresponding path program 1 times [2024-10-10 23:23:28,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:28,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816286854] [2024-10-10 23:23:28,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:28,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:28,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:23:28,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:28,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816286854] [2024-10-10 23:23:28,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816286854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:28,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:28,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:23:28,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927621624] [2024-10-10 23:23:28,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:28,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:23:28,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:28,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:23:28,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:23:28,392 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:28,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:28,488 INFO L93 Difference]: Finished difference Result 1511 states and 3005 transitions. [2024-10-10 23:23:28,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:23:28,491 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-10 23:23:28,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:28,518 INFO L225 Difference]: With dead ends: 1511 [2024-10-10 23:23:28,518 INFO L226 Difference]: Without dead ends: 754 [2024-10-10 23:23:28,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:23:28,527 INFO L432 NwaCegarLoop]: 1438 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:28,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:23:28,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-10-10 23:23:28,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-10-10 23:23:28,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2024-10-10 23:23:28,609 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 6 [2024-10-10 23:23:28,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:28,610 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2024-10-10 23:23:28,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:28,610 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2024-10-10 23:23:28,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-10 23:23:28,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:28,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-10 23:23:28,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:23:28,612 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:28,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:28,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1999238130, now seen corresponding path program 1 times [2024-10-10 23:23:28,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:28,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637553700] [2024-10-10 23:23:28,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:28,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:28,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:23:28,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:28,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637553700] [2024-10-10 23:23:28,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637553700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:28,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:28,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:23:28,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153354033] [2024-10-10 23:23:28,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:28,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:28,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:28,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:28,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:28,702 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:31,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:31,821 INFO L93 Difference]: Finished difference Result 2258 states and 4311 transitions. [2024-10-10 23:23:31,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:31,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-10 23:23:31,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:31,829 INFO L225 Difference]: With dead ends: 2258 [2024-10-10 23:23:31,830 INFO L226 Difference]: Without dead ends: 1505 [2024-10-10 23:23:31,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:31,834 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 811 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 2866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:31,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 426 Invalid, 2866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2275 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-10 23:23:31,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2024-10-10 23:23:31,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2024-10-10 23:23:31,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 1.6389627659574468) internal successors, (2465), 1504 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:31,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2465 transitions. [2024-10-10 23:23:31,884 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2465 transitions. Word has length 6 [2024-10-10 23:23:31,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:31,884 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2465 transitions. [2024-10-10 23:23:31,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:31,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2465 transitions. [2024-10-10 23:23:31,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-10 23:23:31,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:31,886 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:23:31,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:23:31,888 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:31,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:31,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2065069026, now seen corresponding path program 1 times [2024-10-10 23:23:31,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:31,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270121503] [2024-10-10 23:23:31,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:31,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:32,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:23:32,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:32,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270121503] [2024-10-10 23:23:32,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270121503] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:32,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:32,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:32,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581522012] [2024-10-10 23:23:32,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:32,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:32,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:32,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:32,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:32,156 INFO L87 Difference]: Start difference. First operand 1505 states and 2465 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:35,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:35,463 INFO L93 Difference]: Finished difference Result 4511 states and 7392 transitions. [2024-10-10 23:23:35,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:35,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-10 23:23:35,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:35,477 INFO L225 Difference]: With dead ends: 4511 [2024-10-10 23:23:35,477 INFO L226 Difference]: Without dead ends: 3007 [2024-10-10 23:23:35,481 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:23:35,482 INFO L432 NwaCegarLoop]: 1381 mSDtfsCounter, 772 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1983 mSolverCounterSat, 885 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 885 IncrementalHoareTripleChecker+Valid, 1983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:35,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1388 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [885 Valid, 1983 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-10 23:23:35,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2024-10-10 23:23:35,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 3007. [2024-10-10 23:23:35,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 3006 states have (on average 1.363606121091151) internal successors, (4099), 3006 states have internal predecessors, (4099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4099 transitions. [2024-10-10 23:23:35,540 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4099 transitions. Word has length 77 [2024-10-10 23:23:35,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:35,541 INFO L471 AbstractCegarLoop]: Abstraction has 3007 states and 4099 transitions. [2024-10-10 23:23:35,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:35,541 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4099 transitions. [2024-10-10 23:23:35,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-10 23:23:35,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:35,543 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:23:35,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:23:35,544 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:35,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:35,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1174832142, now seen corresponding path program 1 times [2024-10-10 23:23:35,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:35,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273220291] [2024-10-10 23:23:35,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:35,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:23:35,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:35,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273220291] [2024-10-10 23:23:35,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273220291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:35,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:35,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:23:35,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360229954] [2024-10-10 23:23:35,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:35,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:35,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:35,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:35,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:35,709 INFO L87 Difference]: Start difference. First operand 3007 states and 4099 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:38,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:38,299 INFO L93 Difference]: Finished difference Result 7515 states and 10660 transitions. [2024-10-10 23:23:38,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:38,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-10-10 23:23:38,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:38,316 INFO L225 Difference]: With dead ends: 7515 [2024-10-10 23:23:38,316 INFO L226 Difference]: Without dead ends: 4509 [2024-10-10 23:23:38,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:38,323 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 748 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2017 mSolverCounterSat, 910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 2927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 910 IncrementalHoareTripleChecker+Valid, 2017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:38,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 518 Invalid, 2927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [910 Valid, 2017 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:23:38,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4509 states. [2024-10-10 23:23:38,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4509 to 4509. [2024-10-10 23:23:38,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4509 states, 4508 states have (on average 1.3251996450754215) internal successors, (5974), 4508 states have internal predecessors, (5974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:38,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4509 states to 4509 states and 5974 transitions. [2024-10-10 23:23:38,406 INFO L78 Accepts]: Start accepts. Automaton has 4509 states and 5974 transitions. Word has length 80 [2024-10-10 23:23:38,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:38,408 INFO L471 AbstractCegarLoop]: Abstraction has 4509 states and 5974 transitions. [2024-10-10 23:23:38,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:38,409 INFO L276 IsEmpty]: Start isEmpty. Operand 4509 states and 5974 transitions. [2024-10-10 23:23:38,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-10 23:23:38,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:38,415 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:23:38,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:23:38,415 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:38,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:38,416 INFO L85 PathProgramCache]: Analyzing trace with hash -235848731, now seen corresponding path program 1 times [2024-10-10 23:23:38,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:38,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041287774] [2024-10-10 23:23:38,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:38,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:38,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:23:38,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:38,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041287774] [2024-10-10 23:23:38,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041287774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:38,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:38,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:38,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978023925] [2024-10-10 23:23:38,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:38,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:23:38,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:38,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:23:38,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:23:38,697 INFO L87 Difference]: Start difference. First operand 4509 states and 5974 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:42,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:42,840 INFO L93 Difference]: Finished difference Result 14274 states and 18790 transitions. [2024-10-10 23:23:42,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:23:42,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-10-10 23:23:42,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:42,874 INFO L225 Difference]: With dead ends: 14274 [2024-10-10 23:23:42,874 INFO L226 Difference]: Without dead ends: 9766 [2024-10-10 23:23:42,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:23:42,883 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 2159 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4750 mSolverCounterSat, 778 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2159 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 5528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 778 IncrementalHoareTripleChecker+Valid, 4750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:42,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2159 Valid, 185 Invalid, 5528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [778 Valid, 4750 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-10 23:23:42,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9766 states. [2024-10-10 23:23:43,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9766 to 9015. [2024-10-10 23:23:43,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9015 states, 9014 states have (on average 1.3037497226536499) internal successors, (11752), 9014 states have internal predecessors, (11752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:43,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9015 states to 9015 states and 11752 transitions. [2024-10-10 23:23:43,043 INFO L78 Accepts]: Start accepts. Automaton has 9015 states and 11752 transitions. Word has length 91 [2024-10-10 23:23:43,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:43,044 INFO L471 AbstractCegarLoop]: Abstraction has 9015 states and 11752 transitions. [2024-10-10 23:23:43,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:43,044 INFO L276 IsEmpty]: Start isEmpty. Operand 9015 states and 11752 transitions. [2024-10-10 23:23:43,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-10 23:23:43,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:43,053 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:23:43,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:23:43,053 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:43,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:43,053 INFO L85 PathProgramCache]: Analyzing trace with hash 862310422, now seen corresponding path program 1 times [2024-10-10 23:23:43,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:43,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841732856] [2024-10-10 23:23:43,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:43,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:43,509 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-10 23:23:43,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:43,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841732856] [2024-10-10 23:23:43,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841732856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:43,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:43,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:43,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259081742] [2024-10-10 23:23:43,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:43,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:23:43,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:43,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:23:43,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:23:43,514 INFO L87 Difference]: Start difference. First operand 9015 states and 11752 transitions. Second operand has 4 states, 4 states have (on average 44.0) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:47,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:47,080 INFO L93 Difference]: Finished difference Result 22574 states and 30202 transitions. [2024-10-10 23:23:47,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:23:47,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 210 [2024-10-10 23:23:47,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:47,121 INFO L225 Difference]: With dead ends: 22574 [2024-10-10 23:23:47,121 INFO L226 Difference]: Without dead ends: 12772 [2024-10-10 23:23:47,132 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:23:47,133 INFO L432 NwaCegarLoop]: 693 mSDtfsCounter, 690 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3807 mSolverCounterSat, 663 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 4470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 663 IncrementalHoareTripleChecker+Valid, 3807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:47,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 711 Invalid, 4470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [663 Valid, 3807 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-10 23:23:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12772 states. [2024-10-10 23:23:47,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12772 to 12770. [2024-10-10 23:23:47,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12770 states, 12769 states have (on average 1.2170882606312163) internal successors, (15541), 12769 states have internal predecessors, (15541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12770 states to 12770 states and 15541 transitions. [2024-10-10 23:23:47,386 INFO L78 Accepts]: Start accepts. Automaton has 12770 states and 15541 transitions. Word has length 210 [2024-10-10 23:23:47,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:47,387 INFO L471 AbstractCegarLoop]: Abstraction has 12770 states and 15541 transitions. [2024-10-10 23:23:47,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:47,388 INFO L276 IsEmpty]: Start isEmpty. Operand 12770 states and 15541 transitions. [2024-10-10 23:23:47,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-10 23:23:47,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:47,393 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:23:47,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:23:47,397 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:47,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:47,398 INFO L85 PathProgramCache]: Analyzing trace with hash -438198980, now seen corresponding path program 1 times [2024-10-10 23:23:47,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:47,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143372140] [2024-10-10 23:23:47,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:47,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:47,815 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 41 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:23:47,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:47,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143372140] [2024-10-10 23:23:47,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143372140] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:23:47,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948479282] [2024-10-10 23:23:47,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:47,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:23:47,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:23:47,819 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:23:47,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:23:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:47,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:23:47,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:23:48,000 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-10 23:23:48,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:23:48,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948479282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:48,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:23:48,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 23:23:48,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328167518] [2024-10-10 23:23:48,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:48,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:48,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:48,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:48,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:23:48,003 INFO L87 Difference]: Start difference. First operand 12770 states and 15541 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:50,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:50,915 INFO L93 Difference]: Finished difference Result 32298 states and 40250 transitions. [2024-10-10 23:23:50,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:50,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2024-10-10 23:23:50,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:50,953 INFO L225 Difference]: With dead ends: 32298 [2024-10-10 23:23:50,953 INFO L226 Difference]: Without dead ends: 20280 [2024-10-10 23:23:50,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:23:50,970 INFO L432 NwaCegarLoop]: 962 mSDtfsCounter, 805 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2301 mSolverCounterSat, 745 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 3046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 745 IncrementalHoareTripleChecker+Valid, 2301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:50,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 969 Invalid, 3046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [745 Valid, 2301 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:23:50,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20280 states. [2024-10-10 23:23:51,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20280 to 18778. [2024-10-10 23:23:51,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18778 states, 18777 states have (on average 1.2514778718645152) internal successors, (23499), 18777 states have internal predecessors, (23499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:51,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18778 states to 18778 states and 23499 transitions. [2024-10-10 23:23:51,243 INFO L78 Accepts]: Start accepts. Automaton has 18778 states and 23499 transitions. Word has length 236 [2024-10-10 23:23:51,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:51,245 INFO L471 AbstractCegarLoop]: Abstraction has 18778 states and 23499 transitions. [2024-10-10 23:23:51,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:51,245 INFO L276 IsEmpty]: Start isEmpty. Operand 18778 states and 23499 transitions. [2024-10-10 23:23:51,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2024-10-10 23:23:51,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:51,253 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:23:51,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:23:51,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:23:51,455 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:51,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:51,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1826750826, now seen corresponding path program 1 times [2024-10-10 23:23:51,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:51,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465226344] [2024-10-10 23:23:51,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:51,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-10 23:23:51,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:51,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465226344] [2024-10-10 23:23:51,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465226344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:51,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:51,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:51,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669970286] [2024-10-10 23:23:51,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:51,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:51,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:51,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:51,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:51,760 INFO L87 Difference]: Start difference. First operand 18778 states and 23499 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:23:54,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:54,727 INFO L93 Difference]: Finished difference Result 50322 states and 64011 transitions. [2024-10-10 23:23:54,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:54,727 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 386 [2024-10-10 23:23:54,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:54,799 INFO L225 Difference]: With dead ends: 50322 [2024-10-10 23:23:54,799 INFO L226 Difference]: Without dead ends: 32296 [2024-10-10 23:23:54,825 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:23:54,827 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 670 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2204 mSolverCounterSat, 732 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 2936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 732 IncrementalHoareTripleChecker+Valid, 2204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:54,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 314 Invalid, 2936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [732 Valid, 2204 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:23:54,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32296 states. [2024-10-10 23:23:55,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32296 to 32296. [2024-10-10 23:23:55,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32296 states, 32295 states have (on average 1.2191670537234867) internal successors, (39373), 32295 states have internal predecessors, (39373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:55,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32296 states to 32296 states and 39373 transitions. [2024-10-10 23:23:55,244 INFO L78 Accepts]: Start accepts. Automaton has 32296 states and 39373 transitions. Word has length 386 [2024-10-10 23:23:55,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:55,245 INFO L471 AbstractCegarLoop]: Abstraction has 32296 states and 39373 transitions. [2024-10-10 23:23:55,245 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:23:55,246 INFO L276 IsEmpty]: Start isEmpty. Operand 32296 states and 39373 transitions. [2024-10-10 23:23:55,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2024-10-10 23:23:55,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:55,260 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:23:55,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:23:55,261 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:55,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:55,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1491305548, now seen corresponding path program 1 times [2024-10-10 23:23:55,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:55,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930075776] [2024-10-10 23:23:55,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:55,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:55,634 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-10 23:23:55,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:55,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930075776] [2024-10-10 23:23:55,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930075776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:55,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:55,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:55,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638243703] [2024-10-10 23:23:55,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:55,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:55,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:55,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:55,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:55,639 INFO L87 Difference]: Start difference. First operand 32296 states and 39373 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:58,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:58,392 INFO L93 Difference]: Finished difference Result 75856 states and 94530 transitions. [2024-10-10 23:23:58,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:58,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 395 [2024-10-10 23:23:58,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:58,461 INFO L225 Difference]: With dead ends: 75856 [2024-10-10 23:23:58,462 INFO L226 Difference]: Without dead ends: 44312 [2024-10-10 23:23:58,497 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:23:58,498 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 680 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2104 mSolverCounterSat, 863 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 2967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 863 IncrementalHoareTripleChecker+Valid, 2104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:58,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 330 Invalid, 2967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [863 Valid, 2104 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:23:58,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44312 states. [2024-10-10 23:23:59,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44312 to 44312. [2024-10-10 23:23:59,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44312 states, 44311 states have (on average 1.2252939450700728) internal successors, (54294), 44311 states have internal predecessors, (54294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:59,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44312 states to 44312 states and 54294 transitions. [2024-10-10 23:23:59,115 INFO L78 Accepts]: Start accepts. Automaton has 44312 states and 54294 transitions. Word has length 395 [2024-10-10 23:23:59,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:59,116 INFO L471 AbstractCegarLoop]: Abstraction has 44312 states and 54294 transitions. [2024-10-10 23:23:59,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:59,117 INFO L276 IsEmpty]: Start isEmpty. Operand 44312 states and 54294 transitions. [2024-10-10 23:23:59,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2024-10-10 23:23:59,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:59,129 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:23:59,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:23:59,131 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:59,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:59,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2111065490, now seen corresponding path program 1 times [2024-10-10 23:23:59,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:59,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540429653] [2024-10-10 23:23:59,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:59,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:59,426 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2024-10-10 23:23:59,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:59,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540429653] [2024-10-10 23:23:59,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540429653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:59,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:59,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:23:59,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073432648] [2024-10-10 23:23:59,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:59,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:59,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:59,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:59,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:59,429 INFO L87 Difference]: Start difference. First operand 44312 states and 54294 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:24:02,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:02,720 INFO L93 Difference]: Finished difference Result 120167 states and 148617 transitions. [2024-10-10 23:24:02,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:24:02,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 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 407 [2024-10-10 23:24:02,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:02,835 INFO L225 Difference]: With dead ends: 120167 [2024-10-10 23:24:02,835 INFO L226 Difference]: Without dead ends: 71350 [2024-10-10 23:24:02,952 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:24:02,952 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 817 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2318 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 2782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 2318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:02,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 321 Invalid, 2782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 2318 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:24:02,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71350 states. [2024-10-10 23:24:03,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71350 to 69095. [2024-10-10 23:24:03,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69095 states, 69094 states have (on average 1.1719396763828986) internal successors, (80974), 69094 states have internal predecessors, (80974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:24:03,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69095 states to 69095 states and 80974 transitions. [2024-10-10 23:24:03,951 INFO L78 Accepts]: Start accepts. Automaton has 69095 states and 80974 transitions. Word has length 407 [2024-10-10 23:24:03,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:03,952 INFO L471 AbstractCegarLoop]: Abstraction has 69095 states and 80974 transitions. [2024-10-10 23:24:03,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:24:03,953 INFO L276 IsEmpty]: Start isEmpty. Operand 69095 states and 80974 transitions. [2024-10-10 23:24:03,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2024-10-10 23:24:03,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:03,981 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:24:03,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:24:03,981 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:03,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:03,985 INFO L85 PathProgramCache]: Analyzing trace with hash 380675477, now seen corresponding path program 1 times [2024-10-10 23:24:03,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:03,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040249207] [2024-10-10 23:24:03,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:03,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:04,720 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-10 23:24:04,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:04,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040249207] [2024-10-10 23:24:04,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040249207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:04,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:04,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:24:04,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205482199] [2024-10-10 23:24:04,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:04,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:24:04,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:04,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:24:04,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:24:04,723 INFO L87 Difference]: Start difference. First operand 69095 states and 80974 transitions. Second operand has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:24:07,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:07,565 INFO L93 Difference]: Finished difference Result 153960 states and 181219 transitions. [2024-10-10 23:24:07,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:24:07,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 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 424 [2024-10-10 23:24:07,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:07,811 INFO L225 Difference]: With dead ends: 153960 [2024-10-10 23:24:07,811 INFO L226 Difference]: Without dead ends: 85617 [2024-10-10 23:24:07,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:24:07,854 INFO L432 NwaCegarLoop]: 1235 mSDtfsCounter, 696 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2288 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 2663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 2288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:07,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1242 Invalid, 2663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 2288 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:24:07,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85617 states. [2024-10-10 23:24:08,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85617 to 81862. [2024-10-10 23:24:08,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81862 states, 81861 states have (on average 1.1589157229938554) internal successors, (94870), 81861 states have internal predecessors, (94870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:24:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81862 states to 81862 states and 94870 transitions. [2024-10-10 23:24:09,037 INFO L78 Accepts]: Start accepts. Automaton has 81862 states and 94870 transitions. Word has length 424 [2024-10-10 23:24:09,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:09,037 INFO L471 AbstractCegarLoop]: Abstraction has 81862 states and 94870 transitions. [2024-10-10 23:24:09,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:24:09,038 INFO L276 IsEmpty]: Start isEmpty. Operand 81862 states and 94870 transitions. [2024-10-10 23:24:09,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2024-10-10 23:24:09,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:09,047 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:24:09,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:24:09,047 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:09,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:09,048 INFO L85 PathProgramCache]: Analyzing trace with hash -713057436, now seen corresponding path program 1 times [2024-10-10 23:24:09,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:09,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894767525] [2024-10-10 23:24:09,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:09,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:09,665 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-10 23:24:09,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:09,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894767525] [2024-10-10 23:24:09,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894767525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:09,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:09,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:24:09,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006620728] [2024-10-10 23:24:09,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:09,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:24:09,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:09,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:24:09,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:24:09,668 INFO L87 Difference]: Start difference. First operand 81862 states and 94870 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:24:12,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:12,688 INFO L93 Difference]: Finished difference Result 188506 states and 219993 transitions. [2024-10-10 23:24:12,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:24:12,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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 427 [2024-10-10 23:24:12,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:12,816 INFO L225 Difference]: With dead ends: 188506 [2024-10-10 23:24:12,817 INFO L226 Difference]: Without dead ends: 107396 [2024-10-10 23:24:12,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:24:12,865 INFO L432 NwaCegarLoop]: 1239 mSDtfsCounter, 606 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2193 mSolverCounterSat, 504 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 2697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 504 IncrementalHoareTripleChecker+Valid, 2193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:12,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 1246 Invalid, 2697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [504 Valid, 2193 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:24:12,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107396 states. [2024-10-10 23:24:13,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107396 to 102890. [2024-10-10 23:24:14,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102890 states, 102889 states have (on average 1.1285268590422688) internal successors, (116113), 102889 states have internal predecessors, (116113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:24:14,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102890 states to 102890 states and 116113 transitions. [2024-10-10 23:24:14,133 INFO L78 Accepts]: Start accepts. Automaton has 102890 states and 116113 transitions. Word has length 427 [2024-10-10 23:24:14,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:14,134 INFO L471 AbstractCegarLoop]: Abstraction has 102890 states and 116113 transitions. [2024-10-10 23:24:14,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:24:14,134 INFO L276 IsEmpty]: Start isEmpty. Operand 102890 states and 116113 transitions. [2024-10-10 23:24:14,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2024-10-10 23:24:14,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:14,141 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:24:14,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:24:14,141 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:14,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:14,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1767307025, now seen corresponding path program 1 times [2024-10-10 23:24:14,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:14,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388634531] [2024-10-10 23:24:14,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:14,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:15,035 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-10 23:24:15,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:15,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388634531] [2024-10-10 23:24:15,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388634531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:15,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:15,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:24:15,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581957491] [2024-10-10 23:24:15,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:15,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:24:15,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:15,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:24:15,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:24:15,040 INFO L87 Difference]: Start difference. First operand 102890 states and 116113 transitions. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:24:18,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:18,459 INFO L93 Difference]: Finished difference Result 250088 states and 281682 transitions. [2024-10-10 23:24:18,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:24:18,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 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 440 [2024-10-10 23:24:18,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:18,647 INFO L225 Difference]: With dead ends: 250088 [2024-10-10 23:24:18,647 INFO L226 Difference]: Without dead ends: 147950 [2024-10-10 23:24:18,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:24:18,720 INFO L432 NwaCegarLoop]: 1238 mSDtfsCounter, 564 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2569 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 2873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 2569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:18,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1245 Invalid, 2873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 2569 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:24:18,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147950 states. [2024-10-10 23:24:20,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147950 to 143444. [2024-10-10 23:24:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143444 states, 143443 states have (on average 1.118256032012716) internal successors, (160406), 143443 states have internal predecessors, (160406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:24:21,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143444 states to 143444 states and 160406 transitions. [2024-10-10 23:24:21,083 INFO L78 Accepts]: Start accepts. Automaton has 143444 states and 160406 transitions. Word has length 440 [2024-10-10 23:24:21,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:21,083 INFO L471 AbstractCegarLoop]: Abstraction has 143444 states and 160406 transitions. [2024-10-10 23:24:21,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:24:21,084 INFO L276 IsEmpty]: Start isEmpty. Operand 143444 states and 160406 transitions. [2024-10-10 23:24:21,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2024-10-10 23:24:21,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:21,103 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:24:21,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:24:21,104 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:21,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:21,105 INFO L85 PathProgramCache]: Analyzing trace with hash 301089674, now seen corresponding path program 1 times [2024-10-10 23:24:21,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:21,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507473570] [2024-10-10 23:24:21,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:21,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:21,600 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 511 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-10-10 23:24:21,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:21,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507473570] [2024-10-10 23:24:21,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507473570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:21,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:21,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:24:21,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698046048] [2024-10-10 23:24:21,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:21,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:24:21,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:21,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:24:21,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:24:21,605 INFO L87 Difference]: Start difference. First operand 143444 states and 160406 transitions. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:24:25,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:25,040 INFO L93 Difference]: Finished difference Result 290642 states and 324665 transitions. [2024-10-10 23:24:25,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:24:25,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 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 528 [2024-10-10 23:24:25,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:25,235 INFO L225 Difference]: With dead ends: 290642 [2024-10-10 23:24:25,235 INFO L226 Difference]: Without dead ends: 147950 [2024-10-10 23:24:25,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:24:25,323 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 734 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 604 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 604 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:25,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 214 Invalid, 2840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [604 Valid, 2236 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:24:25,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147950 states. [2024-10-10 23:24:27,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147950 to 143444. [2024-10-10 23:24:27,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143444 states, 143443 states have (on average 1.1122536477904115) internal successors, (159545), 143443 states have internal predecessors, (159545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:24:27,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143444 states to 143444 states and 159545 transitions. [2024-10-10 23:24:27,437 INFO L78 Accepts]: Start accepts. Automaton has 143444 states and 159545 transitions. Word has length 528 [2024-10-10 23:24:27,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:27,438 INFO L471 AbstractCegarLoop]: Abstraction has 143444 states and 159545 transitions. [2024-10-10 23:24:27,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:24:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 143444 states and 159545 transitions. [2024-10-10 23:24:27,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2024-10-10 23:24:27,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:27,449 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:24:27,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:24:27,449 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:27,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:27,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1766767273, now seen corresponding path program 1 times [2024-10-10 23:24:27,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:27,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211495660] [2024-10-10 23:24:27,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:27,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:28,358 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-10 23:24:28,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:28,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211495660] [2024-10-10 23:24:28,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211495660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:28,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:28,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:24:28,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510875127] [2024-10-10 23:24:28,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:28,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:24:28,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:28,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:24:28,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:24:28,364 INFO L87 Difference]: Start difference. First operand 143444 states and 159545 transitions. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:24:32,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:32,428 INFO L93 Difference]: Finished difference Result 337204 states and 377088 transitions. [2024-10-10 23:24:32,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:24:32,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 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 551 [2024-10-10 23:24:32,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:32,662 INFO L225 Difference]: With dead ends: 337204 [2024-10-10 23:24:32,662 INFO L226 Difference]: Without dead ends: 194512 [2024-10-10 23:24:32,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:24:32,725 INFO L432 NwaCegarLoop]: 1229 mSDtfsCounter, 535 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2114 mSolverCounterSat, 642 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 2756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 642 IncrementalHoareTripleChecker+Valid, 2114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:32,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1235 Invalid, 2756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [642 Valid, 2114 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:24:32,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194512 states.