./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_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-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_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-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 9260884558ccc913fea23720ea19c1107cd16edf25af23049028c38b098feff1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:35:29,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:35:29,357 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:35:29,363 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:35:29,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:35:29,395 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:35:29,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:35:29,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:35:29,399 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:35:29,400 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:35:29,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:35:29,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:35:29,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:35:29,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:35:29,404 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:35:29,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:35:29,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:35:29,405 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:35:29,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:35:29,405 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:35:29,406 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:35:29,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:35:29,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:35:29,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:35:29,409 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:35:29,409 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:35:29,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:35:29,410 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:35:29,410 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:35:29,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:35:29,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:35:29,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:35:29,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:35:29,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:35:29,415 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:35:29,415 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:35:29,415 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:35:29,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:35:29,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:35:29,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:35:29,416 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:35:29,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:35:29,417 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 -> 9260884558ccc913fea23720ea19c1107cd16edf25af23049028c38b098feff1 [2024-10-12 20:35:29,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:35:29,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:35:29,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:35:29,712 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:35:29,713 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:35:29,714 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-12 20:35:31,164 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:35:31,419 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:35:31,420 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-12 20:35:31,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/668b6949a/78c60d5a11b44014a587e0bab12f6eba/FLAGf09d1c4d5 [2024-10-12 20:35:31,459 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/668b6949a/78c60d5a11b44014a587e0bab12f6eba [2024-10-12 20:35:31,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:35:31,464 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:35:31,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:35:31,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:35:31,473 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:35:31,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:35:31" (1/1) ... [2024-10-12 20:35:31,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fef92c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:31, skipping insertion in model container [2024-10-12 20:35:31,476 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:35:31" (1/1) ... [2024-10-12 20:35:31,534 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:35:31,894 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_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[15864,15877] [2024-10-12 20:35:31,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:35:31,988 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:35:32,097 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_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[15864,15877] [2024-10-12 20:35:32,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:35:32,158 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:35:32,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:32 WrapperNode [2024-10-12 20:35:32,159 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:35:32,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:35:32,160 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:35:32,160 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:35:32,166 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:35:32" (1/1) ... [2024-10-12 20:35:32,182 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:35:32" (1/1) ... [2024-10-12 20:35:32,239 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1376 [2024-10-12 20:35:32,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:35:32,241 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:35:32,241 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:35:32,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:35:32,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:32" (1/1) ... [2024-10-12 20:35:32,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:32" (1/1) ... [2024-10-12 20:35:32,266 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:32" (1/1) ... [2024-10-12 20:35:32,307 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:35:32,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:32" (1/1) ... [2024-10-12 20:35:32,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:32" (1/1) ... [2024-10-12 20:35:32,334 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:32" (1/1) ... [2024-10-12 20:35:32,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:32" (1/1) ... [2024-10-12 20:35:32,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:32" (1/1) ... [2024-10-12 20:35:32,367 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:32" (1/1) ... [2024-10-12 20:35:32,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:35:32,383 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:35:32,383 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:35:32,383 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:35:32,384 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:32" (1/1) ... [2024-10-12 20:35:32,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:35:32,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:35:32,416 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:35:32,418 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:35:32,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:35:32,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:35:32,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:35:32,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:35:32,587 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:35:32,589 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:35:33,755 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-10-12 20:35:33,755 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:35:33,818 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:35:33,821 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:35:33,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:35:33 BoogieIcfgContainer [2024-10-12 20:35:33,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:35:33,824 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:35:33,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:35:33,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:35:33,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:35:31" (1/3) ... [2024-10-12 20:35:33,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cfb7880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:35:33, skipping insertion in model container [2024-10-12 20:35:33,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:32" (2/3) ... [2024-10-12 20:35:33,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cfb7880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:35:33, skipping insertion in model container [2024-10-12 20:35:33,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:35:33" (3/3) ... [2024-10-12 20:35:33,833 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-12 20:35:33,850 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:35:33,851 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:35:33,937 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:35:33,943 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;@323f6ad6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:35:33,943 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:35:33,950 INFO L276 IsEmpty]: Start isEmpty. Operand has 342 states, 340 states have (on average 1.7735294117647058) internal successors, (603), 341 states have internal predecessors, (603), 0 states have call successors, (0), 0 states 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:35:33,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-12 20:35:33,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:33,965 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:33,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:33,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:33,970 INFO L85 PathProgramCache]: Analyzing trace with hash -2070507114, now seen corresponding path program 1 times [2024-10-12 20:35:33,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:33,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702251855] [2024-10-12 20:35:33,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:33,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:34,568 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:35:34,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:34,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702251855] [2024-10-12 20:35:34,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702251855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:34,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:34,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:34,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009345955] [2024-10-12 20:35:34,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:34,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:35:34,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:34,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:35:34,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:34,632 INFO L87 Difference]: Start difference. First operand has 342 states, 340 states have (on average 1.7735294117647058) internal successors, (603), 341 states have internal predecessors, (603), 0 states have call successors, (0), 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 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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:35:34,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:34,800 INFO L93 Difference]: Finished difference Result 698 states and 1216 transitions. [2024-10-12 20:35:34,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:35:34,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2024-10-12 20:35:34,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:34,819 INFO L225 Difference]: With dead ends: 698 [2024-10-12 20:35:34,823 INFO L226 Difference]: Without dead ends: 564 [2024-10-12 20:35:34,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:34,835 INFO L432 NwaCegarLoop]: 568 mSDtfsCounter, 417 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:34,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 999 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:35:34,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2024-10-12 20:35:34,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 562. [2024-10-12 20:35:34,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 1.499108734402852) internal successors, (841), 561 states have internal predecessors, (841), 0 states have call successors, (0), 0 states 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:35:34,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 841 transitions. [2024-10-12 20:35:34,920 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 841 transitions. Word has length 154 [2024-10-12 20:35:34,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:34,921 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 841 transitions. [2024-10-12 20:35:34,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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:35:34,922 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 841 transitions. [2024-10-12 20:35:34,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-12 20:35:34,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:34,927 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:34,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:35:34,928 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:34,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:34,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1178225863, now seen corresponding path program 1 times [2024-10-12 20:35:34,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:34,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023266966] [2024-10-12 20:35:34,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:34,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:35,724 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:35:35,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:35,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023266966] [2024-10-12 20:35:35,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023266966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:35,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:35,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:35,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168846739] [2024-10-12 20:35:35,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:35,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:35:35,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:35,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:35:35,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:35,732 INFO L87 Difference]: Start difference. First operand 562 states and 841 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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:35:35,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:35,851 INFO L93 Difference]: Finished difference Result 2149 states and 3195 transitions. [2024-10-12 20:35:35,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:35:35,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2024-10-12 20:35:35,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:35,860 INFO L225 Difference]: With dead ends: 2149 [2024-10-12 20:35:35,861 INFO L226 Difference]: Without dead ends: 1611 [2024-10-12 20:35:35,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:35,867 INFO L432 NwaCegarLoop]: 787 mSDtfsCounter, 1044 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:35,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 1682 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:35:35,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2024-10-12 20:35:35,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1086. [2024-10-12 20:35:35,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 1085 states have (on average 1.4820276497695852) internal successors, (1608), 1085 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states 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:35:35,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1608 transitions. [2024-10-12 20:35:35,933 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1608 transitions. Word has length 154 [2024-10-12 20:35:35,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:35,933 INFO L471 AbstractCegarLoop]: Abstraction has 1086 states and 1608 transitions. [2024-10-12 20:35:35,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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:35:35,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1608 transitions. [2024-10-12 20:35:35,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-12 20:35:35,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:35,940 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:35,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:35:35,941 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:35,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:35,942 INFO L85 PathProgramCache]: Analyzing trace with hash 836221869, now seen corresponding path program 1 times [2024-10-12 20:35:35,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:35,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271121332] [2024-10-12 20:35:35,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:35,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:36,065 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:35:36,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:36,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271121332] [2024-10-12 20:35:36,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271121332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:36,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:36,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:36,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816229224] [2024-10-12 20:35:36,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:36,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:35:36,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:36,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:35:36,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:36,084 INFO L87 Difference]: Start difference. First operand 1086 states and 1608 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states 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:35:36,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:36,115 INFO L93 Difference]: Finished difference Result 2147 states and 3173 transitions. [2024-10-12 20:35:36,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:35:36,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2024-10-12 20:35:36,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:36,120 INFO L225 Difference]: With dead ends: 2147 [2024-10-12 20:35:36,121 INFO L226 Difference]: Without dead ends: 1088 [2024-10-12 20:35:36,123 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:35:36,126 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 0 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:36,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 999 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:36,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2024-10-12 20:35:36,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1088. [2024-10-12 20:35:36,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 1.4811407543698252) internal successors, (1610), 1087 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states 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:35:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1610 transitions. [2024-10-12 20:35:36,158 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1610 transitions. Word has length 155 [2024-10-12 20:35:36,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:36,159 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1610 transitions. [2024-10-12 20:35:36,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states 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:35:36,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1610 transitions. [2024-10-12 20:35:36,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-12 20:35:36,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:36,166 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:36,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:35:36,166 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:36,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:36,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1170517208, now seen corresponding path program 1 times [2024-10-12 20:35:36,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:36,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261022579] [2024-10-12 20:35:36,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:36,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:36,774 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:35:36,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:36,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261022579] [2024-10-12 20:35:36,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261022579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:36,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:36,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:35:36,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410560116] [2024-10-12 20:35:36,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:36,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:35:36,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:36,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:35:36,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:36,779 INFO L87 Difference]: Start difference. First operand 1088 states and 1610 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states 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:35:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:36,818 INFO L93 Difference]: Finished difference Result 2163 states and 3199 transitions. [2024-10-12 20:35:36,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:35:36,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2024-10-12 20:35:36,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:36,824 INFO L225 Difference]: With dead ends: 2163 [2024-10-12 20:35:36,824 INFO L226 Difference]: Without dead ends: 1088 [2024-10-12 20:35:36,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:36,828 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 20 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:36,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1570 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:36,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2024-10-12 20:35:36,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1087. [2024-10-12 20:35:36,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 1086 states have (on average 1.4788213627992635) internal successors, (1606), 1086 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states 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:35:36,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1606 transitions. [2024-10-12 20:35:36,855 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1606 transitions. Word has length 156 [2024-10-12 20:35:36,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:36,855 INFO L471 AbstractCegarLoop]: Abstraction has 1087 states and 1606 transitions. [2024-10-12 20:35:36,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states 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:35:36,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1606 transitions. [2024-10-12 20:35:36,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-12 20:35:36,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:36,859 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:36,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:35:36,860 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:36,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:36,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1440108541, now seen corresponding path program 1 times [2024-10-12 20:35:36,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:36,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079815586] [2024-10-12 20:35:36,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:36,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:37,319 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:35:37,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:37,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079815586] [2024-10-12 20:35:37,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079815586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:37,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:37,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:35:37,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229534818] [2024-10-12 20:35:37,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:37,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:35:37,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:37,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:35:37,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:35:37,322 INFO L87 Difference]: Start difference. First operand 1087 states and 1606 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states 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:35:37,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:37,417 INFO L93 Difference]: Finished difference Result 2679 states and 3946 transitions. [2024-10-12 20:35:37,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:35:37,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2024-10-12 20:35:37,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:37,426 INFO L225 Difference]: With dead ends: 2679 [2024-10-12 20:35:37,426 INFO L226 Difference]: Without dead ends: 1610 [2024-10-12 20:35:37,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:35:37,429 INFO L432 NwaCegarLoop]: 727 mSDtfsCounter, 442 mSDsluCounter, 1629 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 2356 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:37,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 2356 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:35:37,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2024-10-12 20:35:37,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1608. [2024-10-12 20:35:37,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1607 states have (on average 1.4579962663347854) internal successors, (2343), 1607 states have internal predecessors, (2343), 0 states have call successors, (0), 0 states 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:35:37,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2343 transitions. [2024-10-12 20:35:37,471 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2343 transitions. Word has length 156 [2024-10-12 20:35:37,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:37,471 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2343 transitions. [2024-10-12 20:35:37,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states 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:35:37,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2343 transitions. [2024-10-12 20:35:37,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-12 20:35:37,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:37,477 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:37,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:35:37,477 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:37,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:37,478 INFO L85 PathProgramCache]: Analyzing trace with hash -23193072, now seen corresponding path program 1 times [2024-10-12 20:35:37,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:37,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138801212] [2024-10-12 20:35:37,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:37,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:37,589 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:35:37,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:37,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138801212] [2024-10-12 20:35:37,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138801212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:37,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:37,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:37,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512848441] [2024-10-12 20:35:37,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:37,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:35:37,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:37,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:35:37,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:37,592 INFO L87 Difference]: Start difference. First operand 1608 states and 2343 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states 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:35:37,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:37,652 INFO L93 Difference]: Finished difference Result 3821 states and 5692 transitions. [2024-10-12 20:35:37,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:35:37,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2024-10-12 20:35:37,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:37,664 INFO L225 Difference]: With dead ends: 3821 [2024-10-12 20:35:37,665 INFO L226 Difference]: Without dead ends: 2394 [2024-10-12 20:35:37,667 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:35:37,671 INFO L432 NwaCegarLoop]: 703 mSDtfsCounter, 315 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:37,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1073 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:37,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2024-10-12 20:35:37,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2056. [2024-10-12 20:35:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2056 states, 2055 states have (on average 1.4963503649635037) internal successors, (3075), 2055 states have internal predecessors, (3075), 0 states have call successors, (0), 0 states 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:35:37,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 3075 transitions. [2024-10-12 20:35:37,724 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 3075 transitions. Word has length 160 [2024-10-12 20:35:37,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:37,724 INFO L471 AbstractCegarLoop]: Abstraction has 2056 states and 3075 transitions. [2024-10-12 20:35:37,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states 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:35:37,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 3075 transitions. [2024-10-12 20:35:37,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-12 20:35:37,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:37,728 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:37,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:35:37,728 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:37,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:37,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1121901340, now seen corresponding path program 1 times [2024-10-12 20:35:37,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:37,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544793284] [2024-10-12 20:35:37,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:37,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:37,889 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:35:37,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:37,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544793284] [2024-10-12 20:35:37,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544793284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:37,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:37,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:37,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145731711] [2024-10-12 20:35:37,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:37,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:35:37,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:37,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:35:37,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:37,893 INFO L87 Difference]: Start difference. First operand 2056 states and 3075 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:37,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:37,965 INFO L93 Difference]: Finished difference Result 5028 states and 7565 transitions. [2024-10-12 20:35:37,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:35:37,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2024-10-12 20:35:37,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:37,977 INFO L225 Difference]: With dead ends: 5028 [2024-10-12 20:35:37,978 INFO L226 Difference]: Without dead ends: 3270 [2024-10-12 20:35:37,981 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:35:37,983 INFO L432 NwaCegarLoop]: 918 mSDtfsCounter, 421 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:37,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1365 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:37,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2024-10-12 20:35:38,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 3268. [2024-10-12 20:35:38,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3268 states, 3267 states have (on average 1.4811753902662994) internal successors, (4839), 3267 states have internal predecessors, (4839), 0 states have call successors, (0), 0 states 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:35:38,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3268 states to 3268 states and 4839 transitions. [2024-10-12 20:35:38,078 INFO L78 Accepts]: Start accepts. Automaton has 3268 states and 4839 transitions. Word has length 163 [2024-10-12 20:35:38,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:38,079 INFO L471 AbstractCegarLoop]: Abstraction has 3268 states and 4839 transitions. [2024-10-12 20:35:38,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:38,079 INFO L276 IsEmpty]: Start isEmpty. Operand 3268 states and 4839 transitions. [2024-10-12 20:35:38,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-12 20:35:38,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:38,083 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:38,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:35:38,083 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:38,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:38,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1956138199, now seen corresponding path program 1 times [2024-10-12 20:35:38,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:38,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030833287] [2024-10-12 20:35:38,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:38,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:38,292 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:35:38,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:38,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030833287] [2024-10-12 20:35:38,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030833287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:38,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:38,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:35:38,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611124290] [2024-10-12 20:35:38,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:38,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:35:38,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:38,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:35:38,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:35:38,296 INFO L87 Difference]: Start difference. First operand 3268 states and 4839 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:38,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:38,517 INFO L93 Difference]: Finished difference Result 6315 states and 9407 transitions. [2024-10-12 20:35:38,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:35:38,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2024-10-12 20:35:38,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:38,529 INFO L225 Difference]: With dead ends: 6315 [2024-10-12 20:35:38,530 INFO L226 Difference]: Without dead ends: 3268 [2024-10-12 20:35:38,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:35:38,535 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 1319 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:38,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1319 Valid, 480 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:35:38,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3268 states. [2024-10-12 20:35:38,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3268 to 3268. [2024-10-12 20:35:38,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3268 states, 3267 states have (on average 1.470768288950107) internal successors, (4805), 3267 states have internal predecessors, (4805), 0 states have call successors, (0), 0 states 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:35:38,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3268 states to 3268 states and 4805 transitions. [2024-10-12 20:35:38,633 INFO L78 Accepts]: Start accepts. Automaton has 3268 states and 4805 transitions. Word has length 163 [2024-10-12 20:35:38,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:38,634 INFO L471 AbstractCegarLoop]: Abstraction has 3268 states and 4805 transitions. [2024-10-12 20:35:38,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:38,634 INFO L276 IsEmpty]: Start isEmpty. Operand 3268 states and 4805 transitions. [2024-10-12 20:35:38,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-12 20:35:38,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:38,639 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:38,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:35:38,640 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:38,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:38,640 INFO L85 PathProgramCache]: Analyzing trace with hash -13426930, now seen corresponding path program 1 times [2024-10-12 20:35:38,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:38,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874459115] [2024-10-12 20:35:38,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:38,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:39,097 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:35:39,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:39,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874459115] [2024-10-12 20:35:39,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874459115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:39,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:39,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:35:39,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910173609] [2024-10-12 20:35:39,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:39,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:35:39,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:39,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:35:39,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:39,101 INFO L87 Difference]: Start difference. First operand 3268 states and 4805 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:39,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:39,154 INFO L93 Difference]: Finished difference Result 6512 states and 9572 transitions. [2024-10-12 20:35:39,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:35:39,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2024-10-12 20:35:39,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:39,168 INFO L225 Difference]: With dead ends: 6512 [2024-10-12 20:35:39,168 INFO L226 Difference]: Without dead ends: 3266 [2024-10-12 20:35:39,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:39,173 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 23 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:39,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1548 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:39,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2024-10-12 20:35:39,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2024-10-12 20:35:39,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 3265 states have (on average 1.4704441041347627) internal successors, (4801), 3265 states have internal predecessors, (4801), 0 states have call successors, (0), 0 states 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:35:39,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4801 transitions. [2024-10-12 20:35:39,276 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4801 transitions. Word has length 163 [2024-10-12 20:35:39,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:39,277 INFO L471 AbstractCegarLoop]: Abstraction has 3266 states and 4801 transitions. [2024-10-12 20:35:39,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:39,277 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4801 transitions. [2024-10-12 20:35:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-12 20:35:39,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:39,281 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:39,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:35:39,281 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:39,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:39,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1165569905, now seen corresponding path program 1 times [2024-10-12 20:35:39,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:39,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514948714] [2024-10-12 20:35:39,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:39,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:39,392 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:35:39,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:39,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514948714] [2024-10-12 20:35:39,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514948714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:39,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:39,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:39,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396969945] [2024-10-12 20:35:39,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:39,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:35:39,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:39,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:35:39,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:39,395 INFO L87 Difference]: Start difference. First operand 3266 states and 4801 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:39,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:39,468 INFO L93 Difference]: Finished difference Result 7867 states and 11610 transitions. [2024-10-12 20:35:39,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:35:39,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2024-10-12 20:35:39,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:39,486 INFO L225 Difference]: With dead ends: 7867 [2024-10-12 20:35:39,486 INFO L226 Difference]: Without dead ends: 5007 [2024-10-12 20:35:39,491 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:35:39,492 INFO L432 NwaCegarLoop]: 860 mSDtfsCounter, 414 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:39,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1299 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:39,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5007 states. [2024-10-12 20:35:39,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5007 to 5005. [2024-10-12 20:35:39,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5005 states, 5004 states have (on average 1.4520383693045564) internal successors, (7266), 5004 states have internal predecessors, (7266), 0 states have call successors, (0), 0 states 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:35:39,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5005 states to 5005 states and 7266 transitions. [2024-10-12 20:35:39,662 INFO L78 Accepts]: Start accepts. Automaton has 5005 states and 7266 transitions. Word has length 163 [2024-10-12 20:35:39,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:39,663 INFO L471 AbstractCegarLoop]: Abstraction has 5005 states and 7266 transitions. [2024-10-12 20:35:39,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:35:39,663 INFO L276 IsEmpty]: Start isEmpty. Operand 5005 states and 7266 transitions. [2024-10-12 20:35:39,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-12 20:35:39,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:39,668 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:39,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:35:39,668 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:39,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:39,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1942984789, now seen corresponding path program 1 times [2024-10-12 20:35:39,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:39,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378399723] [2024-10-12 20:35:39,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:39,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:39,767 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:35:39,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:39,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378399723] [2024-10-12 20:35:39,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378399723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:39,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:39,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:39,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70579826] [2024-10-12 20:35:39,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:39,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:35:39,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:39,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:35:39,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:39,770 INFO L87 Difference]: Start difference. First operand 5005 states and 7266 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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:35:39,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:39,860 INFO L93 Difference]: Finished difference Result 12547 states and 18547 transitions. [2024-10-12 20:35:39,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:35:39,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2024-10-12 20:35:39,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:39,888 INFO L225 Difference]: With dead ends: 12547 [2024-10-12 20:35:39,889 INFO L226 Difference]: Without dead ends: 7873 [2024-10-12 20:35:39,897 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:35:39,898 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 303 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:39,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 1036 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:39,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7873 states. [2024-10-12 20:35:40,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7873 to 7003. [2024-10-12 20:35:40,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7003 states, 7002 states have (on average 1.4911453870322764) internal successors, (10441), 7002 states have internal predecessors, (10441), 0 states have call successors, (0), 0 states 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:35:40,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7003 states to 7003 states and 10441 transitions. [2024-10-12 20:35:40,042 INFO L78 Accepts]: Start accepts. Automaton has 7003 states and 10441 transitions. Word has length 167 [2024-10-12 20:35:40,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:40,043 INFO L471 AbstractCegarLoop]: Abstraction has 7003 states and 10441 transitions. [2024-10-12 20:35:40,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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:35:40,044 INFO L276 IsEmpty]: Start isEmpty. Operand 7003 states and 10441 transitions. [2024-10-12 20:35:40,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-12 20:35:40,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:40,049 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:40,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:35:40,049 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:40,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:40,050 INFO L85 PathProgramCache]: Analyzing trace with hash -765275418, now seen corresponding path program 1 times [2024-10-12 20:35:40,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:40,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379307520] [2024-10-12 20:35:40,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:40,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:40,186 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:35:40,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:40,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379307520] [2024-10-12 20:35:40,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379307520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:40,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:40,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:40,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566070499] [2024-10-12 20:35:40,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:40,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:35:40,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:40,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:35:40,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:40,188 INFO L87 Difference]: Start difference. First operand 7003 states and 10441 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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:35:40,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:40,299 INFO L93 Difference]: Finished difference Result 18063 states and 27343 transitions. [2024-10-12 20:35:40,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:35:40,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2024-10-12 20:35:40,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:40,324 INFO L225 Difference]: With dead ends: 18063 [2024-10-12 20:35:40,325 INFO L226 Difference]: Without dead ends: 11479 [2024-10-12 20:35:40,335 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:35:40,336 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 300 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:40,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1015 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:40,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11479 states. [2024-10-12 20:35:40,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11479 to 10465. [2024-10-12 20:35:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10465 states, 10464 states have (on average 1.523413608562691) internal successors, (15941), 10464 states have internal predecessors, (15941), 0 states have call successors, (0), 0 states 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:35:40,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10465 states to 10465 states and 15941 transitions. [2024-10-12 20:35:40,534 INFO L78 Accepts]: Start accepts. Automaton has 10465 states and 15941 transitions. Word has length 167 [2024-10-12 20:35:40,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:40,535 INFO L471 AbstractCegarLoop]: Abstraction has 10465 states and 15941 transitions. [2024-10-12 20:35:40,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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:35:40,535 INFO L276 IsEmpty]: Start isEmpty. Operand 10465 states and 15941 transitions. [2024-10-12 20:35:40,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-12 20:35:40,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:40,541 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:40,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:35:40,541 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:40,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:40,542 INFO L85 PathProgramCache]: Analyzing trace with hash 958688623, now seen corresponding path program 1 times [2024-10-12 20:35:40,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:40,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113511511] [2024-10-12 20:35:40,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:40,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:41,039 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:35:41,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:41,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113511511] [2024-10-12 20:35:41,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113511511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:41,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:41,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:35:41,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146451406] [2024-10-12 20:35:41,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:41,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:35:41,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:41,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:35:41,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:41,043 INFO L87 Difference]: Start difference. First operand 10465 states and 15941 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states 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:35:41,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:41,249 INFO L93 Difference]: Finished difference Result 28467 states and 44105 transitions. [2024-10-12 20:35:41,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:35:41,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2024-10-12 20:35:41,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:41,297 INFO L225 Difference]: With dead ends: 28467 [2024-10-12 20:35:41,297 INFO L226 Difference]: Without dead ends: 20219 [2024-10-12 20:35:41,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:35:41,317 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 873 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:41,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 902 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:35:41,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20219 states. [2024-10-12 20:35:41,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20219 to 20217. [2024-10-12 20:35:41,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20217 states, 20216 states have (on average 1.5291353383458646) internal successors, (30913), 20216 states have internal predecessors, (30913), 0 states have call successors, (0), 0 states 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:35:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20217 states to 20217 states and 30913 transitions. [2024-10-12 20:35:41,762 INFO L78 Accepts]: Start accepts. Automaton has 20217 states and 30913 transitions. Word has length 168 [2024-10-12 20:35:41,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:41,762 INFO L471 AbstractCegarLoop]: Abstraction has 20217 states and 30913 transitions. [2024-10-12 20:35:41,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states 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:35:41,763 INFO L276 IsEmpty]: Start isEmpty. Operand 20217 states and 30913 transitions. [2024-10-12 20:35:41,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-12 20:35:41,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:41,771 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:41,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:35:41,771 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:41,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:41,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1136807295, now seen corresponding path program 1 times [2024-10-12 20:35:41,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:41,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419043860] [2024-10-12 20:35:41,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:41,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:42,169 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:35:42,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:42,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419043860] [2024-10-12 20:35:42,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419043860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:42,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:42,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:42,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732218241] [2024-10-12 20:35:42,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:42,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:35:42,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:42,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:35:42,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:42,172 INFO L87 Difference]: Start difference. First operand 20217 states and 30913 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states 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:35:42,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:42,559 INFO L93 Difference]: Finished difference Result 93437 states and 142378 transitions. [2024-10-12 20:35:42,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:35:42,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2024-10-12 20:35:42,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:42,719 INFO L225 Difference]: With dead ends: 93437 [2024-10-12 20:35:42,719 INFO L226 Difference]: Without dead ends: 73258 [2024-10-12 20:35:42,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:35:42,767 INFO L432 NwaCegarLoop]: 820 mSDtfsCounter, 1350 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:42,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 2059 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:35:42,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73258 states. [2024-10-12 20:35:44,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73258 to 36673. [2024-10-12 20:35:44,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36673 states, 36672 states have (on average 1.5094349912739966) internal successors, (55354), 36672 states have internal predecessors, (55354), 0 states have call successors, (0), 0 states 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:35:44,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36673 states to 36673 states and 55354 transitions. [2024-10-12 20:35:44,154 INFO L78 Accepts]: Start accepts. Automaton has 36673 states and 55354 transitions. Word has length 168 [2024-10-12 20:35:44,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:44,154 INFO L471 AbstractCegarLoop]: Abstraction has 36673 states and 55354 transitions. [2024-10-12 20:35:44,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states 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:35:44,155 INFO L276 IsEmpty]: Start isEmpty. Operand 36673 states and 55354 transitions. [2024-10-12 20:35:44,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-12 20:35:44,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:44,173 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:44,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:35:44,173 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:44,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:44,174 INFO L85 PathProgramCache]: Analyzing trace with hash -399857551, now seen corresponding path program 1 times [2024-10-12 20:35:44,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:44,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128798383] [2024-10-12 20:35:44,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:44,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:44,287 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:35:44,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:44,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128798383] [2024-10-12 20:35:44,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128798383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:44,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:44,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:44,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845798420] [2024-10-12 20:35:44,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:44,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:35:44,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:44,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:35:44,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:44,289 INFO L87 Difference]: Start difference. First operand 36673 states and 55354 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states 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:35:44,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:44,675 INFO L93 Difference]: Finished difference Result 73248 states and 110581 transitions. [2024-10-12 20:35:44,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:35:44,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2024-10-12 20:35:44,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:44,753 INFO L225 Difference]: With dead ends: 73248 [2024-10-12 20:35:44,754 INFO L226 Difference]: Without dead ends: 36679 [2024-10-12 20:35:44,789 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:35:44,790 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 0 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:44,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 967 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:45,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36679 states. [2024-10-12 20:35:45,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36679 to 36679. [2024-10-12 20:35:45,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36679 states, 36678 states have (on average 1.5093516549430177) internal successors, (55360), 36678 states have internal predecessors, (55360), 0 states have call successors, (0), 0 states 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:35:45,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36679 states to 36679 states and 55360 transitions. [2024-10-12 20:35:45,967 INFO L78 Accepts]: Start accepts. Automaton has 36679 states and 55360 transitions. Word has length 169 [2024-10-12 20:35:45,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:45,967 INFO L471 AbstractCegarLoop]: Abstraction has 36679 states and 55360 transitions. [2024-10-12 20:35:45,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states 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:35:45,968 INFO L276 IsEmpty]: Start isEmpty. Operand 36679 states and 55360 transitions. [2024-10-12 20:35:45,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-12 20:35:45,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:45,982 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:45,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:35:45,983 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:45,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:45,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1037689762, now seen corresponding path program 1 times [2024-10-12 20:35:45,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:45,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234273804] [2024-10-12 20:35:45,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:45,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:46,096 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:35:46,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:46,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234273804] [2024-10-12 20:35:46,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234273804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:46,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:46,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:46,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390244647] [2024-10-12 20:35:46,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:46,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:35:46,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:46,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:35:46,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:46,101 INFO L87 Difference]: Start difference. First operand 36679 states and 55360 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states 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:35:46,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:46,475 INFO L93 Difference]: Finished difference Result 96063 states and 144692 transitions. [2024-10-12 20:35:46,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:35:46,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2024-10-12 20:35:46,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:46,602 INFO L225 Difference]: With dead ends: 96063 [2024-10-12 20:35:46,602 INFO L226 Difference]: Without dead ends: 60129 [2024-10-12 20:35:46,639 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:35:46,640 INFO L432 NwaCegarLoop]: 897 mSDtfsCounter, 400 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:46,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1339 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:46,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60129 states. [2024-10-12 20:35:47,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60129 to 60127. [2024-10-12 20:35:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60127 states, 60126 states have (on average 1.486312077969597) internal successors, (89366), 60126 states have internal predecessors, (89366), 0 states have call successors, (0), 0 states 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:35:48,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60127 states to 60127 states and 89366 transitions. [2024-10-12 20:35:48,086 INFO L78 Accepts]: Start accepts. Automaton has 60127 states and 89366 transitions. Word has length 170 [2024-10-12 20:35:48,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:48,087 INFO L471 AbstractCegarLoop]: Abstraction has 60127 states and 89366 transitions. [2024-10-12 20:35:48,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states 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:35:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand 60127 states and 89366 transitions. [2024-10-12 20:35:48,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-12 20:35:48,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:48,109 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:48,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:35:48,109 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:48,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:48,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1785524965, now seen corresponding path program 1 times [2024-10-12 20:35:48,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:48,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903789366] [2024-10-12 20:35:48,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:48,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:48,779 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:35:48,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:48,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903789366] [2024-10-12 20:35:48,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903789366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:48,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:48,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:35:48,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577131682] [2024-10-12 20:35:48,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:48,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:35:48,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:48,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:35:48,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:48,781 INFO L87 Difference]: Start difference. First operand 60127 states and 89366 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states 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:35:49,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:49,120 INFO L93 Difference]: Finished difference Result 112628 states and 167653 transitions. [2024-10-12 20:35:49,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:35:49,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2024-10-12 20:35:49,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:49,245 INFO L225 Difference]: With dead ends: 112628 [2024-10-12 20:35:49,245 INFO L226 Difference]: Without dead ends: 53170 [2024-10-12 20:35:49,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:49,314 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 15 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:49,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1510 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:49,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53170 states. [2024-10-12 20:35:50,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53170 to 53170. [2024-10-12 20:35:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53170 states, 53169 states have (on average 1.4869566852865392) internal successors, (79060), 53169 states have internal predecessors, (79060), 0 states have call successors, (0), 0 states 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:35:50,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53170 states to 53170 states and 79060 transitions. [2024-10-12 20:35:50,634 INFO L78 Accepts]: Start accepts. Automaton has 53170 states and 79060 transitions. Word has length 170 [2024-10-12 20:35:50,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:50,635 INFO L471 AbstractCegarLoop]: Abstraction has 53170 states and 79060 transitions. [2024-10-12 20:35:50,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states 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:35:50,635 INFO L276 IsEmpty]: Start isEmpty. Operand 53170 states and 79060 transitions. [2024-10-12 20:35:50,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-12 20:35:50,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:50,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:50,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:35:50,660 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:50,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:50,661 INFO L85 PathProgramCache]: Analyzing trace with hash -2112588902, now seen corresponding path program 1 times [2024-10-12 20:35:50,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:50,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301416357] [2024-10-12 20:35:50,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:50,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:51,102 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:35:51,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:51,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301416357] [2024-10-12 20:35:51,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301416357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:51,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:51,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:35:51,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058341630] [2024-10-12 20:35:51,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:51,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:35:51,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:51,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:35:51,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:51,105 INFO L87 Difference]: Start difference. First operand 53170 states and 79060 transitions. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states 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:35:51,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:51,692 INFO L93 Difference]: Finished difference Result 74858 states and 111990 transitions. [2024-10-12 20:35:51,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:35:51,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 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 175 [2024-10-12 20:35:51,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:51,811 INFO L225 Difference]: With dead ends: 74858 [2024-10-12 20:35:51,811 INFO L226 Difference]: Without dead ends: 53220 [2024-10-12 20:35:51,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:51,846 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 98 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:51,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1566 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:51,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53220 states. [2024-10-12 20:35:52,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53220 to 53118. [2024-10-12 20:35:52,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53118 states, 53117 states have (on average 1.4860402507671744) internal successors, (78934), 53117 states have internal predecessors, (78934), 0 states have call successors, (0), 0 states 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:35:52,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53118 states to 53118 states and 78934 transitions. [2024-10-12 20:35:52,716 INFO L78 Accepts]: Start accepts. Automaton has 53118 states and 78934 transitions. Word has length 175 [2024-10-12 20:35:52,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:52,716 INFO L471 AbstractCegarLoop]: Abstraction has 53118 states and 78934 transitions. [2024-10-12 20:35:52,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states 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:35:52,716 INFO L276 IsEmpty]: Start isEmpty. Operand 53118 states and 78934 transitions. [2024-10-12 20:35:52,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-12 20:35:52,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:52,728 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:52,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:35:52,728 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:52,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:52,729 INFO L85 PathProgramCache]: Analyzing trace with hash -573100049, now seen corresponding path program 1 times [2024-10-12 20:35:52,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:52,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651948776] [2024-10-12 20:35:52,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:52,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:53,076 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:35:53,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:53,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651948776] [2024-10-12 20:35:53,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651948776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:53,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:53,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:53,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615059473] [2024-10-12 20:35:53,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:53,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:35:53,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:53,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:35:53,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:53,080 INFO L87 Difference]: Start difference. First operand 53118 states and 78934 transitions. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states 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:35:53,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:53,761 INFO L93 Difference]: Finished difference Result 101640 states and 151175 transitions. [2024-10-12 20:35:53,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:35:53,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 175 [2024-10-12 20:35:53,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:53,835 INFO L225 Difference]: With dead ends: 101640 [2024-10-12 20:35:53,836 INFO L226 Difference]: Without dead ends: 48824 [2024-10-12 20:35:53,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:35:53,882 INFO L432 NwaCegarLoop]: 788 mSDtfsCounter, 413 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:53,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1974 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:53,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48824 states. [2024-10-12 20:35:54,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48824 to 48782. [2024-10-12 20:35:54,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48782 states, 48781 states have (on average 1.4869518870051865) internal successors, (72535), 48781 states have internal predecessors, (72535), 0 states have call successors, (0), 0 states 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:35:54,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48782 states to 48782 states and 72535 transitions. [2024-10-12 20:35:54,773 INFO L78 Accepts]: Start accepts. Automaton has 48782 states and 72535 transitions. Word has length 175 [2024-10-12 20:35:54,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:54,775 INFO L471 AbstractCegarLoop]: Abstraction has 48782 states and 72535 transitions. [2024-10-12 20:35:54,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states 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:35:54,775 INFO L276 IsEmpty]: Start isEmpty. Operand 48782 states and 72535 transitions. [2024-10-12 20:35:54,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-12 20:35:54,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:54,787 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:54,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:35:54,788 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:54,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:54,788 INFO L85 PathProgramCache]: Analyzing trace with hash -2009446946, now seen corresponding path program 1 times [2024-10-12 20:35:54,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:54,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334591506] [2024-10-12 20:35:54,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:54,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:55,235 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:35:55,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:55,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334591506] [2024-10-12 20:35:55,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334591506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:55,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:55,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:55,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666525759] [2024-10-12 20:35:55,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:55,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:35:55,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:55,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:35:55,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:55,239 INFO L87 Difference]: Start difference. First operand 48782 states and 72535 transitions. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states 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:35:55,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:55,802 INFO L93 Difference]: Finished difference Result 146304 states and 217550 transitions. [2024-10-12 20:35:55,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:35:55,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 177 [2024-10-12 20:35:55,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:55,976 INFO L225 Difference]: With dead ends: 146304 [2024-10-12 20:35:55,976 INFO L226 Difference]: Without dead ends: 97676 [2024-10-12 20:35:56,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:35:56,048 INFO L432 NwaCegarLoop]: 794 mSDtfsCounter, 1312 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1312 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:56,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1312 Valid, 2048 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:35:56,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97676 states. [2024-10-12 20:35:57,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97676 to 48884. [2024-10-12 20:35:57,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48884 states, 48883 states have (on average 1.4859562629134873) internal successors, (72638), 48883 states have internal predecessors, (72638), 0 states have call successors, (0), 0 states 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:35:57,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48884 states to 48884 states and 72638 transitions. [2024-10-12 20:35:57,616 INFO L78 Accepts]: Start accepts. Automaton has 48884 states and 72638 transitions. Word has length 177 [2024-10-12 20:35:57,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:57,616 INFO L471 AbstractCegarLoop]: Abstraction has 48884 states and 72638 transitions. [2024-10-12 20:35:57,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states 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:35:57,617 INFO L276 IsEmpty]: Start isEmpty. Operand 48884 states and 72638 transitions. [2024-10-12 20:35:57,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-12 20:35:57,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:57,626 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:57,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:35:57,626 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:57,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:57,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1599464048, now seen corresponding path program 1 times [2024-10-12 20:35:57,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:57,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883623214] [2024-10-12 20:35:57,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:57,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:57,715 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:35:57,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:57,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883623214] [2024-10-12 20:35:57,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883623214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:57,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:57,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:57,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635130066] [2024-10-12 20:35:57,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:57,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:35:57,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:57,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:35:57,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:57,718 INFO L87 Difference]: Start difference. First operand 48884 states and 72638 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:35:57,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:57,955 INFO L93 Difference]: Finished difference Result 85174 states and 126630 transitions. [2024-10-12 20:35:57,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:35:57,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2024-10-12 20:35:57,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:58,023 INFO L225 Difference]: With dead ends: 85174 [2024-10-12 20:35:58,023 INFO L226 Difference]: Without dead ends: 48894 [2024-10-12 20:35:58,057 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:35:58,058 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 0 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:58,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 957 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:58,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48894 states. [2024-10-12 20:35:58,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48894 to 48894. [2024-10-12 20:35:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48894 states, 48893 states have (on average 1.4858568711267461) internal successors, (72648), 48893 states have internal predecessors, (72648), 0 states have call successors, (0), 0 states 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:35:58,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48894 states to 48894 states and 72648 transitions. [2024-10-12 20:35:58,825 INFO L78 Accepts]: Start accepts. Automaton has 48894 states and 72648 transitions. Word has length 178 [2024-10-12 20:35:58,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:58,825 INFO L471 AbstractCegarLoop]: Abstraction has 48894 states and 72648 transitions. [2024-10-12 20:35:58,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:35:58,825 INFO L276 IsEmpty]: Start isEmpty. Operand 48894 states and 72648 transitions. [2024-10-12 20:35:58,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-12 20:35:58,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:58,837 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:58,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 20:35:58,837 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:35:58,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:58,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1502050143, now seen corresponding path program 1 times [2024-10-12 20:35:58,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:58,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113872938] [2024-10-12 20:35:58,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:58,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:59,335 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:35:59,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:59,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113872938] [2024-10-12 20:35:59,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113872938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:59,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:59,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:35:59,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563323614] [2024-10-12 20:35:59,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:59,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:35:59,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:59,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:35:59,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:59,338 INFO L87 Difference]: Start difference. First operand 48894 states and 72648 transitions. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:35:59,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:59,578 INFO L93 Difference]: Finished difference Result 90306 states and 134187 transitions. [2024-10-12 20:35:59,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:35:59,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2024-10-12 20:35:59,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:59,658 INFO L225 Difference]: With dead ends: 90306 [2024-10-12 20:35:59,659 INFO L226 Difference]: Without dead ends: 48894 [2024-10-12 20:35:59,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:59,700 INFO L432 NwaCegarLoop]: 494 mSDtfsCounter, 0 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:59,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1461 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:59,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48894 states. [2024-10-12 20:36:00,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48894 to 48889. [2024-10-12 20:36:00,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48889 states, 48888 states have (on average 1.4857429225985928) internal successors, (72635), 48888 states have internal predecessors, (72635), 0 states have call successors, (0), 0 states 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:36:00,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48889 states to 48889 states and 72635 transitions. [2024-10-12 20:36:00,858 INFO L78 Accepts]: Start accepts. Automaton has 48889 states and 72635 transitions. Word has length 179 [2024-10-12 20:36:00,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:36:00,858 INFO L471 AbstractCegarLoop]: Abstraction has 48889 states and 72635 transitions. [2024-10-12 20:36:00,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:36:00,859 INFO L276 IsEmpty]: Start isEmpty. Operand 48889 states and 72635 transitions. [2024-10-12 20:36:00,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-12 20:36:00,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:36:00,876 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:00,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 20:36:00,877 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:36:00,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:36:00,877 INFO L85 PathProgramCache]: Analyzing trace with hash -2043283841, now seen corresponding path program 1 times [2024-10-12 20:36:00,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:36:00,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061184122] [2024-10-12 20:36:00,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:36:00,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:36:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:36:01,649 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:36:01,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:36:01,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061184122] [2024-10-12 20:36:01,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061184122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:36:01,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:36:01,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:36:01,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908137401] [2024-10-12 20:36:01,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:36:01,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:36:01,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:36:01,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:36:01,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:36:01,651 INFO L87 Difference]: Start difference. First operand 48889 states and 72635 transitions. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:36:01,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:36:01,910 INFO L93 Difference]: Finished difference Result 80501 states and 119798 transitions. [2024-10-12 20:36:01,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:36:01,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2024-10-12 20:36:01,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:36:01,967 INFO L225 Difference]: With dead ends: 80501 [2024-10-12 20:36:01,967 INFO L226 Difference]: Without dead ends: 44923 [2024-10-12 20:36:02,005 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:36:02,005 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 416 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:36:02,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 1598 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:36:02,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44923 states. [2024-10-12 20:36:02,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44923 to 44657. [2024-10-12 20:36:02,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44657 states, 44656 states have (on average 1.486004120386958) internal successors, (66359), 44656 states have internal predecessors, (66359), 0 states have call successors, (0), 0 states 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:36:02,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44657 states to 44657 states and 66359 transitions. [2024-10-12 20:36:02,510 INFO L78 Accepts]: Start accepts. Automaton has 44657 states and 66359 transitions. Word has length 179 [2024-10-12 20:36:02,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:36:02,510 INFO L471 AbstractCegarLoop]: Abstraction has 44657 states and 66359 transitions. [2024-10-12 20:36:02,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:36:02,510 INFO L276 IsEmpty]: Start isEmpty. Operand 44657 states and 66359 transitions. [2024-10-12 20:36:02,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-12 20:36:02,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:36:02,518 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:02,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 20:36:02,518 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:36:02,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:36:02,519 INFO L85 PathProgramCache]: Analyzing trace with hash -806192530, now seen corresponding path program 1 times [2024-10-12 20:36:02,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:36:02,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466375159] [2024-10-12 20:36:02,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:36:02,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:36:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:36:02,823 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:36:02,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:36:02,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466375159] [2024-10-12 20:36:02,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466375159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:36:02,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:36:02,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:36:02,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375757614] [2024-10-12 20:36:02,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:36:02,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:36:02,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:36:02,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:36:02,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:36:02,827 INFO L87 Difference]: Start difference. First operand 44657 states and 66359 transitions. Second operand has 5 states, 5 states have (on average 36.2) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:36:03,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:36:03,187 INFO L93 Difference]: Finished difference Result 88067 states and 131302 transitions. [2024-10-12 20:36:03,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:36:03,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.2) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2024-10-12 20:36:03,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:36:03,243 INFO L225 Difference]: With dead ends: 88067 [2024-10-12 20:36:03,243 INFO L226 Difference]: Without dead ends: 44657 [2024-10-12 20:36:03,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:36:03,280 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 1255 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:36:03,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 453 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:36:03,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44657 states. [2024-10-12 20:36:03,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44657 to 44657. [2024-10-12 20:36:03,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44657 states, 44656 states have (on average 1.4737773199570046) internal successors, (65813), 44656 states have internal predecessors, (65813), 0 states have call successors, (0), 0 states 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:36:04,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44657 states to 44657 states and 65813 transitions. [2024-10-12 20:36:04,163 INFO L78 Accepts]: Start accepts. Automaton has 44657 states and 65813 transitions. Word has length 181 [2024-10-12 20:36:04,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:36:04,163 INFO L471 AbstractCegarLoop]: Abstraction has 44657 states and 65813 transitions. [2024-10-12 20:36:04,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.2) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:36:04,163 INFO L276 IsEmpty]: Start isEmpty. Operand 44657 states and 65813 transitions. [2024-10-12 20:36:04,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-12 20:36:04,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:36:04,181 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:04,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 20:36:04,181 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:36:04,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:36:04,182 INFO L85 PathProgramCache]: Analyzing trace with hash 119980169, now seen corresponding path program 1 times [2024-10-12 20:36:04,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:36:04,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835596607] [2024-10-12 20:36:04,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:36:04,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:36:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:36:04,362 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:36:04,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:36:04,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835596607] [2024-10-12 20:36:04,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835596607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:36:04,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:36:04,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:36:04,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401114789] [2024-10-12 20:36:04,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:36:04,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:36:04,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:36:04,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:36:04,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:36:04,364 INFO L87 Difference]: Start difference. First operand 44657 states and 65813 transitions. Second operand has 5 states, 5 states have (on average 36.2) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:36:04,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:36:04,664 INFO L93 Difference]: Finished difference Result 88287 states and 130492 transitions. [2024-10-12 20:36:04,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:36:04,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.2) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2024-10-12 20:36:04,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:36:04,717 INFO L225 Difference]: With dead ends: 88287 [2024-10-12 20:36:04,717 INFO L226 Difference]: Without dead ends: 44657 [2024-10-12 20:36:04,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:36:04,752 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 1247 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1247 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:36:04,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1247 Valid, 451 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:36:04,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44657 states. [2024-10-12 20:36:05,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44657 to 44657. [2024-10-12 20:36:05,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44657 states, 44656 states have (on average 1.4615505195270513) internal successors, (65267), 44656 states have internal predecessors, (65267), 0 states have call successors, (0), 0 states 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:36:05,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44657 states to 44657 states and 65267 transitions. [2024-10-12 20:36:05,625 INFO L78 Accepts]: Start accepts. Automaton has 44657 states and 65267 transitions. Word has length 181 [2024-10-12 20:36:05,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:36:05,626 INFO L471 AbstractCegarLoop]: Abstraction has 44657 states and 65267 transitions. [2024-10-12 20:36:05,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.2) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:36:05,626 INFO L276 IsEmpty]: Start isEmpty. Operand 44657 states and 65267 transitions. [2024-10-12 20:36:05,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-12 20:36:05,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:36:05,636 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:05,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 20:36:05,637 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:36:05,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:36:05,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1068363740, now seen corresponding path program 1 times [2024-10-12 20:36:05,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:36:05,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221218135] [2024-10-12 20:36:05,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:36:05,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:36:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:36:06,141 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:36:06,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:36:06,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221218135] [2024-10-12 20:36:06,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221218135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:36:06,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:36:06,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:36:06,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880771070] [2024-10-12 20:36:06,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:36:06,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:36:06,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:36:06,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:36:06,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:36:06,145 INFO L87 Difference]: Start difference. First operand 44657 states and 65267 transitions. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:36:06,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:36:06,552 INFO L93 Difference]: Finished difference Result 122475 states and 182181 transitions. [2024-10-12 20:36:06,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:36:06,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2024-10-12 20:36:06,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:36:06,673 INFO L225 Difference]: With dead ends: 122475 [2024-10-12 20:36:06,674 INFO L226 Difference]: Without dead ends: 86881 [2024-10-12 20:36:06,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:36:06,723 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 572 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:36:06,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 965 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:36:06,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86881 states. [2024-10-12 20:36:07,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86881 to 86879. [2024-10-12 20:36:08,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86879 states, 86878 states have (on average 1.4659982964617049) internal successors, (127363), 86878 states have internal predecessors, (127363), 0 states have call successors, (0), 0 states 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:36:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86879 states to 86879 states and 127363 transitions. [2024-10-12 20:36:08,616 INFO L78 Accepts]: Start accepts. Automaton has 86879 states and 127363 transitions. Word has length 181 [2024-10-12 20:36:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:36:08,616 INFO L471 AbstractCegarLoop]: Abstraction has 86879 states and 127363 transitions. [2024-10-12 20:36:08,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:36:08,616 INFO L276 IsEmpty]: Start isEmpty. Operand 86879 states and 127363 transitions. [2024-10-12 20:36:08,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-12 20:36:08,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:36:08,630 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:08,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 20:36:08,630 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:36:08,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:36:08,630 INFO L85 PathProgramCache]: Analyzing trace with hash -236162137, now seen corresponding path program 1 times [2024-10-12 20:36:08,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:36:08,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672732705] [2024-10-12 20:36:08,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:36:08,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:36:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:36:08,823 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:36:08,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:36:08,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672732705] [2024-10-12 20:36:08,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672732705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:36:08,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:36:08,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:36:08,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999502614] [2024-10-12 20:36:08,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:36:08,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:36:08,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:36:08,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:36:08,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:36:08,826 INFO L87 Difference]: Start difference. First operand 86879 states and 127363 transitions. Second operand has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:36:09,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:36:09,468 INFO L93 Difference]: Finished difference Result 182209 states and 272945 transitions. [2024-10-12 20:36:09,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:36:09,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2024-10-12 20:36:09,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:36:09,709 INFO L225 Difference]: With dead ends: 182209 [2024-10-12 20:36:09,709 INFO L226 Difference]: Without dead ends: 147533 [2024-10-12 20:36:09,779 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:36:09,780 INFO L432 NwaCegarLoop]: 633 mSDtfsCounter, 1063 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:36:09,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 1628 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:36:09,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147533 states. [2024-10-12 20:36:11,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147533 to 104207. [2024-10-12 20:36:11,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104207 states, 104206 states have (on average 1.4733220735850143) internal successors, (153529), 104206 states have internal predecessors, (153529), 0 states have call successors, (0), 0 states 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:36:12,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104207 states to 104207 states and 153529 transitions. [2024-10-12 20:36:12,144 INFO L78 Accepts]: Start accepts. Automaton has 104207 states and 153529 transitions. Word has length 181 [2024-10-12 20:36:12,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:36:12,145 INFO L471 AbstractCegarLoop]: Abstraction has 104207 states and 153529 transitions. [2024-10-12 20:36:12,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:36:12,145 INFO L276 IsEmpty]: Start isEmpty. Operand 104207 states and 153529 transitions. [2024-10-12 20:36:12,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-12 20:36:12,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:36:12,163 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:12,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 20:36:12,163 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:36:12,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:36:12,164 INFO L85 PathProgramCache]: Analyzing trace with hash -58043465, now seen corresponding path program 1 times [2024-10-12 20:36:12,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:36:12,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170554226] [2024-10-12 20:36:12,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:36:12,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:36:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:36:12,307 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:36:12,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:36:12,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170554226] [2024-10-12 20:36:12,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170554226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:36:12,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:36:12,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:36:12,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354313697] [2024-10-12 20:36:12,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:36:12,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:36:12,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:36:12,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:36:12,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:36:12,310 INFO L87 Difference]: Start difference. First operand 104207 states and 153529 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:36:12,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:36:12,880 INFO L93 Difference]: Finished difference Result 149147 states and 221615 transitions. [2024-10-12 20:36:12,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:36:12,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2024-10-12 20:36:12,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:36:13,079 INFO L225 Difference]: With dead ends: 149147 [2024-10-12 20:36:13,079 INFO L226 Difference]: Without dead ends: 104209 [2024-10-12 20:36:13,138 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:36:13,139 INFO L432 NwaCegarLoop]: 620 mSDtfsCounter, 281 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:36:13,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 958 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:36:13,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104209 states. [2024-10-12 20:36:15,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104209 to 104207. [2024-10-12 20:36:15,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104207 states, 104206 states have (on average 1.4691764389766424) internal successors, (153097), 104206 states have internal predecessors, (153097), 0 states have call successors, (0), 0 states 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:36:15,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104207 states to 104207 states and 153097 transitions. [2024-10-12 20:36:15,518 INFO L78 Accepts]: Start accepts. Automaton has 104207 states and 153097 transitions. Word has length 181 [2024-10-12 20:36:15,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:36:15,518 INFO L471 AbstractCegarLoop]: Abstraction has 104207 states and 153097 transitions. [2024-10-12 20:36:15,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:36:15,519 INFO L276 IsEmpty]: Start isEmpty. Operand 104207 states and 153097 transitions. [2024-10-12 20:36:15,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-12 20:36:15,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:36:15,531 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:15,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-12 20:36:15,531 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:36:15,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:36:15,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1668331806, now seen corresponding path program 1 times [2024-10-12 20:36:15,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:36:15,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617541561] [2024-10-12 20:36:15,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:36:15,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:36:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:36:15,736 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:36:15,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:36:15,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617541561] [2024-10-12 20:36:15,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617541561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:36:15,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:36:15,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:36:15,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211343813] [2024-10-12 20:36:15,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:36:15,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:36:15,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:36:15,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:36:15,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:36:15,739 INFO L87 Difference]: Start difference. First operand 104207 states and 153097 transitions. Second operand has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:36:17,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:36:17,606 INFO L93 Difference]: Finished difference Result 381485 states and 575377 transitions. [2024-10-12 20:36:17,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:36:17,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2024-10-12 20:36:17,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:36:18,258 INFO L225 Difference]: With dead ends: 381485 [2024-10-12 20:36:18,259 INFO L226 Difference]: Without dead ends: 294753 [2024-10-12 20:36:18,328 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:36:18,329 INFO L432 NwaCegarLoop]: 927 mSDtfsCounter, 1227 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:36:18,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 2463 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:36:18,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294753 states. [2024-10-12 20:36:21,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294753 to 181463. [2024-10-12 20:36:21,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181463 states, 181462 states have (on average 1.479521883369521) internal successors, (268477), 181462 states have internal predecessors, (268477), 0 states have call successors, (0), 0 states 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:36:21,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181463 states to 181463 states and 268477 transitions. [2024-10-12 20:36:21,871 INFO L78 Accepts]: Start accepts. Automaton has 181463 states and 268477 transitions. Word has length 181 [2024-10-12 20:36:21,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:36:21,872 INFO L471 AbstractCegarLoop]: Abstraction has 181463 states and 268477 transitions. [2024-10-12 20:36:21,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:36:21,872 INFO L276 IsEmpty]: Start isEmpty. Operand 181463 states and 268477 transitions. [2024-10-12 20:36:21,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-12 20:36:21,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:36:21,887 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:21,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-12 20:36:21,887 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:36:21,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:36:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1747339126, now seen corresponding path program 1 times [2024-10-12 20:36:21,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:36:21,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378220709] [2024-10-12 20:36:21,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:36:21,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:36:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:36:23,165 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:36:23,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:36:23,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378220709] [2024-10-12 20:36:23,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378220709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:36:23,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:36:23,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:36:23,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921980649] [2024-10-12 20:36:23,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:36:23,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:36:23,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:36:23,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:36:23,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:36:23,170 INFO L87 Difference]: Start difference. First operand 181463 states and 268477 transitions. Second operand has 9 states, 9 states have (on average 20.11111111111111) internal successors, (181), 8 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:36:26,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:36:26,496 INFO L93 Difference]: Finished difference Result 757044 states and 1115342 transitions. [2024-10-12 20:36:26,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:36:26,497 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.11111111111111) internal successors, (181), 8 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2024-10-12 20:36:26,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:36:27,893 INFO L225 Difference]: With dead ends: 757044 [2024-10-12 20:36:27,893 INFO L226 Difference]: Without dead ends: 634318 [2024-10-12 20:36:28,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2024-10-12 20:36:28,124 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 4147 mSDsluCounter, 2123 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4147 SdHoareTripleChecker+Valid, 2597 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:36:28,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4147 Valid, 2597 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:36:28,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634318 states.