./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 b178b656343d0e2ffc6b5c87d592ef5d1e640f986fa3fd9fab639777f6d58eb8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:15:44,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:15:44,964 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:15:44,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:15:44,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:15:44,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:15:45,000 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:15:45,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:15:45,001 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:15:45,002 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:15:45,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:15:45,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:15:45,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:15:45,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:15:45,006 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:15:45,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:15:45,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:15:45,006 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:15:45,007 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:15:45,007 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:15:45,007 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:15:45,011 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:15:45,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:15:45,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:15:45,012 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:15:45,012 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:15:45,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:15:45,012 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:15:45,013 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:15:45,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:15:45,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:15:45,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:15:45,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:15:45,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:15:45,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:15:45,014 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:15:45,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:15:45,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:15:45,015 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:15:45,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:15:45,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:15:45,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:15:45,018 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/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/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 -> b178b656343d0e2ffc6b5c87d592ef5d1e640f986fa3fd9fab639777f6d58eb8 [2024-10-12 20:15:45,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:15:45,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:15:45,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:15:45,290 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:15:45,291 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:15:45,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-12 20:15:46,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:15:46,886 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:15:46,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-12 20:15:46,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0bc62942/788c184122664749beb618d229b111fd/FLAG40980959f [2024-10-12 20:15:46,915 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0bc62942/788c184122664749beb618d229b111fd [2024-10-12 20:15:46,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:15:46,918 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:15:46,919 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:15:46,919 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:15:46,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:15:46,924 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:15:46" (1/1) ... [2024-10-12 20:15:46,925 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2836d38c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:46, skipping insertion in model container [2024-10-12 20:15:46,925 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:15:46" (1/1) ... [2024-10-12 20:15:46,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:15:47,160 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/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7349,7362] [2024-10-12 20:15:47,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:15:47,225 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:15:47,261 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/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7349,7362] [2024-10-12 20:15:47,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:15:47,294 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:15:47,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:47 WrapperNode [2024-10-12 20:15:47,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:15:47,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:15:47,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:15:47,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:15:47,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:47" (1/1) ... [2024-10-12 20:15:47,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:47" (1/1) ... [2024-10-12 20:15:47,366 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 634 [2024-10-12 20:15:47,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:15:47,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:15:47,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:15:47,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:15:47,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:47" (1/1) ... [2024-10-12 20:15:47,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:47" (1/1) ... [2024-10-12 20:15:47,383 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:47" (1/1) ... [2024-10-12 20:15:47,406 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-12 20:15:47,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:47" (1/1) ... [2024-10-12 20:15:47,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:47" (1/1) ... [2024-10-12 20:15:47,413 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:47" (1/1) ... [2024-10-12 20:15:47,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:47" (1/1) ... [2024-10-12 20:15:47,421 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:47" (1/1) ... [2024-10-12 20:15:47,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:47" (1/1) ... [2024-10-12 20:15:47,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:15:47,466 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:15:47,466 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:15:47,466 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:15:47,467 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:47" (1/1) ... [2024-10-12 20:15:47,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:15:47,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:15:47,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:15:47,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:15:47,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:15:47,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:15:47,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:15:47,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:15:47,703 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:15:47,705 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:15:48,342 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-10-12 20:15:48,342 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:15:48,424 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:15:48,424 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:15:48,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:15:48 BoogieIcfgContainer [2024-10-12 20:15:48,425 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:15:48,430 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:15:48,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:15:48,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:15:48,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:15:46" (1/3) ... [2024-10-12 20:15:48,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6433d86f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:15:48, skipping insertion in model container [2024-10-12 20:15:48,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:47" (2/3) ... [2024-10-12 20:15:48,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6433d86f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:15:48, skipping insertion in model container [2024-10-12 20:15:48,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:15:48" (3/3) ... [2024-10-12 20:15:48,437 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-12 20:15:48,454 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:15:48,454 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:15:48,515 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:15:48,521 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;@2c6fd99b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:15:48,522 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:15:48,526 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 136 states have (on average 1.7720588235294117) internal successors, (241), 137 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:48,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 20:15:48,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:48,535 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:48,535 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:48,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:48,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1083985671, now seen corresponding path program 1 times [2024-10-12 20:15:48,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:48,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410130004] [2024-10-12 20:15:48,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:48,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:48,920 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-12 20:15:48,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:48,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410130004] [2024-10-12 20:15:48,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410130004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:48,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:48,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:48,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120835671] [2024-10-12 20:15:48,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:48,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:15:48,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:48,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:15:48,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:48,950 INFO L87 Difference]: Start difference. First operand has 138 states, 136 states have (on average 1.7720588235294117) internal successors, (241), 137 states have internal predecessors, (241), 0 states have call successors, (0), 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 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:49,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:49,103 INFO L93 Difference]: Finished difference Result 289 states and 492 transitions. [2024-10-12 20:15:49,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:15:49,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-12 20:15:49,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:49,113 INFO L225 Difference]: With dead ends: 289 [2024-10-12 20:15:49,114 INFO L226 Difference]: Without dead ends: 200 [2024-10-12 20:15:49,116 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-12 20:15:49,119 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 137 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:49,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 394 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:15:49,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-12 20:15:49,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2024-10-12 20:15:49,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.5816326530612246) internal successors, (310), 196 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:49,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 310 transitions. [2024-10-12 20:15:49,171 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 310 transitions. Word has length 55 [2024-10-12 20:15:49,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:49,172 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 310 transitions. [2024-10-12 20:15:49,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:49,172 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 310 transitions. [2024-10-12 20:15:49,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 20:15:49,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:49,174 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:49,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:15:49,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:49,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:49,176 INFO L85 PathProgramCache]: Analyzing trace with hash 279150516, now seen corresponding path program 1 times [2024-10-12 20:15:49,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:49,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162211755] [2024-10-12 20:15:49,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:49,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:49,323 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-12 20:15:49,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:49,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162211755] [2024-10-12 20:15:49,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162211755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:49,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:49,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:49,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141119389] [2024-10-12 20:15:49,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:49,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:15:49,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:49,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:15:49,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:49,327 INFO L87 Difference]: Start difference. First operand 197 states and 310 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:49,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:49,356 INFO L93 Difference]: Finished difference Result 471 states and 762 transitions. [2024-10-12 20:15:49,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:15:49,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-10-12 20:15:49,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:49,361 INFO L225 Difference]: With dead ends: 471 [2024-10-12 20:15:49,362 INFO L226 Difference]: Without dead ends: 327 [2024-10-12 20:15:49,363 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-12 20:15:49,364 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 118 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:49,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 389 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:49,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-12 20:15:49,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 323. [2024-10-12 20:15:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 1.6024844720496894) internal successors, (516), 322 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:49,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 516 transitions. [2024-10-12 20:15:49,385 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 516 transitions. Word has length 57 [2024-10-12 20:15:49,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:49,385 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 516 transitions. [2024-10-12 20:15:49,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:49,386 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 516 transitions. [2024-10-12 20:15:49,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 20:15:49,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:49,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:49,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:15:49,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:49,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:49,389 INFO L85 PathProgramCache]: Analyzing trace with hash 378017127, now seen corresponding path program 1 times [2024-10-12 20:15:49,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:49,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673455271] [2024-10-12 20:15:49,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:49,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:49,520 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-12 20:15:49,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:49,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673455271] [2024-10-12 20:15:49,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673455271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:49,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:49,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:49,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351756519] [2024-10-12 20:15:49,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:49,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:15:49,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:49,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:15:49,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:49,522 INFO L87 Difference]: Start difference. First operand 323 states and 516 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:49,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:49,563 INFO L93 Difference]: Finished difference Result 835 states and 1354 transitions. [2024-10-12 20:15:49,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:15:49,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-10-12 20:15:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:49,567 INFO L225 Difference]: With dead ends: 835 [2024-10-12 20:15:49,568 INFO L226 Difference]: Without dead ends: 565 [2024-10-12 20:15:49,570 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-12 20:15:49,572 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 113 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:49,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 390 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:49,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-10-12 20:15:49,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 559. [2024-10-12 20:15:49,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.6057347670250897) internal successors, (896), 558 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:49,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 896 transitions. [2024-10-12 20:15:49,623 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 896 transitions. Word has length 59 [2024-10-12 20:15:49,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:49,624 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 896 transitions. [2024-10-12 20:15:49,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 896 transitions. [2024-10-12 20:15:49,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:15:49,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:49,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:49,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:15:49,636 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:49,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:49,636 INFO L85 PathProgramCache]: Analyzing trace with hash 343933908, now seen corresponding path program 1 times [2024-10-12 20:15:49,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:49,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415730325] [2024-10-12 20:15:49,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:49,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:49,865 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-12 20:15:49,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:49,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415730325] [2024-10-12 20:15:49,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415730325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:49,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:49,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:15:49,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137916198] [2024-10-12 20:15:49,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:49,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:15:49,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:49,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:15:49,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:15:49,872 INFO L87 Difference]: Start difference. First operand 559 states and 896 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:50,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:50,033 INFO L93 Difference]: Finished difference Result 2855 states and 4666 transitions. [2024-10-12 20:15:50,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:15:50,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-10-12 20:15:50,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:50,042 INFO L225 Difference]: With dead ends: 2855 [2024-10-12 20:15:50,042 INFO L226 Difference]: Without dead ends: 2349 [2024-10-12 20:15:50,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:15:50,048 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 855 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:50,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 1310 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:15:50,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2024-10-12 20:15:50,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1047. [2024-10-12 20:15:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 1046 states have (on average 1.6137667304015297) internal successors, (1688), 1046 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:50,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1688 transitions. [2024-10-12 20:15:50,084 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1688 transitions. Word has length 61 [2024-10-12 20:15:50,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:50,086 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1688 transitions. [2024-10-12 20:15:50,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:50,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1688 transitions. [2024-10-12 20:15:50,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 20:15:50,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:50,091 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:50,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:15:50,092 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:50,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:50,093 INFO L85 PathProgramCache]: Analyzing trace with hash 2009512368, now seen corresponding path program 1 times [2024-10-12 20:15:50,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:50,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932622258] [2024-10-12 20:15:50,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:50,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:50,222 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-12 20:15:50,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:50,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932622258] [2024-10-12 20:15:50,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932622258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:50,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:50,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:15:50,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463679476] [2024-10-12 20:15:50,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:50,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:15:50,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:50,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:15:50,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:50,226 INFO L87 Difference]: Start difference. First operand 1047 states and 1688 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:50,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:50,301 INFO L93 Difference]: Finished difference Result 3817 states and 6201 transitions. [2024-10-12 20:15:50,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:15:50,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-12 20:15:50,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:50,311 INFO L225 Difference]: With dead ends: 3817 [2024-10-12 20:15:50,312 INFO L226 Difference]: Without dead ends: 2823 [2024-10-12 20:15:50,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:15:50,316 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 404 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:50,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 707 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:50,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2024-10-12 20:15:50,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 1926. [2024-10-12 20:15:50,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1925 states have (on average 1.614025974025974) internal successors, (3107), 1925 states have internal predecessors, (3107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 3107 transitions. [2024-10-12 20:15:50,358 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 3107 transitions. Word has length 62 [2024-10-12 20:15:50,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:50,358 INFO L471 AbstractCegarLoop]: Abstraction has 1926 states and 3107 transitions. [2024-10-12 20:15:50,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:50,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 3107 transitions. [2024-10-12 20:15:50,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-12 20:15:50,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:50,361 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:50,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:15:50,361 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:50,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:50,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2107395099, now seen corresponding path program 1 times [2024-10-12 20:15:50,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:50,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123272635] [2024-10-12 20:15:50,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:50,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:50,516 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-12 20:15:50,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:50,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123272635] [2024-10-12 20:15:50,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123272635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:50,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:50,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:15:50,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449765438] [2024-10-12 20:15:50,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:50,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:15:50,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:50,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:15:50,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:50,520 INFO L87 Difference]: Start difference. First operand 1926 states and 3107 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:50,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:50,590 INFO L93 Difference]: Finished difference Result 5665 states and 9207 transitions. [2024-10-12 20:15:50,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:15:50,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-10-12 20:15:50,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:50,604 INFO L225 Difference]: With dead ends: 5665 [2024-10-12 20:15:50,605 INFO L226 Difference]: Without dead ends: 3792 [2024-10-12 20:15:50,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:15:50,611 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 402 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:50,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 713 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:50,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3792 states. [2024-10-12 20:15:50,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3792 to 2843. [2024-10-12 20:15:50,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2843 states, 2842 states have (on average 1.6122448979591837) internal successors, (4582), 2842 states have internal predecessors, (4582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:50,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2843 states to 2843 states and 4582 transitions. [2024-10-12 20:15:50,672 INFO L78 Accepts]: Start accepts. Automaton has 2843 states and 4582 transitions. Word has length 63 [2024-10-12 20:15:50,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:50,673 INFO L471 AbstractCegarLoop]: Abstraction has 2843 states and 4582 transitions. [2024-10-12 20:15:50,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:50,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2843 states and 4582 transitions. [2024-10-12 20:15:50,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 20:15:50,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:50,677 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:50,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:15:50,678 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:50,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:50,678 INFO L85 PathProgramCache]: Analyzing trace with hash 2100793239, now seen corresponding path program 1 times [2024-10-12 20:15:50,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:50,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532446815] [2024-10-12 20:15:50,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:50,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:50,747 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-12 20:15:50,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:50,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532446815] [2024-10-12 20:15:50,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532446815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:50,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:50,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:50,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276955536] [2024-10-12 20:15:50,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:50,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:15:50,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:50,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:15:50,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:50,750 INFO L87 Difference]: Start difference. First operand 2843 states and 4582 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:50,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:50,793 INFO L93 Difference]: Finished difference Result 6201 states and 10045 transitions. [2024-10-12 20:15:50,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:15:50,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-12 20:15:50,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:50,806 INFO L225 Difference]: With dead ends: 6201 [2024-10-12 20:15:50,806 INFO L226 Difference]: Without dead ends: 4226 [2024-10-12 20:15:50,810 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-12 20:15:50,812 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 117 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:50,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 461 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:50,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4226 states. [2024-10-12 20:15:50,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4226 to 4224. [2024-10-12 20:15:50,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4224 states, 4223 states have (on average 1.6073881127160785) internal successors, (6788), 4223 states have internal predecessors, (6788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:50,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4224 states to 4224 states and 6788 transitions. [2024-10-12 20:15:50,888 INFO L78 Accepts]: Start accepts. Automaton has 4224 states and 6788 transitions. Word has length 64 [2024-10-12 20:15:50,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:50,889 INFO L471 AbstractCegarLoop]: Abstraction has 4224 states and 6788 transitions. [2024-10-12 20:15:50,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:50,890 INFO L276 IsEmpty]: Start isEmpty. Operand 4224 states and 6788 transitions. [2024-10-12 20:15:50,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 20:15:50,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:50,890 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:50,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:15:50,891 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:50,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:50,891 INFO L85 PathProgramCache]: Analyzing trace with hash -229150136, now seen corresponding path program 1 times [2024-10-12 20:15:50,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:50,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262258643] [2024-10-12 20:15:50,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:50,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:50,987 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-12 20:15:50,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:50,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262258643] [2024-10-12 20:15:50,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262258643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:50,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:50,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:50,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990854336] [2024-10-12 20:15:50,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:50,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:15:50,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:50,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:15:50,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:50,990 INFO L87 Difference]: Start difference. First operand 4224 states and 6788 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:51,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:51,030 INFO L93 Difference]: Finished difference Result 8208 states and 13266 transitions. [2024-10-12 20:15:51,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:15:51,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-12 20:15:51,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:51,047 INFO L225 Difference]: With dead ends: 8208 [2024-10-12 20:15:51,048 INFO L226 Difference]: Without dead ends: 5820 [2024-10-12 20:15:51,053 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-12 20:15:51,054 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 112 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:51,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 444 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:51,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5820 states. [2024-10-12 20:15:51,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5820 to 5818. [2024-10-12 20:15:51,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5818 states, 5817 states have (on average 1.60220044696579) internal successors, (9320), 5817 states have internal predecessors, (9320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:51,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5818 states to 5818 states and 9320 transitions. [2024-10-12 20:15:51,167 INFO L78 Accepts]: Start accepts. Automaton has 5818 states and 9320 transitions. Word has length 64 [2024-10-12 20:15:51,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:51,168 INFO L471 AbstractCegarLoop]: Abstraction has 5818 states and 9320 transitions. [2024-10-12 20:15:51,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:51,168 INFO L276 IsEmpty]: Start isEmpty. Operand 5818 states and 9320 transitions. [2024-10-12 20:15:51,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 20:15:51,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:51,169 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:51,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:15:51,170 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:51,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:51,170 INFO L85 PathProgramCache]: Analyzing trace with hash 851350487, now seen corresponding path program 1 times [2024-10-12 20:15:51,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:51,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641081628] [2024-10-12 20:15:51,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:51,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:51,238 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-12 20:15:51,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:51,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641081628] [2024-10-12 20:15:51,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641081628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:51,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:51,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:15:51,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645751087] [2024-10-12 20:15:51,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:51,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:15:51,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:51,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:15:51,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:51,240 INFO L87 Difference]: Start difference. First operand 5818 states and 9320 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:51,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:51,334 INFO L93 Difference]: Finished difference Result 18203 states and 29298 transitions. [2024-10-12 20:15:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:15:51,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-12 20:15:51,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:51,377 INFO L225 Difference]: With dead ends: 18203 [2024-10-12 20:15:51,377 INFO L226 Difference]: Without dead ends: 12518 [2024-10-12 20:15:51,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:15:51,400 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 400 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:51,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 581 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:51,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12518 states. [2024-10-12 20:15:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12518 to 9132. [2024-10-12 20:15:51,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9132 states, 9131 states have (on average 1.5958821596758297) internal successors, (14572), 9131 states have internal predecessors, (14572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9132 states to 9132 states and 14572 transitions. [2024-10-12 20:15:51,786 INFO L78 Accepts]: Start accepts. Automaton has 9132 states and 14572 transitions. Word has length 64 [2024-10-12 20:15:51,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:51,787 INFO L471 AbstractCegarLoop]: Abstraction has 9132 states and 14572 transitions. [2024-10-12 20:15:51,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 9132 states and 14572 transitions. [2024-10-12 20:15:51,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 20:15:51,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:51,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:51,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:15:51,788 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:51,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:51,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1956399438, now seen corresponding path program 1 times [2024-10-12 20:15:51,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:51,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323570249] [2024-10-12 20:15:51,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:51,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:51,873 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-12 20:15:51,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:51,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323570249] [2024-10-12 20:15:51,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323570249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:51,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:51,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:51,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267997682] [2024-10-12 20:15:51,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:51,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:15:51,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:51,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:15:51,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:51,879 INFO L87 Difference]: Start difference. First operand 9132 states and 14572 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:51,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:51,947 INFO L93 Difference]: Finished difference Result 21733 states and 34902 transitions. [2024-10-12 20:15:51,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:15:51,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-12 20:15:51,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:51,969 INFO L225 Difference]: With dead ends: 21733 [2024-10-12 20:15:51,969 INFO L226 Difference]: Without dead ends: 12681 [2024-10-12 20:15:51,980 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-12 20:15:51,980 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 122 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:51,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 487 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:51,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12681 states. [2024-10-12 20:15:52,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12681 to 12679. [2024-10-12 20:15:52,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12679 states, 12678 states have (on average 1.604985013409055) internal successors, (20348), 12678 states have internal predecessors, (20348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:52,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12679 states to 12679 states and 20348 transitions. [2024-10-12 20:15:52,189 INFO L78 Accepts]: Start accepts. Automaton has 12679 states and 20348 transitions. Word has length 64 [2024-10-12 20:15:52,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:52,189 INFO L471 AbstractCegarLoop]: Abstraction has 12679 states and 20348 transitions. [2024-10-12 20:15:52,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:52,189 INFO L276 IsEmpty]: Start isEmpty. Operand 12679 states and 20348 transitions. [2024-10-12 20:15:52,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 20:15:52,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:52,190 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:52,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:15:52,190 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:52,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:52,191 INFO L85 PathProgramCache]: Analyzing trace with hash 586720488, now seen corresponding path program 1 times [2024-10-12 20:15:52,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:52,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426654492] [2024-10-12 20:15:52,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:52,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:52,390 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-12 20:15:52,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:52,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426654492] [2024-10-12 20:15:52,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426654492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:52,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:52,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:15:52,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303040469] [2024-10-12 20:15:52,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:52,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:15:52,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:52,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:15:52,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:15:52,392 INFO L87 Difference]: Start difference. First operand 12679 states and 20348 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:52,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:52,562 INFO L93 Difference]: Finished difference Result 25280 states and 40587 transitions. [2024-10-12 20:15:52,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:15:52,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-10-12 20:15:52,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:52,582 INFO L225 Difference]: With dead ends: 25280 [2024-10-12 20:15:52,582 INFO L226 Difference]: Without dead ends: 12681 [2024-10-12 20:15:52,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:15:52,594 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 227 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:52,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 577 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:52,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12681 states. [2024-10-12 20:15:52,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12681 to 12679. [2024-10-12 20:15:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12679 states, 12678 states have (on average 1.593153494241994) internal successors, (20198), 12678 states have internal predecessors, (20198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12679 states to 12679 states and 20198 transitions. [2024-10-12 20:15:52,827 INFO L78 Accepts]: Start accepts. Automaton has 12679 states and 20198 transitions. Word has length 66 [2024-10-12 20:15:52,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:52,828 INFO L471 AbstractCegarLoop]: Abstraction has 12679 states and 20198 transitions. [2024-10-12 20:15:52,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:52,828 INFO L276 IsEmpty]: Start isEmpty. Operand 12679 states and 20198 transitions. [2024-10-12 20:15:52,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 20:15:52,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:52,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:52,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:15:52,829 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:52,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:52,830 INFO L85 PathProgramCache]: Analyzing trace with hash 719582349, now seen corresponding path program 1 times [2024-10-12 20:15:52,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:52,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006303871] [2024-10-12 20:15:52,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:52,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:52,994 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-12 20:15:52,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:52,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006303871] [2024-10-12 20:15:52,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006303871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:52,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:52,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:15:52,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996117990] [2024-10-12 20:15:52,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:52,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:15:52,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:52,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:15:52,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:15:52,996 INFO L87 Difference]: Start difference. First operand 12679 states and 20198 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:53,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:53,146 INFO L93 Difference]: Finished difference Result 36567 states and 58407 transitions. [2024-10-12 20:15:53,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:15:53,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-10-12 20:15:53,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:53,189 INFO L225 Difference]: With dead ends: 36567 [2024-10-12 20:15:53,190 INFO L226 Difference]: Without dead ends: 23968 [2024-10-12 20:15:53,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:15:53,340 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 334 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:53,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 581 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:53,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23968 states. [2024-10-12 20:15:53,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23968 to 23966. [2024-10-12 20:15:53,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23966 states, 23965 states have (on average 1.5816398915084497) internal successors, (37904), 23965 states have internal predecessors, (37904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23966 states to 23966 states and 37904 transitions. [2024-10-12 20:15:53,739 INFO L78 Accepts]: Start accepts. Automaton has 23966 states and 37904 transitions. Word has length 69 [2024-10-12 20:15:53,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:53,740 INFO L471 AbstractCegarLoop]: Abstraction has 23966 states and 37904 transitions. [2024-10-12 20:15:53,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:53,740 INFO L276 IsEmpty]: Start isEmpty. Operand 23966 states and 37904 transitions. [2024-10-12 20:15:53,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-12 20:15:53,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:53,741 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:53,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:15:53,741 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:53,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:53,742 INFO L85 PathProgramCache]: Analyzing trace with hash 830307045, now seen corresponding path program 1 times [2024-10-12 20:15:53,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:53,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89179447] [2024-10-12 20:15:53,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:53,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:54,069 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-12 20:15:54,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:54,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89179447] [2024-10-12 20:15:54,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89179447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:54,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:54,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:15:54,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869886082] [2024-10-12 20:15:54,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:54,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:15:54,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:54,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:15:54,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:15:54,071 INFO L87 Difference]: Start difference. First operand 23966 states and 37904 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:54,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:54,152 INFO L93 Difference]: Finished difference Result 24742 states and 39066 transitions. [2024-10-12 20:15:54,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:15:54,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-10-12 20:15:54,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:54,203 INFO L225 Difference]: With dead ends: 24742 [2024-10-12 20:15:54,203 INFO L226 Difference]: Without dead ends: 24740 [2024-10-12 20:15:54,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:15:54,214 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 0 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:54,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 815 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:54,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24740 states. [2024-10-12 20:15:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24740 to 24740. [2024-10-12 20:15:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24740 states, 24739 states have (on average 1.5630785399571527) internal successors, (38669), 24739 states have internal predecessors, (38669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:54,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24740 states to 24740 states and 38669 transitions. [2024-10-12 20:15:54,565 INFO L78 Accepts]: Start accepts. Automaton has 24740 states and 38669 transitions. Word has length 70 [2024-10-12 20:15:54,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:54,565 INFO L471 AbstractCegarLoop]: Abstraction has 24740 states and 38669 transitions. [2024-10-12 20:15:54,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:54,566 INFO L276 IsEmpty]: Start isEmpty. Operand 24740 states and 38669 transitions. [2024-10-12 20:15:54,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 20:15:54,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:54,568 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:15:54,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:15:54,568 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:54,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:54,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1291649415, now seen corresponding path program 1 times [2024-10-12 20:15:54,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:54,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130958620] [2024-10-12 20:15:54,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:54,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 20:15:54,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:54,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130958620] [2024-10-12 20:15:54,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130958620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:54,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:54,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:15:54,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581884707] [2024-10-12 20:15:54,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:54,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:15:54,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:54,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:15:54,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:15:54,726 INFO L87 Difference]: Start difference. First operand 24740 states and 38669 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:55,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:55,085 INFO L93 Difference]: Finished difference Result 61557 states and 96523 transitions. [2024-10-12 20:15:55,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:15:55,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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 92 [2024-10-12 20:15:55,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:55,173 INFO L225 Difference]: With dead ends: 61557 [2024-10-12 20:15:55,173 INFO L226 Difference]: Without dead ends: 50223 [2024-10-12 20:15:55,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:15:55,201 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 512 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:55,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 932 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:55,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50223 states. [2024-10-12 20:15:55,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50223 to 38775. [2024-10-12 20:15:55,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38775 states, 38774 states have (on average 1.5599886521896116) internal successors, (60487), 38774 states have internal predecessors, (60487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38775 states to 38775 states and 60487 transitions. [2024-10-12 20:15:55,806 INFO L78 Accepts]: Start accepts. Automaton has 38775 states and 60487 transitions. Word has length 92 [2024-10-12 20:15:55,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:55,806 INFO L471 AbstractCegarLoop]: Abstraction has 38775 states and 60487 transitions. [2024-10-12 20:15:55,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:55,806 INFO L276 IsEmpty]: Start isEmpty. Operand 38775 states and 60487 transitions. [2024-10-12 20:15:55,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 20:15:55,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:55,808 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:15:55,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:15:55,808 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:55,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:55,809 INFO L85 PathProgramCache]: Analyzing trace with hash 673374506, now seen corresponding path program 1 times [2024-10-12 20:15:55,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:55,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270278671] [2024-10-12 20:15:55,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:55,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:55,928 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 20:15:55,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:55,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270278671] [2024-10-12 20:15:55,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270278671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:55,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:55,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:15:55,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433084240] [2024-10-12 20:15:55,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:55,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:15:55,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:55,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:15:55,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:15:55,930 INFO L87 Difference]: Start difference. First operand 38775 states and 60487 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:56,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:56,391 INFO L93 Difference]: Finished difference Result 66061 states and 103635 transitions. [2024-10-12 20:15:56,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:15:56,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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 92 [2024-10-12 20:15:56,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:56,538 INFO L225 Difference]: With dead ends: 66061 [2024-10-12 20:15:56,538 INFO L226 Difference]: Without dead ends: 54727 [2024-10-12 20:15:56,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:15:56,573 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 513 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:56,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1001 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:15:56,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54727 states. [2024-10-12 20:15:57,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54727 to 52461. [2024-10-12 20:15:57,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52461 states, 52460 states have (on average 1.5615516584064049) internal successors, (81919), 52460 states have internal predecessors, (81919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52461 states to 52461 states and 81919 transitions. [2024-10-12 20:15:57,363 INFO L78 Accepts]: Start accepts. Automaton has 52461 states and 81919 transitions. Word has length 92 [2024-10-12 20:15:57,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:57,364 INFO L471 AbstractCegarLoop]: Abstraction has 52461 states and 81919 transitions. [2024-10-12 20:15:57,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:57,364 INFO L276 IsEmpty]: Start isEmpty. Operand 52461 states and 81919 transitions. [2024-10-12 20:15:57,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 20:15:57,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:57,366 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:15:57,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:15:57,366 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:57,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:57,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1436043216, now seen corresponding path program 1 times [2024-10-12 20:15:57,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:57,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708933541] [2024-10-12 20:15:57,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:57,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:57,648 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 20:15:57,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:57,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708933541] [2024-10-12 20:15:57,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708933541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:57,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:57,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:15:57,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443997078] [2024-10-12 20:15:57,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:57,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:15:57,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:57,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:15:57,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:15:57,651 INFO L87 Difference]: Start difference. First operand 52461 states and 81919 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:57,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:57,869 INFO L93 Difference]: Finished difference Result 78146 states and 122549 transitions. [2024-10-12 20:15:57,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:15:57,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-10-12 20:15:57,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:58,134 INFO L225 Difference]: With dead ends: 78146 [2024-10-12 20:15:58,134 INFO L226 Difference]: Without dead ends: 63839 [2024-10-12 20:15:58,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:15:58,160 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 520 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:58,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 956 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:58,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63839 states. [2024-10-12 20:15:59,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63839 to 61573. [2024-10-12 20:15:59,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61573 states, 61572 states have (on average 1.5631943091015397) internal successors, (96249), 61572 states have internal predecessors, (96249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:59,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61573 states to 61573 states and 96249 transitions. [2024-10-12 20:15:59,203 INFO L78 Accepts]: Start accepts. Automaton has 61573 states and 96249 transitions. Word has length 92 [2024-10-12 20:15:59,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:59,203 INFO L471 AbstractCegarLoop]: Abstraction has 61573 states and 96249 transitions. [2024-10-12 20:15:59,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:59,203 INFO L276 IsEmpty]: Start isEmpty. Operand 61573 states and 96249 transitions. [2024-10-12 20:15:59,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-12 20:15:59,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:59,205 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:15:59,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:15:59,205 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:59,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:59,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1630170924, now seen corresponding path program 1 times [2024-10-12 20:15:59,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:59,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140353586] [2024-10-12 20:15:59,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:59,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:59,280 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 20:15:59,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:59,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140353586] [2024-10-12 20:15:59,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140353586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:59,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:59,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:15:59,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063823350] [2024-10-12 20:15:59,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:59,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:15:59,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:59,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:15:59,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:59,282 INFO L87 Difference]: Start difference. First operand 61573 states and 96249 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:59,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:59,556 INFO L93 Difference]: Finished difference Result 105949 states and 166134 transitions. [2024-10-12 20:15:59,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:15:59,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-10-12 20:15:59,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:59,677 INFO L225 Difference]: With dead ends: 105949 [2024-10-12 20:15:59,678 INFO L226 Difference]: Without dead ends: 82530 [2024-10-12 20:15:59,721 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-12 20:15:59,722 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 230 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:59,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 663 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:59,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82530 states. [2024-10-12 20:16:00,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82530 to 80266. [2024-10-12 20:16:00,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80266 states, 80265 states have (on average 1.560642870491497) internal successors, (125265), 80265 states have internal predecessors, (125265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:01,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80266 states to 80266 states and 125265 transitions. [2024-10-12 20:16:01,005 INFO L78 Accepts]: Start accepts. Automaton has 80266 states and 125265 transitions. Word has length 93 [2024-10-12 20:16:01,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:01,005 INFO L471 AbstractCegarLoop]: Abstraction has 80266 states and 125265 transitions. [2024-10-12 20:16:01,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:01,006 INFO L276 IsEmpty]: Start isEmpty. Operand 80266 states and 125265 transitions. [2024-10-12 20:16:01,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-12 20:16:01,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:01,012 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:16:01,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:16:01,012 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:01,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:01,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1430700236, now seen corresponding path program 1 times [2024-10-12 20:16:01,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:01,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872390786] [2024-10-12 20:16:01,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:01,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 20:16:01,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:01,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872390786] [2024-10-12 20:16:01,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872390786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:01,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:01,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:01,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954017998] [2024-10-12 20:16:01,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:01,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:16:01,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:01,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:16:01,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:01,115 INFO L87 Difference]: Start difference. First operand 80266 states and 125265 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:01,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:01,568 INFO L93 Difference]: Finished difference Result 183871 states and 287241 transitions. [2024-10-12 20:16:01,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:16:01,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-10-12 20:16:01,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:02,391 INFO L225 Difference]: With dead ends: 183871 [2024-10-12 20:16:02,392 INFO L226 Difference]: Without dead ends: 141815 [2024-10-12 20:16:02,501 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-12 20:16:02,502 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 103 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:02,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 384 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:02,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141815 states. [2024-10-12 20:16:04,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141815 to 141537. [2024-10-12 20:16:04,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141537 states, 141536 states have (on average 1.5580912276735248) internal successors, (220526), 141536 states have internal predecessors, (220526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:04,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141537 states to 141537 states and 220526 transitions. [2024-10-12 20:16:04,903 INFO L78 Accepts]: Start accepts. Automaton has 141537 states and 220526 transitions. Word has length 93 [2024-10-12 20:16:04,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:04,903 INFO L471 AbstractCegarLoop]: Abstraction has 141537 states and 220526 transitions. [2024-10-12 20:16:04,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:04,904 INFO L276 IsEmpty]: Start isEmpty. Operand 141537 states and 220526 transitions. [2024-10-12 20:16:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:16:04,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:04,912 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:04,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:16:04,912 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:04,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:04,913 INFO L85 PathProgramCache]: Analyzing trace with hash -2025115264, now seen corresponding path program 1 times [2024-10-12 20:16:04,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:04,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582494993] [2024-10-12 20:16:04,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:04,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:05,120 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 20:16:05,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:05,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582494993] [2024-10-12 20:16:05,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582494993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:05,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:05,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:16:05,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578156319] [2024-10-12 20:16:05,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:05,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:16:05,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:05,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:16:05,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:16:05,123 INFO L87 Difference]: Start difference. First operand 141537 states and 220526 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:05,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:05,768 INFO L93 Difference]: Finished difference Result 214585 states and 335903 transitions. [2024-10-12 20:16:05,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:16:05,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 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 94 [2024-10-12 20:16:05,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:06,096 INFO L225 Difference]: With dead ends: 214585 [2024-10-12 20:16:06,096 INFO L226 Difference]: Without dead ends: 174861 [2024-10-12 20:16:06,203 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-12 20:16:06,203 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 238 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:06,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 657 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:06,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174861 states. [2024-10-12 20:16:09,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174861 to 165833. [2024-10-12 20:16:09,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165833 states, 165832 states have (on average 1.5576004631193014) internal successors, (258300), 165832 states have internal predecessors, (258300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:09,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165833 states to 165833 states and 258300 transitions. [2024-10-12 20:16:09,722 INFO L78 Accepts]: Start accepts. Automaton has 165833 states and 258300 transitions. Word has length 94 [2024-10-12 20:16:09,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:09,723 INFO L471 AbstractCegarLoop]: Abstraction has 165833 states and 258300 transitions. [2024-10-12 20:16:09,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:09,723 INFO L276 IsEmpty]: Start isEmpty. Operand 165833 states and 258300 transitions. [2024-10-12 20:16:09,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:16:09,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:09,726 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:09,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:16:09,726 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:09,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:09,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1718673077, now seen corresponding path program 1 times [2024-10-12 20:16:09,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:09,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031087537] [2024-10-12 20:16:09,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:09,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:09,795 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 20:16:09,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:09,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031087537] [2024-10-12 20:16:09,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031087537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:09,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:09,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:09,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492933345] [2024-10-12 20:16:09,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:09,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:16:09,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:09,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:16:09,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:09,797 INFO L87 Difference]: Start difference. First operand 165833 states and 258300 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:11,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:11,255 INFO L93 Difference]: Finished difference Result 349215 states and 545550 transitions. [2024-10-12 20:16:11,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:16:11,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 94 [2024-10-12 20:16:11,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:11,740 INFO L225 Difference]: With dead ends: 349215 [2024-10-12 20:16:11,740 INFO L226 Difference]: Without dead ends: 271379 [2024-10-12 20:16:11,879 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-12 20:16:11,880 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 103 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:11,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 383 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:16:12,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271379 states. [2024-10-12 20:16:15,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271379 to 270645. [2024-10-12 20:16:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270645 states, 270644 states have (on average 1.5566278949468675) internal successors, (421292), 270644 states have internal predecessors, (421292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:17,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270645 states to 270645 states and 421292 transitions. [2024-10-12 20:16:17,008 INFO L78 Accepts]: Start accepts. Automaton has 270645 states and 421292 transitions. Word has length 94 [2024-10-12 20:16:17,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:17,011 INFO L471 AbstractCegarLoop]: Abstraction has 270645 states and 421292 transitions. [2024-10-12 20:16:17,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:17,011 INFO L276 IsEmpty]: Start isEmpty. Operand 270645 states and 421292 transitions. [2024-10-12 20:16:17,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:16:17,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:17,013 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:16:17,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:16:17,017 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:17,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:17,018 INFO L85 PathProgramCache]: Analyzing trace with hash -754923130, now seen corresponding path program 1 times [2024-10-12 20:16:17,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:17,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526818410] [2024-10-12 20:16:17,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:17,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:17,134 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:17,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:17,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526818410] [2024-10-12 20:16:17,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526818410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:17,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:17,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:17,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331994153] [2024-10-12 20:16:17,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:17,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:16:17,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:17,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:16:17,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:17,139 INFO L87 Difference]: Start difference. First operand 270645 states and 421292 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:20,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:20,393 INFO L93 Difference]: Finished difference Result 797626 states and 1241465 transitions. [2024-10-12 20:16:20,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:16:20,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-10-12 20:16:20,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:21,538 INFO L225 Difference]: With dead ends: 797626 [2024-10-12 20:16:21,539 INFO L226 Difference]: Without dead ends: 527050 [2024-10-12 20:16:21,768 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-12 20:16:21,768 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 142 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:21,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 470 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:22,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527050 states. [2024-10-12 20:16:28,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527050 to 527048. [2024-10-12 20:16:28,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527048 states, 527047 states have (on average 1.5468886076573816) internal successors, (815283), 527047 states have internal predecessors, (815283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:31,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527048 states to 527048 states and 815283 transitions. [2024-10-12 20:16:31,960 INFO L78 Accepts]: Start accepts. Automaton has 527048 states and 815283 transitions. Word has length 94 [2024-10-12 20:16:31,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:31,960 INFO L471 AbstractCegarLoop]: Abstraction has 527048 states and 815283 transitions. [2024-10-12 20:16:31,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:31,960 INFO L276 IsEmpty]: Start isEmpty. Operand 527048 states and 815283 transitions. [2024-10-12 20:16:31,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:16:31,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:31,963 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:16:31,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 20:16:31,963 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:31,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:31,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1296747900, now seen corresponding path program 1 times [2024-10-12 20:16:31,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:31,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766123811] [2024-10-12 20:16:31,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:31,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:32,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:32,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766123811] [2024-10-12 20:16:32,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766123811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:32,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:32,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:32,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547775608] [2024-10-12 20:16:32,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:32,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:16:32,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:32,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:16:32,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:32,012 INFO L87 Difference]: Start difference. First operand 527048 states and 815283 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)