./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label46.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label46.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 829096e7f479f5346a6eede2bd426bfcc729b36401312306aa48ba670b26d42a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:30:25,443 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:30:25,510 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:30:25,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:30:25,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:30:25,547 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:30:25,548 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:30:25,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:30:25,549 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:30:25,550 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:30:25,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:30:25,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:30:25,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:30:25,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:30:25,552 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:30:25,554 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:30:25,554 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:30:25,555 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:30:25,555 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:30:25,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:30:25,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:30:25,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:30:25,560 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:30:25,560 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:30:25,560 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:30:25,561 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:30:25,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:30:25,561 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:30:25,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:30:25,562 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:30:25,562 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:30:25,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:30:25,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:30:25,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:30:25,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:30:25,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:30:25,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:30:25,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:30:25,564 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:30:25,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:30:25,564 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:30:25,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:30:25,566 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 -> 829096e7f479f5346a6eede2bd426bfcc729b36401312306aa48ba670b26d42a [2024-10-10 23:30:25,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:30:25,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:30:25,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:30:25,877 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:30:25,877 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:30:25,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label46.c [2024-10-10 23:30:27,388 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:30:27,875 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:30:27,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label46.c [2024-10-10 23:30:27,919 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/999d00d89/6b6c352dcb2846629ef524122a623d91/FLAGc55429df8 [2024-10-10 23:30:27,938 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/999d00d89/6b6c352dcb2846629ef524122a623d91 [2024-10-10 23:30:27,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:30:27,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:30:27,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:30:27,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:30:27,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:30:27,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:30:27" (1/1) ... [2024-10-10 23:30:27,952 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c750f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:30:27, skipping insertion in model container [2024-10-10 23:30:27,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:30:27" (1/1) ... [2024-10-10 23:30:28,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:30:28,529 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label46.c[9366,9379] [2024-10-10 23:30:29,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:30:29,454 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:30:29,491 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label46.c[9366,9379] [2024-10-10 23:30:29,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:30:30,028 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:30:30,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:30:30 WrapperNode [2024-10-10 23:30:30,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:30:30,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:30:30,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:30:30,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:30:30,039 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:30:30" (1/1) ... [2024-10-10 23:30:30,122 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:30:30" (1/1) ... [2024-10-10 23:30:30,632 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-10 23:30:30,632 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:30:30,633 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:30:30,633 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:30:30,633 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:30:30,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:30:30" (1/1) ... [2024-10-10 23:30:30,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:30:30" (1/1) ... [2024-10-10 23:30:30,874 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:30:30" (1/1) ... [2024-10-10 23:30:31,179 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:30:31,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:30:30" (1/1) ... [2024-10-10 23:30:31,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:30:30" (1/1) ... [2024-10-10 23:30:31,485 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:30:30" (1/1) ... [2024-10-10 23:30:31,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:30:30" (1/1) ... [2024-10-10 23:30:31,572 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:30:30" (1/1) ... [2024-10-10 23:30:31,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:30:30" (1/1) ... [2024-10-10 23:30:31,681 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:30:31,682 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:30:31,682 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:30:31,682 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:30:31,683 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:30:30" (1/1) ... [2024-10-10 23:30:31,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:30:31,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:30:31,716 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:30:31,722 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:30:31,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:30:31,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:30:31,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:30:31,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:30:31,829 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:30:31,831 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:30:37,646 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-10 23:30:37,646 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:30:37,715 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:30:37,716 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:30:37,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:30:37 BoogieIcfgContainer [2024-10-10 23:30:37,716 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:30:37,719 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:30:37,719 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:30:37,722 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:30:37,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:30:27" (1/3) ... [2024-10-10 23:30:37,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e1d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:30:37, skipping insertion in model container [2024-10-10 23:30:37,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:30:30" (2/3) ... [2024-10-10 23:30:37,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e1d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:30:37, skipping insertion in model container [2024-10-10 23:30:37,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:30:37" (3/3) ... [2024-10-10 23:30:37,726 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label46.c [2024-10-10 23:30:37,744 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:30:37,744 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:30:37,858 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:30:37,869 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;@4d663c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:30:37,870 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:30:37,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:37,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-10 23:30:37,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:30:37,894 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:30:37,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:30:37,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:30:37,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1852922225, now seen corresponding path program 1 times [2024-10-10 23:30:37,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:30:37,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117440525] [2024-10-10 23:30:37,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:37,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:30:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:38,144 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:30:38,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:30:38,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117440525] [2024-10-10 23:30:38,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117440525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:30:38,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:30:38,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:30:38,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466062005] [2024-10-10 23:30:38,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:30:38,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:30:38,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:30:38,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:30:38,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:30:38,188 INFO L87 Difference]: Start difference. First operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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:30:38,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:30:38,292 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2024-10-10 23:30:38,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:30:38,297 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-10-10 23:30:38,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:30:38,319 INFO L225 Difference]: With dead ends: 2071 [2024-10-10 23:30:38,319 INFO L226 Difference]: Without dead ends: 1034 [2024-10-10 23:30:38,332 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:30:38,337 INFO L432 NwaCegarLoop]: 1876 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:30:38,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1876 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:30:38,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-10 23:30:38,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-10 23:30:38,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:38,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2024-10-10 23:30:38,440 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 65 [2024-10-10 23:30:38,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:30:38,440 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2024-10-10 23:30:38,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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:30:38,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2024-10-10 23:30:38,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-10 23:30:38,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:30:38,443 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:30:38,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:30:38,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:30:38,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:30:38,444 INFO L85 PathProgramCache]: Analyzing trace with hash 915071939, now seen corresponding path program 1 times [2024-10-10 23:30:38,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:30:38,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221857325] [2024-10-10 23:30:38,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:38,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:30:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:38,929 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:30:38,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:30:38,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221857325] [2024-10-10 23:30:38,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221857325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:30:38,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:30:38,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:30:38,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459892250] [2024-10-10 23:30:38,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:30:38,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:30:38,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:30:38,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:30:38,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:30:38,937 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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:30:45,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:30:45,279 INFO L93 Difference]: Finished difference Result 3696 states and 6823 transitions. [2024-10-10 23:30:45,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:30:45,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-10-10 23:30:45,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:30:45,291 INFO L225 Difference]: With dead ends: 3696 [2024-10-10 23:30:45,291 INFO L226 Difference]: Without dead ends: 2663 [2024-10-10 23:30:45,294 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:30:45,295 INFO L432 NwaCegarLoop]: 717 mSDtfsCounter, 2630 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 4127 mSolverCounterSat, 1487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2630 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 5614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1487 IncrementalHoareTripleChecker+Valid, 4127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:30:45,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2630 Valid, 1017 Invalid, 5614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1487 Valid, 4127 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-10-10 23:30:45,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2024-10-10 23:30:45,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2662. [2024-10-10 23:30:45,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2662 states, 2661 states have (on average 1.4611048478015785) internal successors, (3888), 2661 states have internal predecessors, (3888), 0 states have call successors, (0), 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:30:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 3888 transitions. [2024-10-10 23:30:45,369 INFO L78 Accepts]: Start accepts. Automaton has 2662 states and 3888 transitions. Word has length 65 [2024-10-10 23:30:45,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:30:45,370 INFO L471 AbstractCegarLoop]: Abstraction has 2662 states and 3888 transitions. [2024-10-10 23:30:45,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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:30:45,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 3888 transitions. [2024-10-10 23:30:45,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-10 23:30:45,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:30:45,376 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:45,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:30:45,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:30:45,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:30:45,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1559178340, now seen corresponding path program 1 times [2024-10-10 23:30:45,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:30:45,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883738401] [2024-10-10 23:30:45,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:45,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:30:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:45,853 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:30:45,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:30:45,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883738401] [2024-10-10 23:30:45,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883738401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:30:45,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:30:45,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:30:45,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670435893] [2024-10-10 23:30:45,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:30:45,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:30:45,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:30:45,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:30:45,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:30:45,861 INFO L87 Difference]: Start difference. First operand 2662 states and 3888 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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:30:51,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:30:51,889 INFO L93 Difference]: Finished difference Result 7863 states and 12668 transitions. [2024-10-10 23:30:51,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:30:51,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 190 [2024-10-10 23:30:51,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:30:51,916 INFO L225 Difference]: With dead ends: 7863 [2024-10-10 23:30:51,917 INFO L226 Difference]: Without dead ends: 5989 [2024-10-10 23:30:51,923 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:30:51,925 INFO L432 NwaCegarLoop]: 892 mSDtfsCounter, 1690 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 5284 mSolverCounterSat, 843 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 6127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 843 IncrementalHoareTripleChecker+Valid, 5284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:30:51,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1690 Valid, 1066 Invalid, 6127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [843 Valid, 5284 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-10-10 23:30:51,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2024-10-10 23:30:52,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 5858. [2024-10-10 23:30:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5858 states, 5857 states have (on average 1.4452791531500768) internal successors, (8465), 5857 states have internal predecessors, (8465), 0 states have call successors, (0), 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:30:52,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5858 states to 5858 states and 8465 transitions. [2024-10-10 23:30:52,042 INFO L78 Accepts]: Start accepts. Automaton has 5858 states and 8465 transitions. Word has length 190 [2024-10-10 23:30:52,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:30:52,043 INFO L471 AbstractCegarLoop]: Abstraction has 5858 states and 8465 transitions. [2024-10-10 23:30:52,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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:30:52,044 INFO L276 IsEmpty]: Start isEmpty. Operand 5858 states and 8465 transitions. [2024-10-10 23:30:52,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-10 23:30:52,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:30:52,051 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 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:30:52,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:30:52,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:30:52,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:30:52,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1225782743, now seen corresponding path program 1 times [2024-10-10 23:30:52,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:30:52,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110053579] [2024-10-10 23:30:52,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:52,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:30:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:52,318 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-10 23:30:52,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:30:52,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110053579] [2024-10-10 23:30:52,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110053579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:30:52,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:30:52,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:30:52,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704059740] [2024-10-10 23:30:52,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:30:52,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:30:52,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:30:52,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:30:52,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:30:52,325 INFO L87 Difference]: Start difference. First operand 5858 states and 8465 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 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:30:55,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:30:55,576 INFO L93 Difference]: Finished difference Result 15686 states and 23389 transitions. [2024-10-10 23:30:55,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:30:55,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2024-10-10 23:30:55,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:30:55,610 INFO L225 Difference]: With dead ends: 15686 [2024-10-10 23:30:55,610 INFO L226 Difference]: Without dead ends: 10616 [2024-10-10 23:30:55,623 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:30:55,624 INFO L432 NwaCegarLoop]: 783 mSDtfsCounter, 919 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2555 mSolverCounterSat, 756 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 3311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 756 IncrementalHoareTripleChecker+Valid, 2555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:30:55,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 916 Invalid, 3311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [756 Valid, 2555 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:30:55,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10616 states. [2024-10-10 23:30:55,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10616 to 10607. [2024-10-10 23:30:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10607 states, 10606 states have (on average 1.3551763152932303) internal successors, (14373), 10606 states have internal predecessors, (14373), 0 states have call successors, (0), 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:30:55,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10607 states to 10607 states and 14373 transitions. [2024-10-10 23:30:55,817 INFO L78 Accepts]: Start accepts. Automaton has 10607 states and 14373 transitions. Word has length 232 [2024-10-10 23:30:55,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:30:55,818 INFO L471 AbstractCegarLoop]: Abstraction has 10607 states and 14373 transitions. [2024-10-10 23:30:55,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 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:30:55,818 INFO L276 IsEmpty]: Start isEmpty. Operand 10607 states and 14373 transitions. [2024-10-10 23:30:55,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-10 23:30:55,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:30:55,822 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:30:55,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:30:55,823 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:30:55,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:30:55,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1240464998, now seen corresponding path program 1 times [2024-10-10 23:30:55,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:30:55,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963032740] [2024-10-10 23:30:55,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:55,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:30:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-10 23:30:56,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:30:56,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963032740] [2024-10-10 23:30:56,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963032740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:30:56,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:30:56,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:30:56,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459302206] [2024-10-10 23:30:56,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:30:56,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:30:56,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:30:56,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:30:56,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:30:56,075 INFO L87 Difference]: Start difference. First operand 10607 states and 14373 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 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:30:59,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:30:59,334 INFO L93 Difference]: Finished difference Result 28350 states and 39239 transitions. [2024-10-10 23:30:59,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:30:59,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 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 246 [2024-10-10 23:30:59,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:30:59,377 INFO L225 Difference]: With dead ends: 28350 [2024-10-10 23:30:59,377 INFO L226 Difference]: Without dead ends: 18531 [2024-10-10 23:30:59,391 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:30:59,393 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 909 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 2873 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 3417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:30:59,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 611 Invalid, 3417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2873 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:30:59,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18531 states. [2024-10-10 23:30:59,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18531 to 18522. [2024-10-10 23:30:59,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18522 states, 18521 states have (on average 1.3251444306462934) internal successors, (24543), 18521 states have internal predecessors, (24543), 0 states have call successors, (0), 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:30:59,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18522 states to 18522 states and 24543 transitions. [2024-10-10 23:30:59,749 INFO L78 Accepts]: Start accepts. Automaton has 18522 states and 24543 transitions. Word has length 246 [2024-10-10 23:30:59,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:30:59,750 INFO L471 AbstractCegarLoop]: Abstraction has 18522 states and 24543 transitions. [2024-10-10 23:30:59,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 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:30:59,750 INFO L276 IsEmpty]: Start isEmpty. Operand 18522 states and 24543 transitions. [2024-10-10 23:30:59,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-10-10 23:30:59,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:30:59,754 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:30:59,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:30:59,755 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:30:59,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:30:59,755 INFO L85 PathProgramCache]: Analyzing trace with hash 297781977, now seen corresponding path program 1 times [2024-10-10 23:30:59,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:30:59,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697034623] [2024-10-10 23:30:59,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:59,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:30:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:59,953 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:30:59,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:30:59,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697034623] [2024-10-10 23:30:59,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697034623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:30:59,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:30:59,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:30:59,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876078289] [2024-10-10 23:30:59,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:30:59,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:30:59,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:30:59,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:30:59,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:30:59,957 INFO L87 Difference]: Start difference. First operand 18522 states and 24543 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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:31:03,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:31:03,427 INFO L93 Difference]: Finished difference Result 52014 states and 69798 transitions. [2024-10-10 23:31:03,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:31:03,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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 264 [2024-10-10 23:31:03,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:31:03,490 INFO L225 Difference]: With dead ends: 52014 [2024-10-10 23:31:03,491 INFO L226 Difference]: Without dead ends: 34280 [2024-10-10 23:31:03,512 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:31:03,513 INFO L432 NwaCegarLoop]: 831 mSDtfsCounter, 851 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2394 mSolverCounterSat, 915 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 3309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 915 IncrementalHoareTripleChecker+Valid, 2394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:31:03,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 949 Invalid, 3309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [915 Valid, 2394 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-10 23:31:03,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34280 states. [2024-10-10 23:31:03,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34280 to 34270. [2024-10-10 23:31:03,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34270 states, 34269 states have (on average 1.255040999153754) internal successors, (43009), 34269 states have internal predecessors, (43009), 0 states have call successors, (0), 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:31:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34270 states to 34270 states and 43009 transitions. [2024-10-10 23:31:04,000 INFO L78 Accepts]: Start accepts. Automaton has 34270 states and 43009 transitions. Word has length 264 [2024-10-10 23:31:04,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:31:04,003 INFO L471 AbstractCegarLoop]: Abstraction has 34270 states and 43009 transitions. [2024-10-10 23:31:04,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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:31:04,003 INFO L276 IsEmpty]: Start isEmpty. Operand 34270 states and 43009 transitions. [2024-10-10 23:31:04,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-10-10 23:31:04,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:31:04,008 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:31:04,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:31:04,009 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:31:04,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:31:04,009 INFO L85 PathProgramCache]: Analyzing trace with hash 979253340, now seen corresponding path program 1 times [2024-10-10 23:31:04,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:31:04,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222020306] [2024-10-10 23:31:04,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:31:04,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:31:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:31:04,293 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-10 23:31:04,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:31:04,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222020306] [2024-10-10 23:31:04,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222020306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:31:04,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:31:04,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:31:04,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73967522] [2024-10-10 23:31:04,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:31:04,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:31:04,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:31:04,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:31:04,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:31:04,296 INFO L87 Difference]: Start difference. First operand 34270 states and 43009 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 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:31:07,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:31:07,837 INFO L93 Difference]: Finished difference Result 92928 states and 117619 transitions. [2024-10-10 23:31:07,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:31:07,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 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 295 [2024-10-10 23:31:07,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:31:07,955 INFO L225 Difference]: With dead ends: 92928 [2024-10-10 23:31:07,956 INFO L226 Difference]: Without dead ends: 59446 [2024-10-10 23:31:08,000 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:31:08,001 INFO L432 NwaCegarLoop]: 837 mSDtfsCounter, 857 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 869 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 3178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 869 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:31:08,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 984 Invalid, 3178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [869 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-10 23:31:08,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59446 states. [2024-10-10 23:31:08,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59446 to 57868. [2024-10-10 23:31:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57868 states, 57867 states have (on average 1.1960530181277758) internal successors, (69212), 57867 states have internal predecessors, (69212), 0 states have call successors, (0), 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:31:08,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57868 states to 57868 states and 69212 transitions. [2024-10-10 23:31:08,711 INFO L78 Accepts]: Start accepts. Automaton has 57868 states and 69212 transitions. Word has length 295 [2024-10-10 23:31:08,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:31:08,712 INFO L471 AbstractCegarLoop]: Abstraction has 57868 states and 69212 transitions. [2024-10-10 23:31:08,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 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:31:08,712 INFO L276 IsEmpty]: Start isEmpty. Operand 57868 states and 69212 transitions. [2024-10-10 23:31:08,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-10-10 23:31:08,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:31:08,719 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 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:31:08,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:31:08,720 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:31:08,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:31:08,720 INFO L85 PathProgramCache]: Analyzing trace with hash -565542641, now seen corresponding path program 1 times [2024-10-10 23:31:08,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:31:08,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882439696] [2024-10-10 23:31:08,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:31:08,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:31:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:31:09,031 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 363 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-10 23:31:09,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:31:09,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882439696] [2024-10-10 23:31:09,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882439696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:31:09,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:31:09,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:31:09,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142615741] [2024-10-10 23:31:09,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:31:09,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:31:09,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:31:09,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:31:09,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:31:09,034 INFO L87 Difference]: Start difference. First operand 57868 states and 69212 transitions. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:31:15,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:31:15,328 INFO L93 Difference]: Finished difference Result 156097 states and 188759 transitions. [2024-10-10 23:31:15,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:31:15,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 333 [2024-10-10 23:31:15,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:31:15,459 INFO L225 Difference]: With dead ends: 156097 [2024-10-10 23:31:15,460 INFO L226 Difference]: Without dead ends: 99017 [2024-10-10 23:31:15,519 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:31:15,520 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 1734 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 6697 mSolverCounterSat, 1117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1734 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 7814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1117 IncrementalHoareTripleChecker+Valid, 6697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:31:15,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1734 Valid, 740 Invalid, 7814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1117 Valid, 6697 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-10 23:31:15,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99017 states. [2024-10-10 23:31:16,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99017 to 98887. [2024-10-10 23:31:16,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98887 states, 98886 states have (on average 1.1899763363873552) internal successors, (117672), 98886 states have internal predecessors, (117672), 0 states have call successors, (0), 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:31:17,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98887 states to 98887 states and 117672 transitions. [2024-10-10 23:31:17,132 INFO L78 Accepts]: Start accepts. Automaton has 98887 states and 117672 transitions. Word has length 333 [2024-10-10 23:31:17,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:31:17,132 INFO L471 AbstractCegarLoop]: Abstraction has 98887 states and 117672 transitions. [2024-10-10 23:31:17,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:31:17,133 INFO L276 IsEmpty]: Start isEmpty. Operand 98887 states and 117672 transitions. [2024-10-10 23:31:17,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-10-10 23:31:17,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:31:17,140 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 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] [2024-10-10 23:31:17,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:31:17,141 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:31:17,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:31:17,141 INFO L85 PathProgramCache]: Analyzing trace with hash 2131819431, now seen corresponding path program 1 times [2024-10-10 23:31:17,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:31:17,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989718881] [2024-10-10 23:31:17,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:31:17,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:31:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:31:17,499 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-10-10 23:31:17,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:31:17,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989718881] [2024-10-10 23:31:17,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989718881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:31:17,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:31:17,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:31:17,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383739366] [2024-10-10 23:31:17,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:31:17,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:31:17,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:31:17,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:31:17,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:31:17,502 INFO L87 Difference]: Start difference. First operand 98887 states and 117672 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 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:31:21,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:31:21,707 INFO L93 Difference]: Finished difference Result 182820 states and 219244 transitions. [2024-10-10 23:31:21,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:31:21,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 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 348 [2024-10-10 23:31:21,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:31:22,007 INFO L225 Difference]: With dead ends: 182820 [2024-10-10 23:31:22,008 INFO L226 Difference]: Without dead ends: 98899 [2024-10-10 23:31:22,075 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:31:22,080 INFO L432 NwaCegarLoop]: 1019 mSDtfsCounter, 730 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 2707 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 2711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:31:22,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1200 Invalid, 2711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2707 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-10 23:31:22,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98899 states. [2024-10-10 23:31:23,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98899 to 98887. [2024-10-10 23:31:23,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98887 states, 98886 states have (on average 1.1890661974394758) internal successors, (117582), 98886 states have internal predecessors, (117582), 0 states have call successors, (0), 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:31:23,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98887 states to 98887 states and 117582 transitions. [2024-10-10 23:31:23,597 INFO L78 Accepts]: Start accepts. Automaton has 98887 states and 117582 transitions. Word has length 348 [2024-10-10 23:31:23,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:31:23,598 INFO L471 AbstractCegarLoop]: Abstraction has 98887 states and 117582 transitions. [2024-10-10 23:31:23,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 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:31:23,598 INFO L276 IsEmpty]: Start isEmpty. Operand 98887 states and 117582 transitions. [2024-10-10 23:31:23,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2024-10-10 23:31:23,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:31:23,615 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:31:23,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:31:23,615 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:31:23,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:31:23,617 INFO L85 PathProgramCache]: Analyzing trace with hash -655081361, now seen corresponding path program 1 times [2024-10-10 23:31:23,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:31:23,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410712020] [2024-10-10 23:31:23,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:31:23,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:31:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:31:25,042 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 271 proven. 110 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-10 23:31:25,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:31:25,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410712020] [2024-10-10 23:31:25,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410712020] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:31:25,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300280737] [2024-10-10 23:31:25,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:31:25,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:31:25,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:31:25,046 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:31:25,048 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:31:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:31:25,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:31:25,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:31:25,389 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-10 23:31:25,390 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:31:25,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300280737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:31:25,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:31:25,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-10-10 23:31:25,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745264528] [2024-10-10 23:31:25,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:31:25,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:31:25,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:31:25,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:31:25,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:31:25,395 INFO L87 Difference]: Start difference. First operand 98887 states and 117582 transitions. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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:31:32,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-10 23:31:33,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:31:33,166 INFO L93 Difference]: Finished difference Result 196197 states and 233218 transitions. [2024-10-10 23:31:33,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:31:33,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 377 [2024-10-10 23:31:33,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:31:33,294 INFO L225 Difference]: With dead ends: 196197 [2024-10-10 23:31:33,294 INFO L226 Difference]: Without dead ends: 98098 [2024-10-10 23:31:33,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:31:33,323 INFO L432 NwaCegarLoop]: 1364 mSDtfsCounter, 1138 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2467 mSolverCounterSat, 451 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 2919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 451 IncrementalHoareTripleChecker+Valid, 2467 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:31:33,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 1445 Invalid, 2919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [451 Valid, 2467 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2024-10-10 23:31:33,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98098 states. [2024-10-10 23:31:34,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98098 to 98097. [2024-10-10 23:31:34,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98097 states, 98096 states have (on average 1.1390474637090198) internal successors, (111736), 98096 states have internal predecessors, (111736), 0 states have call successors, (0), 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:31:34,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98097 states to 98097 states and 111736 transitions. [2024-10-10 23:31:34,629 INFO L78 Accepts]: Start accepts. Automaton has 98097 states and 111736 transitions. Word has length 377 [2024-10-10 23:31:34,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:31:34,629 INFO L471 AbstractCegarLoop]: Abstraction has 98097 states and 111736 transitions. [2024-10-10 23:31:34,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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:31:34,629 INFO L276 IsEmpty]: Start isEmpty. Operand 98097 states and 111736 transitions. [2024-10-10 23:31:34,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-10-10 23:31:34,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:31:34,636 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-10 23:31:34,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 23:31:34,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-10 23:31:34,837 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:31:34,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:31:34,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1727014361, now seen corresponding path program 1 times [2024-10-10 23:31:34,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:31:34,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489735857] [2024-10-10 23:31:34,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:31:34,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:31:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:31:35,350 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 406 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-10 23:31:35,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:31:35,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489735857] [2024-10-10 23:31:35,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489735857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:31:35,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:31:35,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:31:35,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202459129] [2024-10-10 23:31:35,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:31:35,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:31:35,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:31:35,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:31:35,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:31:35,353 INFO L87 Difference]: Start difference. First operand 98097 states and 111736 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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:31:38,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:31:38,803 INFO L93 Difference]: Finished difference Result 193804 states and 220752 transitions. [2024-10-10 23:31:38,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:31:38,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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 382 [2024-10-10 23:31:38,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:31:38,918 INFO L225 Difference]: With dead ends: 193804 [2024-10-10 23:31:38,918 INFO L226 Difference]: Without dead ends: 96495 [2024-10-10 23:31:39,143 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:31:39,144 INFO L432 NwaCegarLoop]: 1501 mSDtfsCounter, 1035 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 2942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:31:39,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 1636 Invalid, 2942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-10 23:31:39,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96495 states. [2024-10-10 23:31:40,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96495 to 91763. [2024-10-10 23:31:40,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91763 states, 91762 states have (on average 1.0986356007933566) internal successors, (100813), 91762 states have internal predecessors, (100813), 0 states have call successors, (0), 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:31:40,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91763 states to 91763 states and 100813 transitions. [2024-10-10 23:31:40,329 INFO L78 Accepts]: Start accepts. Automaton has 91763 states and 100813 transitions. Word has length 382 [2024-10-10 23:31:40,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:31:40,329 INFO L471 AbstractCegarLoop]: Abstraction has 91763 states and 100813 transitions. [2024-10-10 23:31:40,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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:31:40,330 INFO L276 IsEmpty]: Start isEmpty. Operand 91763 states and 100813 transitions. [2024-10-10 23:31:40,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2024-10-10 23:31:40,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:31:40,335 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-10 23:31:40,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:31:40,335 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:31:40,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:31:40,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1142081561, now seen corresponding path program 1 times [2024-10-10 23:31:40,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:31:40,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773595451] [2024-10-10 23:31:40,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:31:40,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:31:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:31:40,574 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-10 23:31:40,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:31:40,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773595451] [2024-10-10 23:31:40,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773595451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:31:40,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:31:40,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:31:40,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138002848] [2024-10-10 23:31:40,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:31:40,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:31:40,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:31:40,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:31:40,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:31:40,581 INFO L87 Difference]: Start difference. First operand 91763 states and 100813 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)