./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/Problem11_label54.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/Problem11_label54.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 edb6f856db72a43ad08c83ff0e1ee56d288f58300ccdf5a7b1b400a926b63cbe --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:19:56,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:19:56,837 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:19:56,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:19:56,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:19:56,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:19:56,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:19:56,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:19:56,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:19:56,876 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:19:56,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:19:56,877 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:19:56,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:19:56,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:19:56,880 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:19:56,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:19:56,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:19:56,881 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:19:56,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:19:56,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:19:56,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:19:56,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:19:56,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:19:56,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:19:56,883 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:19:56,884 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:19:56,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:19:56,884 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:19:56,885 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:19:56,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:19:56,886 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:19:56,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:19:56,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:19:56,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:19:56,887 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:19:56,887 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:19:56,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:19:56,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:19:56,888 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:19:56,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:19:56,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:19:56,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:19:56,890 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 -> edb6f856db72a43ad08c83ff0e1ee56d288f58300ccdf5a7b1b400a926b63cbe [2024-10-10 23:19:57,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:19:57,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:19:57,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:19:57,174 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:19:57,174 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:19:57,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label54.c [2024-10-10 23:19:58,662 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:19:58,949 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:19:58,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label54.c [2024-10-10 23:19:58,966 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c2773066f/ec81691e33d844a08a3cf89372fc8794/FLAGc532ac624 [2024-10-10 23:19:58,982 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c2773066f/ec81691e33d844a08a3cf89372fc8794 [2024-10-10 23:19:58,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:19:58,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:19:58,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:19:58,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:19:58,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:19:58,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:19:58" (1/1) ... [2024-10-10 23:19:58,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c6227f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:58, skipping insertion in model container [2024-10-10 23:19:58,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:19:58" (1/1) ... [2024-10-10 23:19:59,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:19:59,291 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/Problem11_label54.c[5423,5436] [2024-10-10 23:19:59,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:19:59,526 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:19:59,558 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/Problem11_label54.c[5423,5436] [2024-10-10 23:19:59,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:19:59,698 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:19:59,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:59 WrapperNode [2024-10-10 23:19:59,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:19:59,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:19:59,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:19:59,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:19:59,707 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:19:59" (1/1) ... [2024-10-10 23:19:59,742 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:19:59" (1/1) ... [2024-10-10 23:19:59,846 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-10-10 23:19:59,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:19:59,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:19:59,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:19:59,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:19:59,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:59" (1/1) ... [2024-10-10 23:19:59,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:59" (1/1) ... [2024-10-10 23:19:59,869 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:59" (1/1) ... [2024-10-10 23:19:59,929 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:19:59,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:59" (1/1) ... [2024-10-10 23:19:59,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:59" (1/1) ... [2024-10-10 23:19:59,969 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:59" (1/1) ... [2024-10-10 23:19:59,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:59" (1/1) ... [2024-10-10 23:19:59,999 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:59" (1/1) ... [2024-10-10 23:20:00,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:59" (1/1) ... [2024-10-10 23:20:00,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:20:00,029 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:20:00,029 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:20:00,030 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:20:00,031 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:59" (1/1) ... [2024-10-10 23:20:00,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:20:00,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:20:00,065 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:20:00,068 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:20:00,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:20:00,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:20:00,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:20:00,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:20:00,191 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:20:00,193 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:20:01,760 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-10 23:20:01,760 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:20:01,819 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:20:01,820 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:20:01,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:20:01 BoogieIcfgContainer [2024-10-10 23:20:01,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:20:01,824 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:20:01,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:20:01,828 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:20:01,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:19:58" (1/3) ... [2024-10-10 23:20:01,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f659737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:20:01, skipping insertion in model container [2024-10-10 23:20:01,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:59" (2/3) ... [2024-10-10 23:20:01,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f659737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:20:01, skipping insertion in model container [2024-10-10 23:20:01,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:20:01" (3/3) ... [2024-10-10 23:20:01,833 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label54.c [2024-10-10 23:20:01,849 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:20:01,850 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:20:01,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:20:01,922 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;@7be53af7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:20:01,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:20:01,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:01,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-10 23:20:01,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:01,934 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] [2024-10-10 23:20:01,935 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:01,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:01,939 INFO L85 PathProgramCache]: Analyzing trace with hash 2011310723, now seen corresponding path program 1 times [2024-10-10 23:20:01,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:01,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56168889] [2024-10-10 23:20:01,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:01,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:02,149 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:20:02,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:02,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56168889] [2024-10-10 23:20:02,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56168889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:02,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:02,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:20:02,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969765735] [2024-10-10 23:20:02,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:02,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:20:02,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:02,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:20:02,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:20:02,192 INFO L87 Difference]: Start difference. First operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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:20:02,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:02,248 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2024-10-10 23:20:02,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:20:02,251 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-10-10 23:20:02,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:02,262 INFO L225 Difference]: With dead ends: 441 [2024-10-10 23:20:02,262 INFO L226 Difference]: Without dead ends: 219 [2024-10-10 23:20:02,265 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:20:02,269 INFO L432 NwaCegarLoop]: 355 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, 355 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:20:02,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:20:02,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-10 23:20:02,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-10 23:20:02,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 0 states have call successors, (0), 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:20:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2024-10-10 23:20:02,313 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 36 [2024-10-10 23:20:02,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:02,313 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2024-10-10 23:20:02,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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:20:02,314 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2024-10-10 23:20:02,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-10 23:20:02,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:02,316 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] [2024-10-10 23:20:02,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:20:02,316 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:02,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:02,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1274849753, now seen corresponding path program 1 times [2024-10-10 23:20:02,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:02,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277266840] [2024-10-10 23:20:02,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:02,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:02,537 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:20:02,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:02,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277266840] [2024-10-10 23:20:02,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277266840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:02,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:02,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:20:02,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444125711] [2024-10-10 23:20:02,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:02,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:02,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:02,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:02,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:02,544 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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:20:03,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:03,484 INFO L93 Difference]: Finished difference Result 633 states and 1034 transitions. [2024-10-10 23:20:03,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:03,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-10-10 23:20:03,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:03,489 INFO L225 Difference]: With dead ends: 633 [2024-10-10 23:20:03,489 INFO L226 Difference]: Without dead ends: 415 [2024-10-10 23:20:03,490 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:20:03,492 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 185 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:03,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 69 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:20:03,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-10 23:20:03,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 407. [2024-10-10 23:20:03,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.6157635467980296) internal successors, (656), 406 states have internal predecessors, (656), 0 states have call successors, (0), 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:20:03,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 656 transitions. [2024-10-10 23:20:03,531 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 656 transitions. Word has length 36 [2024-10-10 23:20:03,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:03,532 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 656 transitions. [2024-10-10 23:20:03,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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:20:03,532 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 656 transitions. [2024-10-10 23:20:03,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-10 23:20:03,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:03,535 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:03,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:20:03,536 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:03,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:03,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1299651080, now seen corresponding path program 1 times [2024-10-10 23:20:03,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:03,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907404771] [2024-10-10 23:20:03,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:03,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:20:03,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:03,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907404771] [2024-10-10 23:20:03,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907404771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:03,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:03,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:20:03,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195354349] [2024-10-10 23:20:03,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:03,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:03,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:03,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:03,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:03,771 INFO L87 Difference]: Start difference. First operand 407 states and 656 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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:20:04,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:04,483 INFO L93 Difference]: Finished difference Result 1190 states and 1929 transitions. [2024-10-10 23:20:04,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:04,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-10-10 23:20:04,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:04,488 INFO L225 Difference]: With dead ends: 1190 [2024-10-10 23:20:04,489 INFO L226 Difference]: Without dead ends: 784 [2024-10-10 23:20:04,490 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:20:04,495 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 141 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:04,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 150 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:20:04,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2024-10-10 23:20:04,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 782. [2024-10-10 23:20:04,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 781 states have (on average 1.439180537772087) internal successors, (1124), 781 states have internal predecessors, (1124), 0 states have call successors, (0), 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:20:04,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1124 transitions. [2024-10-10 23:20:04,547 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1124 transitions. Word has length 101 [2024-10-10 23:20:04,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:04,547 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 1124 transitions. [2024-10-10 23:20:04,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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:20:04,548 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1124 transitions. [2024-10-10 23:20:04,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-10 23:20:04,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:04,550 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:04,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:20:04,551 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:04,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:04,551 INFO L85 PathProgramCache]: Analyzing trace with hash -679037458, now seen corresponding path program 1 times [2024-10-10 23:20:04,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:04,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580542208] [2024-10-10 23:20:04,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:04,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:04,704 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:20:04,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:04,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580542208] [2024-10-10 23:20:04,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580542208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:04,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:04,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:20:04,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323614092] [2024-10-10 23:20:04,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:04,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:04,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:04,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:04,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:04,711 INFO L87 Difference]: Start difference. First operand 782 states and 1124 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 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:20:05,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:05,394 INFO L93 Difference]: Finished difference Result 1947 states and 2800 transitions. [2024-10-10 23:20:05,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:05,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2024-10-10 23:20:05,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:05,402 INFO L225 Difference]: With dead ends: 1947 [2024-10-10 23:20:05,402 INFO L226 Difference]: Without dead ends: 1166 [2024-10-10 23:20:05,406 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:20:05,407 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 144 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:05,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 114 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:20:05,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2024-10-10 23:20:05,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1153. [2024-10-10 23:20:05,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1152 states have (on average 1.3394097222222223) internal successors, (1543), 1152 states have internal predecessors, (1543), 0 states have call successors, (0), 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:20:05,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1543 transitions. [2024-10-10 23:20:05,438 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1543 transitions. Word has length 104 [2024-10-10 23:20:05,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:05,439 INFO L471 AbstractCegarLoop]: Abstraction has 1153 states and 1543 transitions. [2024-10-10 23:20:05,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 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:20:05,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1543 transitions. [2024-10-10 23:20:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-10 23:20:05,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:05,445 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:05,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:20:05,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:05,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:05,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1722638674, now seen corresponding path program 1 times [2024-10-10 23:20:05,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:05,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108862027] [2024-10-10 23:20:05,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:05,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:05,795 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:20:05,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:05,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108862027] [2024-10-10 23:20:05,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108862027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:05,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:05,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:20:05,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613099726] [2024-10-10 23:20:05,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:05,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:05,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:05,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:05,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:05,798 INFO L87 Difference]: Start difference. First operand 1153 states and 1543 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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:20:06,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:06,489 INFO L93 Difference]: Finished difference Result 2675 states and 3528 transitions. [2024-10-10 23:20:06,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:06,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-10-10 23:20:06,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:06,496 INFO L225 Difference]: With dead ends: 2675 [2024-10-10 23:20:06,496 INFO L226 Difference]: Without dead ends: 1523 [2024-10-10 23:20:06,498 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:20:06,499 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:06,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 187 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:20:06,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2024-10-10 23:20:06,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1522. [2024-10-10 23:20:06,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1521 states have (on average 1.2689020381328073) internal successors, (1930), 1521 states have internal predecessors, (1930), 0 states have call successors, (0), 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:20:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 1930 transitions. [2024-10-10 23:20:06,530 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 1930 transitions. Word has length 105 [2024-10-10 23:20:06,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:06,531 INFO L471 AbstractCegarLoop]: Abstraction has 1522 states and 1930 transitions. [2024-10-10 23:20:06,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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:20:06,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 1930 transitions. [2024-10-10 23:20:06,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-10 23:20:06,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:06,536 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:06,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:20:06,537 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:06,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:06,537 INFO L85 PathProgramCache]: Analyzing trace with hash 887267733, now seen corresponding path program 1 times [2024-10-10 23:20:06,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:06,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834854784] [2024-10-10 23:20:06,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:06,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:06,732 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:20:06,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:06,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834854784] [2024-10-10 23:20:06,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834854784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:06,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:06,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:20:06,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752438538] [2024-10-10 23:20:06,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:06,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:06,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:06,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:06,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:06,739 INFO L87 Difference]: Start difference. First operand 1522 states and 1930 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:20:07,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:07,452 INFO L93 Difference]: Finished difference Result 3967 states and 5150 transitions. [2024-10-10 23:20:07,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:07,453 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 163 [2024-10-10 23:20:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:07,461 INFO L225 Difference]: With dead ends: 3967 [2024-10-10 23:20:07,462 INFO L226 Difference]: Without dead ends: 2630 [2024-10-10 23:20:07,464 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:20:07,465 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 115 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:07,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 152 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:20:07,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2024-10-10 23:20:07,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2446. [2024-10-10 23:20:07,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2446 states, 2445 states have (on average 1.223721881390593) internal successors, (2992), 2445 states have internal predecessors, (2992), 0 states have call successors, (0), 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:20:07,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 2992 transitions. [2024-10-10 23:20:07,508 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 2992 transitions. Word has length 163 [2024-10-10 23:20:07,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:07,509 INFO L471 AbstractCegarLoop]: Abstraction has 2446 states and 2992 transitions. [2024-10-10 23:20:07,509 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:20:07,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 2992 transitions. [2024-10-10 23:20:07,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-10 23:20:07,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:07,512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:07,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:20:07,512 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:07,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:07,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1201575989, now seen corresponding path program 1 times [2024-10-10 23:20:07,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:07,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699188367] [2024-10-10 23:20:07,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:07,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:07,766 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-10 23:20:07,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:07,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699188367] [2024-10-10 23:20:07,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699188367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:07,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:07,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:20:07,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791073530] [2024-10-10 23:20:07,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:07,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:07,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:07,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:07,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:07,769 INFO L87 Difference]: Start difference. First operand 2446 states and 2992 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:08,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:08,449 INFO L93 Difference]: Finished difference Result 5265 states and 6462 transitions. [2024-10-10 23:20:08,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:08,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2024-10-10 23:20:08,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:08,461 INFO L225 Difference]: With dead ends: 5265 [2024-10-10 23:20:08,461 INFO L226 Difference]: Without dead ends: 3004 [2024-10-10 23:20:08,464 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:20:08,466 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 75 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:08,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 151 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:20:08,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2024-10-10 23:20:08,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 2819. [2024-10-10 23:20:08,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2819 states, 2818 states have (on average 1.2221433640880057) internal successors, (3444), 2818 states have internal predecessors, (3444), 0 states have call successors, (0), 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:20:08,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 3444 transitions. [2024-10-10 23:20:08,517 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 3444 transitions. Word has length 179 [2024-10-10 23:20:08,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:08,519 INFO L471 AbstractCegarLoop]: Abstraction has 2819 states and 3444 transitions. [2024-10-10 23:20:08,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:08,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 3444 transitions. [2024-10-10 23:20:08,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-10 23:20:08,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:08,523 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:20:08,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:20:08,523 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:08,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:08,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1768364145, now seen corresponding path program 1 times [2024-10-10 23:20:08,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:08,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112928947] [2024-10-10 23:20:08,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:08,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:08,782 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:20:08,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:08,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112928947] [2024-10-10 23:20:08,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112928947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:08,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:08,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:08,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568169381] [2024-10-10 23:20:08,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:08,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:08,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:08,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:08,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:08,785 INFO L87 Difference]: Start difference. First operand 2819 states and 3444 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:09,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:09,493 INFO L93 Difference]: Finished difference Result 6566 states and 8100 transitions. [2024-10-10 23:20:09,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:09,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 216 [2024-10-10 23:20:09,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:09,505 INFO L225 Difference]: With dead ends: 6566 [2024-10-10 23:20:09,505 INFO L226 Difference]: Without dead ends: 3932 [2024-10-10 23:20:09,509 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:20:09,510 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 135 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:09,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 329 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:20:09,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3932 states. [2024-10-10 23:20:09,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3932 to 3555. [2024-10-10 23:20:09,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3555 states, 3554 states have (on average 1.2115925717501408) internal successors, (4306), 3554 states have internal predecessors, (4306), 0 states have call successors, (0), 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:20:09,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3555 states to 3555 states and 4306 transitions. [2024-10-10 23:20:09,572 INFO L78 Accepts]: Start accepts. Automaton has 3555 states and 4306 transitions. Word has length 216 [2024-10-10 23:20:09,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:09,572 INFO L471 AbstractCegarLoop]: Abstraction has 3555 states and 4306 transitions. [2024-10-10 23:20:09,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:09,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3555 states and 4306 transitions. [2024-10-10 23:20:09,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-10 23:20:09,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:09,576 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:20:09,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:20:09,576 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:09,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:09,577 INFO L85 PathProgramCache]: Analyzing trace with hash 282677039, now seen corresponding path program 1 times [2024-10-10 23:20:09,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:09,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755549792] [2024-10-10 23:20:09,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:09,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:09,881 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-10 23:20:09,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:09,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755549792] [2024-10-10 23:20:09,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755549792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:09,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:09,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:09,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662689816] [2024-10-10 23:20:09,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:09,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:09,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:09,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:09,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:09,885 INFO L87 Difference]: Start difference. First operand 3555 states and 4306 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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:20:10,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:10,580 INFO L93 Difference]: Finished difference Result 9520 states and 11626 transitions. [2024-10-10 23:20:10,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:10,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 217 [2024-10-10 23:20:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:10,600 INFO L225 Difference]: With dead ends: 9520 [2024-10-10 23:20:10,601 INFO L226 Difference]: Without dead ends: 5966 [2024-10-10 23:20:10,606 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:20:10,607 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 189 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:10,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 329 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:20:10,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2024-10-10 23:20:10,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 5230. [2024-10-10 23:20:10,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5230 states, 5229 states have (on average 1.2061579651941097) internal successors, (6307), 5229 states have internal predecessors, (6307), 0 states have call successors, (0), 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:20:10,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5230 states to 5230 states and 6307 transitions. [2024-10-10 23:20:10,691 INFO L78 Accepts]: Start accepts. Automaton has 5230 states and 6307 transitions. Word has length 217 [2024-10-10 23:20:10,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:10,692 INFO L471 AbstractCegarLoop]: Abstraction has 5230 states and 6307 transitions. [2024-10-10 23:20:10,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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:20:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 5230 states and 6307 transitions. [2024-10-10 23:20:10,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-10-10 23:20:10,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:10,696 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:10,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:20:10,697 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:10,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:10,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1663102151, now seen corresponding path program 1 times [2024-10-10 23:20:10,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:10,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540037366] [2024-10-10 23:20:10,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:10,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:10,974 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:20:10,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:10,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540037366] [2024-10-10 23:20:10,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540037366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:10,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:10,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:10,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495190243] [2024-10-10 23:20:10,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:10,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:10,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:10,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:10,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:10,980 INFO L87 Difference]: Start difference. First operand 5230 states and 6307 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:11,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:11,720 INFO L93 Difference]: Finished difference Result 10456 states and 12610 transitions. [2024-10-10 23:20:11,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:11,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 254 [2024-10-10 23:20:11,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:11,742 INFO L225 Difference]: With dead ends: 10456 [2024-10-10 23:20:11,742 INFO L226 Difference]: Without dead ends: 5227 [2024-10-10 23:20:11,748 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:20:11,750 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:11,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 301 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:20:11,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5227 states. [2024-10-10 23:20:11,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5227 to 5227. [2024-10-10 23:20:11,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5227 states, 5226 states have (on average 1.178721775736701) internal successors, (6160), 5226 states have internal predecessors, (6160), 0 states have call successors, (0), 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:20:11,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5227 states to 5227 states and 6160 transitions. [2024-10-10 23:20:11,847 INFO L78 Accepts]: Start accepts. Automaton has 5227 states and 6160 transitions. Word has length 254 [2024-10-10 23:20:11,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:11,848 INFO L471 AbstractCegarLoop]: Abstraction has 5227 states and 6160 transitions. [2024-10-10 23:20:11,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:11,848 INFO L276 IsEmpty]: Start isEmpty. Operand 5227 states and 6160 transitions. [2024-10-10 23:20:11,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-10-10 23:20:11,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:11,855 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:20:11,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:20:11,855 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:11,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:11,856 INFO L85 PathProgramCache]: Analyzing trace with hash -645915876, now seen corresponding path program 1 times [2024-10-10 23:20:11,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:11,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289811318] [2024-10-10 23:20:11,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:11,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:12,131 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-10 23:20:12,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:12,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289811318] [2024-10-10 23:20:12,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289811318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:12,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:12,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:12,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115011399] [2024-10-10 23:20:12,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:12,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:12,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:12,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:12,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:12,134 INFO L87 Difference]: Start difference. First operand 5227 states and 6160 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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:20:12,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:12,759 INFO L93 Difference]: Finished difference Result 11194 states and 13195 transitions. [2024-10-10 23:20:12,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:12,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 268 [2024-10-10 23:20:12,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:12,776 INFO L225 Difference]: With dead ends: 11194 [2024-10-10 23:20:12,776 INFO L226 Difference]: Without dead ends: 5968 [2024-10-10 23:20:12,782 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:20:12,783 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 184 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:12,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 146 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:20:12,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2024-10-10 23:20:12,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 5227. [2024-10-10 23:20:12,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5227 states, 5226 states have (on average 1.178721775736701) internal successors, (6160), 5226 states have internal predecessors, (6160), 0 states have call successors, (0), 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:20:12,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5227 states to 5227 states and 6160 transitions. [2024-10-10 23:20:12,860 INFO L78 Accepts]: Start accepts. Automaton has 5227 states and 6160 transitions. Word has length 268 [2024-10-10 23:20:12,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:12,861 INFO L471 AbstractCegarLoop]: Abstraction has 5227 states and 6160 transitions. [2024-10-10 23:20:12,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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:20:12,861 INFO L276 IsEmpty]: Start isEmpty. Operand 5227 states and 6160 transitions. [2024-10-10 23:20:12,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-10-10 23:20:12,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:12,866 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:12,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:20:12,867 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:12,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:12,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1736933126, now seen corresponding path program 1 times [2024-10-10 23:20:12,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:12,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471180257] [2024-10-10 23:20:12,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:12,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:13,173 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-10 23:20:13,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:13,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471180257] [2024-10-10 23:20:13,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471180257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:13,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:13,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:13,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933135377] [2024-10-10 23:20:13,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:13,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:13,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:13,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:13,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:13,176 INFO L87 Difference]: Start difference. First operand 5227 states and 6160 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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:20:13,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:13,994 INFO L93 Difference]: Finished difference Result 12848 states and 15239 transitions. [2024-10-10 23:20:13,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:13,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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 271 [2024-10-10 23:20:13,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:14,008 INFO L225 Difference]: With dead ends: 12848 [2024-10-10 23:20:14,009 INFO L226 Difference]: Without dead ends: 7622 [2024-10-10 23:20:14,015 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:20:14,016 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 196 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:14,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 69 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:20:14,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7622 states. [2024-10-10 23:20:14,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7622 to 7251. [2024-10-10 23:20:14,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7251 states, 7250 states have (on average 1.1842758620689655) internal successors, (8586), 7250 states have internal predecessors, (8586), 0 states have call successors, (0), 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:20:14,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7251 states to 7251 states and 8586 transitions. [2024-10-10 23:20:14,119 INFO L78 Accepts]: Start accepts. Automaton has 7251 states and 8586 transitions. Word has length 271 [2024-10-10 23:20:14,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:14,119 INFO L471 AbstractCegarLoop]: Abstraction has 7251 states and 8586 transitions. [2024-10-10 23:20:14,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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:20:14,120 INFO L276 IsEmpty]: Start isEmpty. Operand 7251 states and 8586 transitions. [2024-10-10 23:20:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-10-10 23:20:14,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:14,127 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 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:20:14,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:20:14,128 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:14,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:14,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1765998982, now seen corresponding path program 1 times [2024-10-10 23:20:14,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:14,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557279225] [2024-10-10 23:20:14,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:14,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:14,355 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-10-10 23:20:14,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:14,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557279225] [2024-10-10 23:20:14,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557279225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:14,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:14,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:14,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587199342] [2024-10-10 23:20:14,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:14,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:14,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:14,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:14,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:14,359 INFO L87 Difference]: Start difference. First operand 7251 states and 8586 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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:20:15,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:15,013 INFO L93 Difference]: Finished difference Result 15788 states and 18675 transitions. [2024-10-10 23:20:15,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:15,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 309 [2024-10-10 23:20:15,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:15,028 INFO L225 Difference]: With dead ends: 15788 [2024-10-10 23:20:15,028 INFO L226 Difference]: Without dead ends: 8538 [2024-10-10 23:20:15,037 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:20:15,038 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 184 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:15,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 144 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:20:15,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8538 states. [2024-10-10 23:20:15,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8538 to 6142. [2024-10-10 23:20:15,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6142 states, 6141 states have (on average 1.185963198176193) internal successors, (7283), 6141 states have internal predecessors, (7283), 0 states have call successors, (0), 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:20:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6142 states to 6142 states and 7283 transitions. [2024-10-10 23:20:15,123 INFO L78 Accepts]: Start accepts. Automaton has 6142 states and 7283 transitions. Word has length 309 [2024-10-10 23:20:15,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:15,124 INFO L471 AbstractCegarLoop]: Abstraction has 6142 states and 7283 transitions. [2024-10-10 23:20:15,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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:20:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 6142 states and 7283 transitions. [2024-10-10 23:20:15,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2024-10-10 23:20:15,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:15,131 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:20:15,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:20:15,132 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:15,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:15,132 INFO L85 PathProgramCache]: Analyzing trace with hash 930635365, now seen corresponding path program 1 times [2024-10-10 23:20:15,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:15,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652254742] [2024-10-10 23:20:15,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:15,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:15,764 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-10-10 23:20:15,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:15,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652254742] [2024-10-10 23:20:15,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652254742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:15,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:15,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:15,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836834814] [2024-10-10 23:20:15,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:15,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:20:15,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:15,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:20:15,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:20:15,767 INFO L87 Difference]: Start difference. First operand 6142 states and 7283 transitions. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:16,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:16,514 INFO L93 Difference]: Finished difference Result 14509 states and 17069 transitions. [2024-10-10 23:20:16,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:20:16,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 319 [2024-10-10 23:20:16,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:16,527 INFO L225 Difference]: With dead ends: 14509 [2024-10-10 23:20:16,528 INFO L226 Difference]: Without dead ends: 8354 [2024-10-10 23:20:16,567 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:20:16,568 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 71 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:16,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 159 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:20:16,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8354 states. [2024-10-10 23:20:16,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8354 to 8169. [2024-10-10 23:20:16,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8169 states, 8168 states have (on average 1.1726248775710089) internal successors, (9578), 8168 states have internal predecessors, (9578), 0 states have call successors, (0), 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:20:16,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8169 states to 8169 states and 9578 transitions. [2024-10-10 23:20:16,661 INFO L78 Accepts]: Start accepts. Automaton has 8169 states and 9578 transitions. Word has length 319 [2024-10-10 23:20:16,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:16,662 INFO L471 AbstractCegarLoop]: Abstraction has 8169 states and 9578 transitions. [2024-10-10 23:20:16,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:16,662 INFO L276 IsEmpty]: Start isEmpty. Operand 8169 states and 9578 transitions. [2024-10-10 23:20:16,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-10-10 23:20:16,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:16,676 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:20:16,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:20:16,677 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:16,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:16,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1553992999, now seen corresponding path program 1 times [2024-10-10 23:20:16,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:16,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493895225] [2024-10-10 23:20:16,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:16,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-10 23:20:17,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:17,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493895225] [2024-10-10 23:20:17,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493895225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:17,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:17,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:20:17,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445386883] [2024-10-10 23:20:17,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:17,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:20:17,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:17,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:20:17,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:20:17,183 INFO L87 Difference]: Start difference. First operand 8169 states and 9578 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:18,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:18,362 INFO L93 Difference]: Finished difference Result 21876 states and 25679 transitions. [2024-10-10 23:20:18,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:20:18,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 393 [2024-10-10 23:20:18,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:18,388 INFO L225 Difference]: With dead ends: 21876 [2024-10-10 23:20:18,388 INFO L226 Difference]: Without dead ends: 14076 [2024-10-10 23:20:18,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:20:18,402 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 293 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:18,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 83 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:20:18,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14076 states. [2024-10-10 23:20:18,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14076 to 12972. [2024-10-10 23:20:18,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12972 states, 12971 states have (on average 1.1669878960758615) internal successors, (15137), 12971 states have internal predecessors, (15137), 0 states have call successors, (0), 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:20:18,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12972 states to 12972 states and 15137 transitions. [2024-10-10 23:20:18,573 INFO L78 Accepts]: Start accepts. Automaton has 12972 states and 15137 transitions. Word has length 393 [2024-10-10 23:20:18,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:18,574 INFO L471 AbstractCegarLoop]: Abstraction has 12972 states and 15137 transitions. [2024-10-10 23:20:18,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:18,574 INFO L276 IsEmpty]: Start isEmpty. Operand 12972 states and 15137 transitions. [2024-10-10 23:20:18,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2024-10-10 23:20:18,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:18,593 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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:20:18,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:20:18,594 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:18,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:18,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1269061677, now seen corresponding path program 1 times [2024-10-10 23:20:18,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:18,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918544042] [2024-10-10 23:20:18,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:18,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:18,980 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 448 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-10 23:20:18,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:18,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918544042] [2024-10-10 23:20:18,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918544042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:18,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:18,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:18,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925767330] [2024-10-10 23:20:18,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:18,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:20:18,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:18,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:20:18,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:20:18,983 INFO L87 Difference]: Start difference. First operand 12972 states and 15137 transitions. Second operand has 4 states, 4 states have (on average 103.0) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 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:20:19,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:19,953 INFO L93 Difference]: Finished difference Result 32967 states and 38383 transitions. [2024-10-10 23:20:19,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:20:19,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 103.0) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 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 446 [2024-10-10 23:20:19,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:19,986 INFO L225 Difference]: With dead ends: 32967 [2024-10-10 23:20:19,987 INFO L226 Difference]: Without dead ends: 20364 [2024-10-10 23:20:20,004 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:20:20,005 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 216 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:20,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 82 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:20:20,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20364 states. [2024-10-10 23:20:20,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20364 to 17776. [2024-10-10 23:20:20,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17776 states, 17775 states have (on average 1.161293952180028) internal successors, (20642), 17775 states have internal predecessors, (20642), 0 states have call successors, (0), 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:20:20,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17776 states to 17776 states and 20642 transitions. [2024-10-10 23:20:20,354 INFO L78 Accepts]: Start accepts. Automaton has 17776 states and 20642 transitions. Word has length 446 [2024-10-10 23:20:20,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:20,355 INFO L471 AbstractCegarLoop]: Abstraction has 17776 states and 20642 transitions. [2024-10-10 23:20:20,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.0) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 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:20:20,355 INFO L276 IsEmpty]: Start isEmpty. Operand 17776 states and 20642 transitions. [2024-10-10 23:20:20,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2024-10-10 23:20:20,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:20,377 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:20:20,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:20:20,378 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:20,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:20,378 INFO L85 PathProgramCache]: Analyzing trace with hash -854635248, now seen corresponding path program 1 times [2024-10-10 23:20:20,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:20,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799684327] [2024-10-10 23:20:20,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:20,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:20,690 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-10-10 23:20:20,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:20,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799684327] [2024-10-10 23:20:20,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799684327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:20,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:20,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:20,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896222762] [2024-10-10 23:20:20,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:20,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:20,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:20,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:20,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:20,693 INFO L87 Difference]: Start difference. First operand 17776 states and 20642 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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:20:21,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:21,465 INFO L93 Difference]: Finished difference Result 34441 states and 40070 transitions. [2024-10-10 23:20:21,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:21,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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 513 [2024-10-10 23:20:21,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:21,491 INFO L225 Difference]: With dead ends: 34441 [2024-10-10 23:20:21,491 INFO L226 Difference]: Without dead ends: 17034 [2024-10-10 23:20:21,503 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:20:21,504 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 67 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:21,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 308 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:20:21,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17034 states. [2024-10-10 23:20:21,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17034 to 12600. [2024-10-10 23:20:21,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12600 states, 12599 states have (on average 1.1617588697515675) internal successors, (14637), 12599 states have internal predecessors, (14637), 0 states have call successors, (0), 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:20:21,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12600 states to 12600 states and 14637 transitions. [2024-10-10 23:20:21,666 INFO L78 Accepts]: Start accepts. Automaton has 12600 states and 14637 transitions. Word has length 513 [2024-10-10 23:20:21,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:21,666 INFO L471 AbstractCegarLoop]: Abstraction has 12600 states and 14637 transitions. [2024-10-10 23:20:21,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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:20:21,667 INFO L276 IsEmpty]: Start isEmpty. Operand 12600 states and 14637 transitions. [2024-10-10 23:20:21,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2024-10-10 23:20:21,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:21,681 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:21,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:20:21,681 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:21,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:21,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1214349163, now seen corresponding path program 1 times [2024-10-10 23:20:21,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:21,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535277208] [2024-10-10 23:20:21,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:21,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:22,221 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 559 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-10-10 23:20:22,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:22,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535277208] [2024-10-10 23:20:22,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535277208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:22,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:22,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:20:22,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769176235] [2024-10-10 23:20:22,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:22,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:20:22,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:22,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:20:22,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:20:22,224 INFO L87 Difference]: Start difference. First operand 12600 states and 14637 transitions. Second operand has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 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:20:23,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:23,308 INFO L93 Difference]: Finished difference Result 28898 states and 33609 transitions. [2024-10-10 23:20:23,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:20:23,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 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 534 [2024-10-10 23:20:23,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:23,325 INFO L225 Difference]: With dead ends: 28898 [2024-10-10 23:20:23,325 INFO L226 Difference]: Without dead ends: 16667 [2024-10-10 23:20:23,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:20:23,335 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 297 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:23,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 82 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:20:23,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16667 states. [2024-10-10 23:20:23,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16667 to 12048. [2024-10-10 23:20:23,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12048 states, 12047 states have (on average 1.1661824520627542) internal successors, (14049), 12047 states have internal predecessors, (14049), 0 states have call successors, (0), 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:20:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12048 states to 12048 states and 14049 transitions. [2024-10-10 23:20:23,573 INFO L78 Accepts]: Start accepts. Automaton has 12048 states and 14049 transitions. Word has length 534 [2024-10-10 23:20:23,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:23,574 INFO L471 AbstractCegarLoop]: Abstraction has 12048 states and 14049 transitions. [2024-10-10 23:20:23,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 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:20:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 12048 states and 14049 transitions. [2024-10-10 23:20:23,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2024-10-10 23:20:23,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:23,587 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:23,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:20:23,587 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:23,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:23,588 INFO L85 PathProgramCache]: Analyzing trace with hash 49488198, now seen corresponding path program 1 times [2024-10-10 23:20:23,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:23,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339014634] [2024-10-10 23:20:23,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:23,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:24,806 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 705 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-10 23:20:24,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:24,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339014634] [2024-10-10 23:20:24,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339014634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:24,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:24,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:20:24,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393228433] [2024-10-10 23:20:24,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:24,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:20:24,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:24,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:20:24,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:20:24,809 INFO L87 Difference]: Start difference. First operand 12048 states and 14049 transitions. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 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:20:25,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:25,873 INFO L93 Difference]: Finished difference Result 30745 states and 35968 transitions. [2024-10-10 23:20:25,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:20:25,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 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 560 [2024-10-10 23:20:25,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:25,893 INFO L225 Difference]: With dead ends: 30745 [2024-10-10 23:20:25,893 INFO L226 Difference]: Without dead ends: 19066 [2024-10-10 23:20:25,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:20:25,906 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 184 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:25,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 83 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:20:25,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19066 states. [2024-10-10 23:20:26,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19066 to 14452. [2024-10-10 23:20:26,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14452 states, 14451 states have (on average 1.1715452217839595) internal successors, (16930), 14451 states have internal predecessors, (16930), 0 states have call successors, (0), 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:20:26,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14452 states to 14452 states and 16930 transitions. [2024-10-10 23:20:26,136 INFO L78 Accepts]: Start accepts. Automaton has 14452 states and 16930 transitions. Word has length 560 [2024-10-10 23:20:26,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:26,137 INFO L471 AbstractCegarLoop]: Abstraction has 14452 states and 16930 transitions. [2024-10-10 23:20:26,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 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:20:26,137 INFO L276 IsEmpty]: Start isEmpty. Operand 14452 states and 16930 transitions. [2024-10-10 23:20:26,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2024-10-10 23:20:26,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:26,154 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:26,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:20:26,154 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:26,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:26,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1782776660, now seen corresponding path program 1 times [2024-10-10 23:20:26,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:26,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477736487] [2024-10-10 23:20:26,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:26,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:26,456 INFO L134 CoverageAnalysis]: Checked inductivity of 934 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-10-10 23:20:26,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:26,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477736487] [2024-10-10 23:20:26,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477736487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:26,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:26,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:20:26,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606858279] [2024-10-10 23:20:26,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:26,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:26,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:26,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:26,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:26,459 INFO L87 Difference]: Start difference. First operand 14452 states and 16930 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 2 states have internal predecessors, (305), 0 states have call successors, (0), 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:20:26,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:26,793 INFO L93 Difference]: Finished difference Result 28526 states and 33464 transitions. [2024-10-10 23:20:26,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:26,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 2 states have internal predecessors, (305), 0 states have call successors, (0), 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 601 [2024-10-10 23:20:26,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:26,809 INFO L225 Difference]: With dead ends: 28526 [2024-10-10 23:20:26,809 INFO L226 Difference]: Without dead ends: 14443 [2024-10-10 23:20:26,822 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:20:26,823 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 188 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:26,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 37 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:20:26,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14443 states. [2024-10-10 23:20:27,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14443 to 14439. [2024-10-10 23:20:27,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14439 states, 14438 states have (on average 1.1708685413492173) internal successors, (16905), 14438 states have internal predecessors, (16905), 0 states have call successors, (0), 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:20:27,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14439 states to 14439 states and 16905 transitions. [2024-10-10 23:20:27,055 INFO L78 Accepts]: Start accepts. Automaton has 14439 states and 16905 transitions. Word has length 601 [2024-10-10 23:20:27,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:27,056 INFO L471 AbstractCegarLoop]: Abstraction has 14439 states and 16905 transitions. [2024-10-10 23:20:27,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 2 states have internal predecessors, (305), 0 states have call successors, (0), 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:20:27,056 INFO L276 IsEmpty]: Start isEmpty. Operand 14439 states and 16905 transitions. [2024-10-10 23:20:27,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2024-10-10 23:20:27,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:27,066 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:27,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 23:20:27,066 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:27,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:27,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1529951816, now seen corresponding path program 1 times [2024-10-10 23:20:27,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:27,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395394348] [2024-10-10 23:20:27,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:27,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1141 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-10-10 23:20:27,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:27,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395394348] [2024-10-10 23:20:27,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395394348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:27,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:27,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:27,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915851790] [2024-10-10 23:20:27,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:27,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:27,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:27,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:27,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:27,530 INFO L87 Difference]: Start difference. First operand 14439 states and 16905 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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:20:28,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:28,252 INFO L93 Difference]: Finished difference Result 30546 states and 35891 transitions. [2024-10-10 23:20:28,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:28,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 621 [2024-10-10 23:20:28,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:28,270 INFO L225 Difference]: With dead ends: 30546 [2024-10-10 23:20:28,270 INFO L226 Difference]: Without dead ends: 16290 [2024-10-10 23:20:28,282 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:20:28,282 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 34 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:28,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 367 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:20:28,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16290 states. [2024-10-10 23:20:28,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16290 to 15171. [2024-10-10 23:20:28,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15171 states, 15170 states have (on average 1.1391562294001318) internal successors, (17281), 15170 states have internal predecessors, (17281), 0 states have call successors, (0), 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:20:28,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15171 states to 15171 states and 17281 transitions. [2024-10-10 23:20:28,481 INFO L78 Accepts]: Start accepts. Automaton has 15171 states and 17281 transitions. Word has length 621 [2024-10-10 23:20:28,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:28,481 INFO L471 AbstractCegarLoop]: Abstraction has 15171 states and 17281 transitions. [2024-10-10 23:20:28,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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:20:28,482 INFO L276 IsEmpty]: Start isEmpty. Operand 15171 states and 17281 transitions. [2024-10-10 23:20:28,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2024-10-10 23:20:28,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:28,496 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-10 23:20:28,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 23:20:28,496 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:28,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:28,497 INFO L85 PathProgramCache]: Analyzing trace with hash 795721172, now seen corresponding path program 1 times [2024-10-10 23:20:28,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:28,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367445432] [2024-10-10 23:20:28,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:28,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:29,331 INFO L134 CoverageAnalysis]: Checked inductivity of 934 backedges. 621 proven. 154 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-10-10 23:20:29,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:29,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367445432] [2024-10-10 23:20:29,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367445432] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:20:29,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437211997] [2024-10-10 23:20:29,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:29,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:20:29,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:20:29,334 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:20:29,336 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:20:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:29,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-10 23:20:29,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:20:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 934 backedges. 621 proven. 154 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-10-10 23:20:31,180 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:20:32,730 INFO L134 CoverageAnalysis]: Checked inductivity of 934 backedges. 621 proven. 154 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-10-10 23:20:32,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437211997] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:20:32,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:20:32,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-10-10 23:20:32,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675271024] [2024-10-10 23:20:32,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:20:32,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 23:20:32,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:32,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 23:20:32,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:20:32,735 INFO L87 Difference]: Start difference. First operand 15171 states and 17281 transitions. Second operand has 5 states, 5 states have (on average 93.6) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 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:20:33,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:33,850 INFO L93 Difference]: Finished difference Result 33218 states and 37862 transitions. [2024-10-10 23:20:33,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 23:20:33,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 93.6) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 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 625 [2024-10-10 23:20:33,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:33,870 INFO L225 Difference]: With dead ends: 33218 [2024-10-10 23:20:33,870 INFO L226 Difference]: Without dead ends: 18048 [2024-10-10 23:20:33,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1254 GetRequests, 1249 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:20:33,882 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 526 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:33,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 57 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:20:33,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18048 states. [2024-10-10 23:20:34,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18048 to 15156. [2024-10-10 23:20:34,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15156 states, 15155 states have (on average 1.1211481359287363) internal successors, (16991), 15155 states have internal predecessors, (16991), 0 states have call successors, (0), 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:20:34,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15156 states to 15156 states and 16991 transitions. [2024-10-10 23:20:34,027 INFO L78 Accepts]: Start accepts. Automaton has 15156 states and 16991 transitions. Word has length 625 [2024-10-10 23:20:34,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:34,027 INFO L471 AbstractCegarLoop]: Abstraction has 15156 states and 16991 transitions. [2024-10-10 23:20:34,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.6) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 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:20:34,028 INFO L276 IsEmpty]: Start isEmpty. Operand 15156 states and 16991 transitions. [2024-10-10 23:20:34,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2024-10-10 23:20:34,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:34,037 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:20:34,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:20:34,238 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,SelfDestructingSolverStorable21 [2024-10-10 23:20:34,238 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:34,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:34,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1007674061, now seen corresponding path program 1 times [2024-10-10 23:20:34,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:34,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164082166] [2024-10-10 23:20:34,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:34,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:35,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 847 proven. 240 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-10-10 23:20:35,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:35,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164082166] [2024-10-10 23:20:35,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164082166] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:20:35,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403772719] [2024-10-10 23:20:35,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:35,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:20:35,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:20:35,442 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:20:35,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:20:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:35,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:20:35,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:20:35,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 852 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-10-10 23:20:35,753 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:20:35,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403772719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:35,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:20:35,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-10-10 23:20:35,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350509982] [2024-10-10 23:20:35,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:35,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:35,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:35,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:35,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:20:35,756 INFO L87 Difference]: Start difference. First operand 15156 states and 16991 transitions. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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:20:36,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:36,342 INFO L93 Difference]: Finished difference Result 30315 states and 33983 transitions. [2024-10-10 23:20:36,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:36,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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 638 [2024-10-10 23:20:36,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:36,360 INFO L225 Difference]: With dead ends: 30315 [2024-10-10 23:20:36,360 INFO L226 Difference]: Without dead ends: 15344 [2024-10-10 23:20:36,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 637 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:20:36,372 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 112 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:36,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 343 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:20:36,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15344 states. [2024-10-10 23:20:36,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15344 to 15156. [2024-10-10 23:20:36,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15156 states, 15155 states have (on average 1.1038601121742) internal successors, (16729), 15155 states have internal predecessors, (16729), 0 states have call successors, (0), 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:20:36,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15156 states to 15156 states and 16729 transitions. [2024-10-10 23:20:36,494 INFO L78 Accepts]: Start accepts. Automaton has 15156 states and 16729 transitions. Word has length 638 [2024-10-10 23:20:36,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:36,494 INFO L471 AbstractCegarLoop]: Abstraction has 15156 states and 16729 transitions. [2024-10-10 23:20:36,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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:20:36,494 INFO L276 IsEmpty]: Start isEmpty. Operand 15156 states and 16729 transitions. [2024-10-10 23:20:36,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2024-10-10 23:20:36,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:36,506 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:20:36,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:20:36,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:20:36,707 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:36,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:36,708 INFO L85 PathProgramCache]: Analyzing trace with hash -232359710, now seen corresponding path program 1 times [2024-10-10 23:20:36,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:36,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152957188] [2024-10-10 23:20:36,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:36,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:36,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 876 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-10-10 23:20:36,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:36,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152957188] [2024-10-10 23:20:36,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152957188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:36,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:36,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:36,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414789326] [2024-10-10 23:20:36,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:36,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:36,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:36,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:36,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:36,976 INFO L87 Difference]: Start difference. First operand 15156 states and 16729 transitions. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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:20:37,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:37,553 INFO L93 Difference]: Finished difference Result 32517 states and 35865 transitions. [2024-10-10 23:20:37,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:37,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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 644 [2024-10-10 23:20:37,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:37,575 INFO L225 Difference]: With dead ends: 32517 [2024-10-10 23:20:37,575 INFO L226 Difference]: Without dead ends: 18284 [2024-10-10 23:20:37,587 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:20:37,588 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 119 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:37,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 112 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:20:37,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18284 states. [2024-10-10 23:20:37,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18284 to 16626. [2024-10-10 23:20:37,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16626 states, 16625 states have (on average 1.0974436090225563) internal successors, (18245), 16625 states have internal predecessors, (18245), 0 states have call successors, (0), 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:20:37,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16626 states to 16626 states and 18245 transitions. [2024-10-10 23:20:37,742 INFO L78 Accepts]: Start accepts. Automaton has 16626 states and 18245 transitions. Word has length 644 [2024-10-10 23:20:37,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:37,742 INFO L471 AbstractCegarLoop]: Abstraction has 16626 states and 18245 transitions. [2024-10-10 23:20:37,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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:20:37,743 INFO L276 IsEmpty]: Start isEmpty. Operand 16626 states and 18245 transitions. [2024-10-10 23:20:37,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2024-10-10 23:20:37,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:37,760 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:37,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-10 23:20:37,760 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:37,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:37,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1500766177, now seen corresponding path program 1 times [2024-10-10 23:20:37,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:37,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127360705] [2024-10-10 23:20:37,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:37,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:38,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1343 backedges. 1049 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2024-10-10 23:20:38,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:38,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127360705] [2024-10-10 23:20:38,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127360705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:38,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:38,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:38,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138234948] [2024-10-10 23:20:38,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:38,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:20:38,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:38,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:20:38,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:20:38,138 INFO L87 Difference]: Start difference. First operand 16626 states and 18245 transitions. Second operand has 4 states, 4 states have (on average 105.75) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 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:20:38,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:38,969 INFO L93 Difference]: Finished difference Result 35100 states and 38540 transitions. [2024-10-10 23:20:38,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:20:38,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 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 679 [2024-10-10 23:20:38,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:38,986 INFO L225 Difference]: With dead ends: 35100 [2024-10-10 23:20:38,986 INFO L226 Difference]: Without dead ends: 19581 [2024-10-10 23:20:38,996 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:20:38,997 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 192 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:38,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 55 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:20:39,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19581 states. [2024-10-10 23:20:39,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19581 to 16626. [2024-10-10 23:20:39,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16626 states, 16625 states have (on average 1.0974436090225563) internal successors, (18245), 16625 states have internal predecessors, (18245), 0 states have call successors, (0), 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:20:39,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16626 states to 16626 states and 18245 transitions. [2024-10-10 23:20:39,138 INFO L78 Accepts]: Start accepts. Automaton has 16626 states and 18245 transitions. Word has length 679 [2024-10-10 23:20:39,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:39,138 INFO L471 AbstractCegarLoop]: Abstraction has 16626 states and 18245 transitions. [2024-10-10 23:20:39,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 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:20:39,138 INFO L276 IsEmpty]: Start isEmpty. Operand 16626 states and 18245 transitions. [2024-10-10 23:20:39,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2024-10-10 23:20:39,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:39,150 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:20:39,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-10 23:20:39,151 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:39,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:39,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1689452021, now seen corresponding path program 1 times [2024-10-10 23:20:39,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:39,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211828989] [2024-10-10 23:20:39,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:39,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:39,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 1034 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2024-10-10 23:20:39,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:39,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211828989] [2024-10-10 23:20:39,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211828989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:39,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:39,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:39,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212519642] [2024-10-10 23:20:39,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:39,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:39,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:39,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:39,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:39,409 INFO L87 Difference]: Start difference. First operand 16626 states and 18245 transitions. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 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:20:39,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:39,928 INFO L93 Difference]: Finished difference Result 32881 states and 36089 transitions. [2024-10-10 23:20:39,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:39,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 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 693 [2024-10-10 23:20:39,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:39,943 INFO L225 Difference]: With dead ends: 32881 [2024-10-10 23:20:39,943 INFO L226 Difference]: Without dead ends: 17178 [2024-10-10 23:20:39,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:39,953 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 102 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:39,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 132 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:20:39,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17178 states. [2024-10-10 23:20:40,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17178 to 15700. [2024-10-10 23:20:40,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15700 states, 15699 states have (on average 1.0945920122300783) internal successors, (17184), 15699 states have internal predecessors, (17184), 0 states have call successors, (0), 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:20:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15700 states to 15700 states and 17184 transitions. [2024-10-10 23:20:40,082 INFO L78 Accepts]: Start accepts. Automaton has 15700 states and 17184 transitions. Word has length 693 [2024-10-10 23:20:40,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:40,083 INFO L471 AbstractCegarLoop]: Abstraction has 15700 states and 17184 transitions. [2024-10-10 23:20:40,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 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:20:40,083 INFO L276 IsEmpty]: Start isEmpty. Operand 15700 states and 17184 transitions. [2024-10-10 23:20:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2024-10-10 23:20:40,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:40,095 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:40,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-10 23:20:40,095 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:40,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:40,095 INFO L85 PathProgramCache]: Analyzing trace with hash -401103085, now seen corresponding path program 1 times [2024-10-10 23:20:40,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:40,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888889350] [2024-10-10 23:20:40,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:40,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:41,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 954 proven. 0 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2024-10-10 23:20:41,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:41,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888889350] [2024-10-10 23:20:41,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888889350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:41,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:41,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:41,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975099327] [2024-10-10 23:20:41,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:41,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:20:41,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:41,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:20:41,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:20:41,004 INFO L87 Difference]: Start difference. First operand 15700 states and 17184 transitions. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 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:20:42,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:42,119 INFO L93 Difference]: Finished difference Result 34721 states and 38038 transitions. [2024-10-10 23:20:42,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:20:42,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 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 724 [2024-10-10 23:20:42,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:42,137 INFO L225 Difference]: With dead ends: 34721 [2024-10-10 23:20:42,137 INFO L226 Difference]: Without dead ends: 19390 [2024-10-10 23:20:42,148 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:20:42,148 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 117 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:42,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 100 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:20:42,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19390 states. [2024-10-10 23:20:42,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19390 to 17731. [2024-10-10 23:20:42,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17731 states, 17730 states have (on average 1.0903553299492386) internal successors, (19332), 17730 states have internal predecessors, (19332), 0 states have call successors, (0), 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:20:42,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17731 states to 17731 states and 19332 transitions. [2024-10-10 23:20:42,376 INFO L78 Accepts]: Start accepts. Automaton has 17731 states and 19332 transitions. Word has length 724 [2024-10-10 23:20:42,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:42,377 INFO L471 AbstractCegarLoop]: Abstraction has 17731 states and 19332 transitions. [2024-10-10 23:20:42,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 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:20:42,377 INFO L276 IsEmpty]: Start isEmpty. Operand 17731 states and 19332 transitions. [2024-10-10 23:20:42,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 756 [2024-10-10 23:20:42,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:42,395 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:42,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-10 23:20:42,396 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:42,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:42,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1088702531, now seen corresponding path program 1 times [2024-10-10 23:20:42,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:42,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623474535] [2024-10-10 23:20:42,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:42,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:42,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1495 backedges. 903 proven. 0 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2024-10-10 23:20:42,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:42,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623474535] [2024-10-10 23:20:42,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623474535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:42,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:42,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:42,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198621552] [2024-10-10 23:20:42,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:42,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:42,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:42,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:42,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:42,782 INFO L87 Difference]: Start difference. First operand 17731 states and 19332 transitions. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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:20:43,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:43,345 INFO L93 Difference]: Finished difference Result 35645 states and 38894 transitions. [2024-10-10 23:20:43,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:43,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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 755 [2024-10-10 23:20:43,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:43,362 INFO L225 Difference]: With dead ends: 35645 [2024-10-10 23:20:43,362 INFO L226 Difference]: Without dead ends: 18653 [2024-10-10 23:20:43,372 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:20:43,372 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 195 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:43,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 335 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:20:43,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18653 states. [2024-10-10 23:20:43,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18653 to 14595. [2024-10-10 23:20:43,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14595 states, 14594 states have (on average 1.0861312868302042) internal successors, (15851), 14594 states have internal predecessors, (15851), 0 states have call successors, (0), 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:20:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14595 states to 14595 states and 15851 transitions. [2024-10-10 23:20:43,505 INFO L78 Accepts]: Start accepts. Automaton has 14595 states and 15851 transitions. Word has length 755 [2024-10-10 23:20:43,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:43,505 INFO L471 AbstractCegarLoop]: Abstraction has 14595 states and 15851 transitions. [2024-10-10 23:20:43,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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:20:43,506 INFO L276 IsEmpty]: Start isEmpty. Operand 14595 states and 15851 transitions. [2024-10-10 23:20:43,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 763 [2024-10-10 23:20:43,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:43,516 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:43,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-10 23:20:43,516 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:43,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:43,516 INFO L85 PathProgramCache]: Analyzing trace with hash -60840719, now seen corresponding path program 1 times [2024-10-10 23:20:43,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:43,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199759115] [2024-10-10 23:20:43,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:43,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 648 proven. 554 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-10 23:20:44,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:44,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199759115] [2024-10-10 23:20:44,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199759115] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:20:44,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233251686] [2024-10-10 23:20:44,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:44,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:20:44,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:20:44,547 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:20:44,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:20:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:44,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 946 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:20:44,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:20:45,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 1027 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-10-10 23:20:45,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:20:45,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233251686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:45,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:20:45,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:20:45,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351502330] [2024-10-10 23:20:45,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:45,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:45,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:45,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:45,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:20:45,030 INFO L87 Difference]: Start difference. First operand 14595 states and 15851 transitions. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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:20:45,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:45,668 INFO L93 Difference]: Finished difference Result 29198 states and 31739 transitions. [2024-10-10 23:20:45,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:45,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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 762 [2024-10-10 23:20:45,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:45,682 INFO L225 Difference]: With dead ends: 29198 [2024-10-10 23:20:45,682 INFO L226 Difference]: Without dead ends: 15158 [2024-10-10 23:20:45,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 765 GetRequests, 761 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:20:45,691 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 103 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:45,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 324 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:20:45,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15158 states. [2024-10-10 23:20:45,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15158 to 14781. [2024-10-10 23:20:45,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14781 states, 14780 states have (on average 1.0850473612990528) internal successors, (16037), 14780 states have internal predecessors, (16037), 0 states have call successors, (0), 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:20:45,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14781 states to 14781 states and 16037 transitions. [2024-10-10 23:20:45,821 INFO L78 Accepts]: Start accepts. Automaton has 14781 states and 16037 transitions. Word has length 762 [2024-10-10 23:20:45,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:45,821 INFO L471 AbstractCegarLoop]: Abstraction has 14781 states and 16037 transitions. [2024-10-10 23:20:45,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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:20:45,821 INFO L276 IsEmpty]: Start isEmpty. Operand 14781 states and 16037 transitions. [2024-10-10 23:20:45,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 817 [2024-10-10 23:20:45,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:45,832 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2024-10-10 23:20:45,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-10 23:20:46,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:20:46,033 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:46,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:46,034 INFO L85 PathProgramCache]: Analyzing trace with hash 334186996, now seen corresponding path program 1 times [2024-10-10 23:20:46,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:46,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28037970] [2024-10-10 23:20:46,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:46,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:46,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 1317 proven. 0 refuted. 0 times theorem prover too weak. 865 trivial. 0 not checked. [2024-10-10 23:20:46,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:46,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28037970] [2024-10-10 23:20:46,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28037970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:46,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:46,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:20:46,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109830849] [2024-10-10 23:20:46,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:46,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:20:46,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:46,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:20:46,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:20:46,807 INFO L87 Difference]: Start difference. First operand 14781 states and 16037 transitions. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 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:20:47,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:47,682 INFO L93 Difference]: Finished difference Result 29373 states and 31787 transitions. [2024-10-10 23:20:47,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:20:47,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 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 816 [2024-10-10 23:20:47,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:47,696 INFO L225 Difference]: With dead ends: 29373 [2024-10-10 23:20:47,696 INFO L226 Difference]: Without dead ends: 15147 [2024-10-10 23:20:47,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:20:47,705 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 187 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:47,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 49 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:20:47,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15147 states. [2024-10-10 23:20:47,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15147 to 12563. [2024-10-10 23:20:47,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12563 states, 12562 states have (on average 1.078968317146951) internal successors, (13554), 12562 states have internal predecessors, (13554), 0 states have call successors, (0), 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:20:47,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12563 states to 12563 states and 13554 transitions. [2024-10-10 23:20:47,820 INFO L78 Accepts]: Start accepts. Automaton has 12563 states and 13554 transitions. Word has length 816 [2024-10-10 23:20:47,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:47,821 INFO L471 AbstractCegarLoop]: Abstraction has 12563 states and 13554 transitions. [2024-10-10 23:20:47,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 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:20:47,821 INFO L276 IsEmpty]: Start isEmpty. Operand 12563 states and 13554 transitions. [2024-10-10 23:20:47,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 829 [2024-10-10 23:20:47,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:47,830 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:47,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-10 23:20:47,831 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:47,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:47,831 INFO L85 PathProgramCache]: Analyzing trace with hash -399207045, now seen corresponding path program 1 times [2024-10-10 23:20:47,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:47,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271284752] [2024-10-10 23:20:47,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:47,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:48,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1896 backedges. 1341 proven. 0 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2024-10-10 23:20:48,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:48,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271284752] [2024-10-10 23:20:48,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271284752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:48,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:48,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:48,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258597458] [2024-10-10 23:20:48,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:48,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:48,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:48,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:48,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:48,458 INFO L87 Difference]: Start difference. First operand 12563 states and 13554 transitions. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 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:20:48,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:48,983 INFO L93 Difference]: Finished difference Result 22361 states and 24133 transitions. [2024-10-10 23:20:48,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:48,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 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 828 [2024-10-10 23:20:48,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:48,985 INFO L225 Difference]: With dead ends: 22361 [2024-10-10 23:20:48,985 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:20:48,993 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:20:48,993 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 99 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:48,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 318 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:20:48,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:20:48,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:20:48,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:48,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:20:48,995 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 828 [2024-10-10 23:20:48,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:48,995 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:20:48,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 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:20:48,995 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:20:48,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:20:48,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:20:48,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-10 23:20:49,001 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:49,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.