./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.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 65b8d16e4fb153ef37dd57c64863e1dd20ac9a55503c1fdc63aa83fadd0f6c16 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:38:49,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:38:49,360 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:38:49,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:38:49,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:38:49,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:38:49,389 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:38:49,389 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:38:49,390 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:38:49,390 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:38:49,390 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:38:49,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:38:49,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:38:49,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:38:49,392 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:38:49,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:38:49,393 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:38:49,393 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:38:49,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:38:49,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:38:49,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:38:49,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:38:49,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:38:49,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:38:49,396 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:38:49,396 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:38:49,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:38:49,397 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:38:49,397 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:38:49,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:38:49,398 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:38:49,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:38:49,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:38:49,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:38:49,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:38:49,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:38:49,400 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:38:49,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:38:49,401 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:38:49,401 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:38:49,401 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:38:49,418 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:38:49,420 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 -> 65b8d16e4fb153ef37dd57c64863e1dd20ac9a55503c1fdc63aa83fadd0f6c16 [2024-11-11 21:38:49,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:38:49,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:38:49,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:38:49,699 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:38:49,700 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:38:49,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-11-11 21:38:51,272 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:38:51,545 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:38:51,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-11-11 21:38:51,557 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff3f077f4/80cd87f4f5494a27b7eff55e8aa73402/FLAGb8fcbbeec [2024-11-11 21:38:51,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff3f077f4/80cd87f4f5494a27b7eff55e8aa73402 [2024-11-11 21:38:51,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:38:51,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:38:51,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:38:51,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:38:51,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:38:51,583 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:38:51" (1/1) ... [2024-11-11 21:38:51,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237afa37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:51, skipping insertion in model container [2024-11-11 21:38:51,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:38:51" (1/1) ... [2024-11-11 21:38:51,633 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:38:51,885 WARN L250 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_lcr.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7182,7195] [2024-11-11 21:38:51,904 WARN L250 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_lcr.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[9513,9526] [2024-11-11 21:38:51,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:38:51,936 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:38:51,987 WARN L250 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_lcr.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7182,7195] [2024-11-11 21:38:52,007 WARN L250 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_lcr.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[9513,9526] [2024-11-11 21:38:52,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:38:52,054 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:38:52,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:52 WrapperNode [2024-11-11 21:38:52,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:38:52,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:38:52,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:38:52,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:38:52,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:52" (1/1) ... [2024-11-11 21:38:52,081 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:52" (1/1) ... [2024-11-11 21:38:52,126 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 507 [2024-11-11 21:38:52,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:38:52,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:38:52,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:38:52,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:38:52,138 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:52" (1/1) ... [2024-11-11 21:38:52,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:52" (1/1) ... [2024-11-11 21:38:52,142 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:52" (1/1) ... [2024-11-11 21:38:52,160 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-11-11 21:38:52,161 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:52" (1/1) ... [2024-11-11 21:38:52,161 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:52" (1/1) ... [2024-11-11 21:38:52,169 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:52" (1/1) ... [2024-11-11 21:38:52,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:52" (1/1) ... [2024-11-11 21:38:52,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:52" (1/1) ... [2024-11-11 21:38:52,179 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:52" (1/1) ... [2024-11-11 21:38:52,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:38:52,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:38:52,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:38:52,186 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:38:52,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:52" (1/1) ... [2024-11-11 21:38:52,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:38:52,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:38:52,232 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-11-11 21:38:52,240 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-11-11 21:38:52,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:38:52,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:38:52,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:38:52,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:38:52,443 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:38:52,445 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:38:52,982 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-11-11 21:38:52,982 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:38:53,006 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:38:53,007 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-11 21:38:53,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:38:53 BoogieIcfgContainer [2024-11-11 21:38:53,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:38:53,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:38:53,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:38:53,014 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:38:53,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:38:51" (1/3) ... [2024-11-11 21:38:53,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8ed5b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:38:53, skipping insertion in model container [2024-11-11 21:38:53,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:38:52" (2/3) ... [2024-11-11 21:38:53,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8ed5b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:38:53, skipping insertion in model container [2024-11-11 21:38:53,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:38:53" (3/3) ... [2024-11-11 21:38:53,019 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-11-11 21:38:53,038 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:38:53,039 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 21:38:53,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:38:53,111 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;@7e808858, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:38:53,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 21:38:53,117 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 103 states have (on average 1.7572815533980584) internal successors, (181), 105 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-11-11 21:38:53,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 21:38:53,126 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:53,127 INFO L218 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] [2024-11-11 21:38:53,127 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:53,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:53,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1038847250, now seen corresponding path program 1 times [2024-11-11 21:38:53,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:53,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204118442] [2024-11-11 21:38:53,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:53,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:53,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:38:53,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:53,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204118442] [2024-11-11 21:38:53,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204118442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:53,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:53,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:38:53,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146771707] [2024-11-11 21:38:53,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:53,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:38:53,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:53,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:38:53,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:38:53,747 INFO L87 Difference]: Start difference. First operand has 106 states, 103 states have (on average 1.7572815533980584) internal successors, (181), 105 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) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:54,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:54,039 INFO L93 Difference]: Finished difference Result 416 states and 663 transitions. [2024-11-11 21:38:54,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:38:54,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-11-11 21:38:54,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:54,063 INFO L225 Difference]: With dead ends: 416 [2024-11-11 21:38:54,064 INFO L226 Difference]: Without dead ends: 353 [2024-11-11 21:38:54,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:38:54,070 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 596 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:54,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 768 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:38:54,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-11 21:38:54,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 155. [2024-11-11 21:38:54,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 153 states have (on average 1.4313725490196079) internal successors, (219), 154 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 219 transitions. [2024-11-11 21:38:54,119 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 219 transitions. Word has length 48 [2024-11-11 21:38:54,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:54,120 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 219 transitions. [2024-11-11 21:38:54,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:54,121 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 219 transitions. [2024-11-11 21:38:54,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-11 21:38:54,123 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:54,123 INFO L218 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] [2024-11-11 21:38:54,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:38:54,124 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:54,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:54,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1964840261, now seen corresponding path program 1 times [2024-11-11 21:38:54,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:54,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496466269] [2024-11-11 21:38:54,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:54,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:38:54,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:54,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496466269] [2024-11-11 21:38:54,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496466269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:54,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:54,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:38:54,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627908589] [2024-11-11 21:38:54,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:54,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:38:54,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:54,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:38:54,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:38:54,299 INFO L87 Difference]: Start difference. First operand 155 states and 219 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:54,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:54,359 INFO L93 Difference]: Finished difference Result 244 states and 352 transitions. [2024-11-11 21:38:54,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:38:54,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-11-11 21:38:54,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:54,361 INFO L225 Difference]: With dead ends: 244 [2024-11-11 21:38:54,361 INFO L226 Difference]: Without dead ends: 159 [2024-11-11 21:38:54,362 INFO L434 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-11-11 21:38:54,363 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 73 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:54,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 301 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:38:54,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-11 21:38:54,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2024-11-11 21:38:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 156 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:54,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 220 transitions. [2024-11-11 21:38:54,379 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 220 transitions. Word has length 49 [2024-11-11 21:38:54,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:54,379 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 220 transitions. [2024-11-11 21:38:54,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:54,380 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 220 transitions. [2024-11-11 21:38:54,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-11 21:38:54,381 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:54,381 INFO L218 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] [2024-11-11 21:38:54,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:38:54,382 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:54,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:54,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1398279763, now seen corresponding path program 1 times [2024-11-11 21:38:54,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:54,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084287976] [2024-11-11 21:38:54,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:54,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:38:54,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:54,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084287976] [2024-11-11 21:38:54,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084287976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:54,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:54,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:38:54,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033380394] [2024-11-11 21:38:54,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:54,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:38:54,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:54,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:38:54,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:38:54,583 INFO L87 Difference]: Start difference. First operand 157 states and 220 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:54,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:54,687 INFO L93 Difference]: Finished difference Result 470 states and 690 transitions. [2024-11-11 21:38:54,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:38:54,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-11-11 21:38:54,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:54,690 INFO L225 Difference]: With dead ends: 470 [2024-11-11 21:38:54,691 INFO L226 Difference]: Without dead ends: 388 [2024-11-11 21:38:54,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-11 21:38:54,695 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 298 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:54,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 532 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:38:54,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-11 21:38:54,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 248. [2024-11-11 21:38:54,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 246 states have (on average 1.4593495934959348) internal successors, (359), 247 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:54,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 359 transitions. [2024-11-11 21:38:54,713 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 359 transitions. Word has length 50 [2024-11-11 21:38:54,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:54,714 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 359 transitions. [2024-11-11 21:38:54,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:54,714 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 359 transitions. [2024-11-11 21:38:54,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-11 21:38:54,716 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:54,716 INFO L218 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] [2024-11-11 21:38:54,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:38:54,716 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:54,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:54,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1526101883, now seen corresponding path program 1 times [2024-11-11 21:38:54,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:54,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189910843] [2024-11-11 21:38:54,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:54,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:54,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:38:54,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:54,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189910843] [2024-11-11 21:38:54,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189910843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:54,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:54,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:38:54,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443531295] [2024-11-11 21:38:54,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:54,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:38:54,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:54,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:38:54,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:38:54,887 INFO L87 Difference]: Start difference. First operand 248 states and 359 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:54,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:54,987 INFO L93 Difference]: Finished difference Result 556 states and 821 transitions. [2024-11-11 21:38:54,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:38:54,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-11-11 21:38:54,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:54,989 INFO L225 Difference]: With dead ends: 556 [2024-11-11 21:38:54,990 INFO L226 Difference]: Without dead ends: 474 [2024-11-11 21:38:54,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-11 21:38:54,993 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 356 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:54,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 537 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:38:54,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-11-11 21:38:55,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 376. [2024-11-11 21:38:55,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 374 states have (on average 1.4786096256684491) internal successors, (553), 375 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:55,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 553 transitions. [2024-11-11 21:38:55,023 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 553 transitions. Word has length 50 [2024-11-11 21:38:55,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:55,023 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 553 transitions. [2024-11-11 21:38:55,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:55,023 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 553 transitions. [2024-11-11 21:38:55,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-11 21:38:55,026 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:55,028 INFO L218 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] [2024-11-11 21:38:55,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:38:55,028 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:55,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:55,029 INFO L85 PathProgramCache]: Analyzing trace with hash 2031133031, now seen corresponding path program 1 times [2024-11-11 21:38:55,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:55,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351162802] [2024-11-11 21:38:55,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:55,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:55,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:38:55,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:55,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351162802] [2024-11-11 21:38:55,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351162802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:55,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:55,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:38:55,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464029595] [2024-11-11 21:38:55,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:55,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:38:55,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:55,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:38:55,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:38:55,185 INFO L87 Difference]: Start difference. First operand 376 states and 553 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:55,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:55,279 INFO L93 Difference]: Finished difference Result 647 states and 960 transitions. [2024-11-11 21:38:55,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:38:55,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-11-11 21:38:55,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:55,283 INFO L225 Difference]: With dead ends: 647 [2024-11-11 21:38:55,283 INFO L226 Difference]: Without dead ends: 565 [2024-11-11 21:38:55,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-11 21:38:55,287 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 361 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:55,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 550 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:38:55,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-11 21:38:55,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 467. [2024-11-11 21:38:55,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 465 states have (on average 1.4881720430107528) internal successors, (692), 466 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:55,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 692 transitions. [2024-11-11 21:38:55,310 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 692 transitions. Word has length 50 [2024-11-11 21:38:55,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:55,311 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 692 transitions. [2024-11-11 21:38:55,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:55,312 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 692 transitions. [2024-11-11 21:38:55,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 21:38:55,313 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:55,313 INFO L218 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] [2024-11-11 21:38:55,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:38:55,313 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:55,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:55,314 INFO L85 PathProgramCache]: Analyzing trace with hash 222346276, now seen corresponding path program 1 times [2024-11-11 21:38:55,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:55,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289849329] [2024-11-11 21:38:55,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:55,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:55,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:38:55,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:55,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289849329] [2024-11-11 21:38:55,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289849329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:55,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:55,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:38:55,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79261068] [2024-11-11 21:38:55,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:55,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:38:55,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:55,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:38:55,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:38:55,474 INFO L87 Difference]: Start difference. First operand 467 states and 692 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:55,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:55,627 INFO L93 Difference]: Finished difference Result 1315 states and 1973 transitions. [2024-11-11 21:38:55,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:38:55,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-11-11 21:38:55,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:55,634 INFO L225 Difference]: With dead ends: 1315 [2024-11-11 21:38:55,634 INFO L226 Difference]: Without dead ends: 871 [2024-11-11 21:38:55,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:38:55,637 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 560 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:55,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 133 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:38:55,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-11-11 21:38:55,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 866. [2024-11-11 21:38:55,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 864 states have (on average 1.4953703703703705) internal successors, (1292), 865 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1292 transitions. [2024-11-11 21:38:55,666 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1292 transitions. Word has length 51 [2024-11-11 21:38:55,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:55,666 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1292 transitions. [2024-11-11 21:38:55,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1292 transitions. [2024-11-11 21:38:55,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 21:38:55,668 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:55,668 INFO L218 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] [2024-11-11 21:38:55,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:38:55,669 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:55,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:55,669 INFO L85 PathProgramCache]: Analyzing trace with hash 323435980, now seen corresponding path program 1 times [2024-11-11 21:38:55,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:55,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604038324] [2024-11-11 21:38:55,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:55,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:55,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:38:55,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:55,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604038324] [2024-11-11 21:38:55,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604038324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:55,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:55,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:38:55,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605765631] [2024-11-11 21:38:55,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:55,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:38:55,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:55,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:38:55,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:38:55,808 INFO L87 Difference]: Start difference. First operand 866 states and 1292 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:55,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:55,918 INFO L93 Difference]: Finished difference Result 1705 states and 2556 transitions. [2024-11-11 21:38:55,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:38:55,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-11-11 21:38:55,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:55,923 INFO L225 Difference]: With dead ends: 1705 [2024-11-11 21:38:55,923 INFO L226 Difference]: Without dead ends: 866 [2024-11-11 21:38:55,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:38:55,925 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 365 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:55,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 88 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:38:55,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2024-11-11 21:38:55,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2024-11-11 21:38:55,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 864 states have (on average 1.4733796296296295) internal successors, (1273), 865 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:55,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1273 transitions. [2024-11-11 21:38:55,949 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1273 transitions. Word has length 52 [2024-11-11 21:38:55,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:55,950 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1273 transitions. [2024-11-11 21:38:55,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:55,951 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1273 transitions. [2024-11-11 21:38:55,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-11 21:38:55,952 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:55,952 INFO L218 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] [2024-11-11 21:38:55,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:38:55,952 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:55,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:55,953 INFO L85 PathProgramCache]: Analyzing trace with hash 549255064, now seen corresponding path program 1 times [2024-11-11 21:38:55,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:55,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374480608] [2024-11-11 21:38:55,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:55,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:38:56,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:56,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374480608] [2024-11-11 21:38:56,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374480608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:56,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:56,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:38:56,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228249846] [2024-11-11 21:38:56,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:56,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:38:56,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:56,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:38:56,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:38:56,098 INFO L87 Difference]: Start difference. First operand 866 states and 1273 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:56,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:56,208 INFO L93 Difference]: Finished difference Result 1701 states and 2514 transitions. [2024-11-11 21:38:56,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:38:56,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-11-11 21:38:56,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:56,212 INFO L225 Difference]: With dead ends: 1701 [2024-11-11 21:38:56,212 INFO L226 Difference]: Without dead ends: 866 [2024-11-11 21:38:56,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:38:56,215 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 347 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:56,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 96 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:38:56,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2024-11-11 21:38:56,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2024-11-11 21:38:56,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 864 states have (on average 1.4513888888888888) internal successors, (1254), 865 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:56,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1254 transitions. [2024-11-11 21:38:56,235 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1254 transitions. Word has length 53 [2024-11-11 21:38:56,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:56,236 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1254 transitions. [2024-11-11 21:38:56,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:56,236 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1254 transitions. [2024-11-11 21:38:56,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 21:38:56,237 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:56,237 INFO L218 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] [2024-11-11 21:38:56,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:38:56,238 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:56,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:56,238 INFO L85 PathProgramCache]: Analyzing trace with hash -680909608, now seen corresponding path program 1 times [2024-11-11 21:38:56,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:56,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51544317] [2024-11-11 21:38:56,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:56,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:38:56,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:56,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51544317] [2024-11-11 21:38:56,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51544317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:56,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:56,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:38:56,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419024743] [2024-11-11 21:38:56,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:56,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:38:56,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:56,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:38:56,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:38:56,565 INFO L87 Difference]: Start difference. First operand 866 states and 1254 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:56,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:56,858 INFO L93 Difference]: Finished difference Result 2391 states and 3495 transitions. [2024-11-11 21:38:56,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 21:38:56,859 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-11-11 21:38:56,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:56,866 INFO L225 Difference]: With dead ends: 2391 [2024-11-11 21:38:56,866 INFO L226 Difference]: Without dead ends: 1627 [2024-11-11 21:38:56,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-11 21:38:56,870 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 313 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:56,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 324 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:38:56,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2024-11-11 21:38:56,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 866. [2024-11-11 21:38:56,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 864 states have (on average 1.4502314814814814) internal successors, (1253), 865 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:56,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1253 transitions. [2024-11-11 21:38:56,902 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1253 transitions. Word has length 54 [2024-11-11 21:38:56,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:56,902 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1253 transitions. [2024-11-11 21:38:56,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:56,902 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1253 transitions. [2024-11-11 21:38:56,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 21:38:56,903 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:56,903 INFO L218 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] [2024-11-11 21:38:56,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:38:56,904 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:56,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:56,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1757672516, now seen corresponding path program 1 times [2024-11-11 21:38:56,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:56,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249411672] [2024-11-11 21:38:56,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:56,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:57,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:38:57,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:57,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249411672] [2024-11-11 21:38:57,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249411672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:57,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:57,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-11 21:38:57,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288241892] [2024-11-11 21:38:57,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:57,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 21:38:57,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:57,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 21:38:57,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-11 21:38:57,370 INFO L87 Difference]: Start difference. First operand 866 states and 1253 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:57,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:57,911 INFO L93 Difference]: Finished difference Result 2484 states and 3587 transitions. [2024-11-11 21:38:57,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 21:38:57,912 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-11-11 21:38:57,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:57,918 INFO L225 Difference]: With dead ends: 2484 [2024-11-11 21:38:57,918 INFO L226 Difference]: Without dead ends: 1741 [2024-11-11 21:38:57,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2024-11-11 21:38:57,921 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 461 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:57,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 592 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:38:57,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1741 states. [2024-11-11 21:38:57,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1741 to 875. [2024-11-11 21:38:57,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 873 states have (on average 1.445589919816724) internal successors, (1262), 874 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1262 transitions. [2024-11-11 21:38:57,953 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1262 transitions. Word has length 54 [2024-11-11 21:38:57,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:57,953 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1262 transitions. [2024-11-11 21:38:57,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1262 transitions. [2024-11-11 21:38:57,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 21:38:57,954 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:57,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:38:57,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:38:57,954 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:57,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:57,955 INFO L85 PathProgramCache]: Analyzing trace with hash -728953036, now seen corresponding path program 1 times [2024-11-11 21:38:57,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:57,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006991880] [2024-11-11 21:38:57,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:57,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:38:58,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:58,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006991880] [2024-11-11 21:38:58,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006991880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:58,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:58,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 21:38:58,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008403035] [2024-11-11 21:38:58,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:58,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:38:58,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:58,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:38:58,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:38:58,248 INFO L87 Difference]: Start difference. First operand 875 states and 1262 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:58,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:58,683 INFO L93 Difference]: Finished difference Result 2448 states and 3552 transitions. [2024-11-11 21:38:58,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:38:58,684 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-11 21:38:58,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:58,690 INFO L225 Difference]: With dead ends: 2448 [2024-11-11 21:38:58,690 INFO L226 Difference]: Without dead ends: 1687 [2024-11-11 21:38:58,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2024-11-11 21:38:58,693 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 768 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:58,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 366 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:38:58,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2024-11-11 21:38:58,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 866. [2024-11-11 21:38:58,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 864 states have (on average 1.443287037037037) internal successors, (1247), 865 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:58,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1247 transitions. [2024-11-11 21:38:58,721 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1247 transitions. Word has length 55 [2024-11-11 21:38:58,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:58,722 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1247 transitions. [2024-11-11 21:38:58,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:58,722 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1247 transitions. [2024-11-11 21:38:58,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 21:38:58,723 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:58,723 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:38:58,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:38:58,724 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:58,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:58,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2026548830, now seen corresponding path program 1 times [2024-11-11 21:38:58,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:58,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533791689] [2024-11-11 21:38:58,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:58,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:38:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:38:59,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:38:59,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533791689] [2024-11-11 21:38:59,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533791689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:38:59,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:38:59,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 21:38:59,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472661969] [2024-11-11 21:38:59,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:38:59,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:38:59,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:38:59,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:38:59,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:38:59,072 INFO L87 Difference]: Start difference. First operand 866 states and 1247 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:59,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:38:59,528 INFO L93 Difference]: Finished difference Result 1844 states and 2662 transitions. [2024-11-11 21:38:59,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:38:59,529 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-11 21:38:59,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:38:59,533 INFO L225 Difference]: With dead ends: 1844 [2024-11-11 21:38:59,534 INFO L226 Difference]: Without dead ends: 1068 [2024-11-11 21:38:59,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2024-11-11 21:38:59,536 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 583 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:38:59,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 517 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:38:59,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2024-11-11 21:38:59,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 866. [2024-11-11 21:38:59,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 864 states have (on average 1.4398148148148149) internal successors, (1244), 865 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:59,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1244 transitions. [2024-11-11 21:38:59,559 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1244 transitions. Word has length 55 [2024-11-11 21:38:59,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:38:59,559 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1244 transitions. [2024-11-11 21:38:59,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:38:59,560 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1244 transitions. [2024-11-11 21:38:59,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-11 21:38:59,560 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:38:59,560 INFO L218 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] [2024-11-11 21:38:59,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:38:59,561 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:38:59,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:38:59,561 INFO L85 PathProgramCache]: Analyzing trace with hash -2014195720, now seen corresponding path program 1 times [2024-11-11 21:38:59,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:38:59,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231128383] [2024-11-11 21:38:59,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:38:59,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:38:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:39:00,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:39:00,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:39:00,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231128383] [2024-11-11 21:39:00,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231128383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:39:00,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:39:00,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 21:39:00,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993380666] [2024-11-11 21:39:00,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:39:00,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:39:00,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:39:00,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:39:00,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:39:00,153 INFO L87 Difference]: Start difference. First operand 866 states and 1244 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:00,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:39:00,665 INFO L93 Difference]: Finished difference Result 1946 states and 2833 transitions. [2024-11-11 21:39:00,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:39:00,666 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-11-11 21:39:00,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:39:00,672 INFO L225 Difference]: With dead ends: 1946 [2024-11-11 21:39:00,672 INFO L226 Difference]: Without dead ends: 1594 [2024-11-11 21:39:00,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2024-11-11 21:39:00,674 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 524 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:39:00,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 575 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:39:00,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2024-11-11 21:39:00,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 845. [2024-11-11 21:39:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 843 states have (on average 1.4412811387900355) internal successors, (1215), 844 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:00,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1215 transitions. [2024-11-11 21:39:00,703 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1215 transitions. Word has length 56 [2024-11-11 21:39:00,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:39:00,703 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1215 transitions. [2024-11-11 21:39:00,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:00,704 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1215 transitions. [2024-11-11 21:39:00,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-11 21:39:00,704 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:39:00,704 INFO L218 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] [2024-11-11 21:39:00,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:39:00,705 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:39:00,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:39:00,705 INFO L85 PathProgramCache]: Analyzing trace with hash 929811098, now seen corresponding path program 1 times [2024-11-11 21:39:00,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:39:00,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178405780] [2024-11-11 21:39:00,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:39:00,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:39:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:39:01,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-11-11 21:39:01,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:39:01,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178405780] [2024-11-11 21:39:01,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178405780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:39:01,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:39:01,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-11 21:39:01,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511908448] [2024-11-11 21:39:01,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:39:01,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-11 21:39:01,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:39:01,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-11 21:39:01,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2024-11-11 21:39:01,778 INFO L87 Difference]: Start difference. First operand 845 states and 1215 transitions. Second operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:02,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:39:02,995 INFO L93 Difference]: Finished difference Result 1176 states and 1703 transitions. [2024-11-11 21:39:02,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 21:39:02,996 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-11-11 21:39:02,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:39:02,999 INFO L225 Difference]: With dead ends: 1176 [2024-11-11 21:39:02,999 INFO L226 Difference]: Without dead ends: 839 [2024-11-11 21:39:03,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=288, Invalid=1272, Unknown=0, NotChecked=0, Total=1560 [2024-11-11 21:39:03,001 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 409 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:39:03,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1141 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:39:03,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2024-11-11 21:39:03,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 839. [2024-11-11 21:39:03,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 837 states have (on average 1.4396654719235364) internal successors, (1205), 838 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:03,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1205 transitions. [2024-11-11 21:39:03,020 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1205 transitions. Word has length 56 [2024-11-11 21:39:03,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:39:03,020 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1205 transitions. [2024-11-11 21:39:03,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:03,021 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1205 transitions. [2024-11-11 21:39:03,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-11 21:39:03,021 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:39:03,021 INFO L218 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] [2024-11-11 21:39:03,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:39:03,022 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:39:03,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:39:03,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1026982439, now seen corresponding path program 1 times [2024-11-11 21:39:03,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:39:03,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123261908] [2024-11-11 21:39:03,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:39:03,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:39:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:39:03,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:39:03,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:39:03,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123261908] [2024-11-11 21:39:03,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123261908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:39:03,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:39:03,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-11 21:39:03,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039597927] [2024-11-11 21:39:03,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:39:03,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 21:39:03,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:39:03,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 21:39:03,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:39:03,633 INFO L87 Difference]: Start difference. First operand 839 states and 1205 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:04,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:39:04,292 INFO L93 Difference]: Finished difference Result 1908 states and 2784 transitions. [2024-11-11 21:39:04,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 21:39:04,293 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-11-11 21:39:04,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:39:04,299 INFO L225 Difference]: With dead ends: 1908 [2024-11-11 21:39:04,299 INFO L226 Difference]: Without dead ends: 1565 [2024-11-11 21:39:04,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-11-11 21:39:04,301 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 564 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:39:04,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1022 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:39:04,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2024-11-11 21:39:04,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 821. [2024-11-11 21:39:04,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 819 states have (on average 1.4407814407814408) internal successors, (1180), 820 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:04,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1180 transitions. [2024-11-11 21:39:04,322 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1180 transitions. Word has length 56 [2024-11-11 21:39:04,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:39:04,323 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1180 transitions. [2024-11-11 21:39:04,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:04,323 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1180 transitions. [2024-11-11 21:39:04,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-11 21:39:04,323 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:39:04,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:39:04,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:39:04,324 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:39:04,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:39:04,324 INFO L85 PathProgramCache]: Analyzing trace with hash 788720349, now seen corresponding path program 1 times [2024-11-11 21:39:04,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:39:04,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300157481] [2024-11-11 21:39:04,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:39:04,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:39:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:39:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:39:04,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:39:04,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300157481] [2024-11-11 21:39:04,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300157481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:39:04,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:39:04,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-11 21:39:04,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524180061] [2024-11-11 21:39:04,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:39:04,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 21:39:04,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:39:04,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 21:39:04,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:39:04,929 INFO L87 Difference]: Start difference. First operand 821 states and 1180 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:05,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:39:05,474 INFO L93 Difference]: Finished difference Result 1143 states and 1659 transitions. [2024-11-11 21:39:05,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:39:05,475 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-11 21:39:05,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:39:05,478 INFO L225 Difference]: With dead ends: 1143 [2024-11-11 21:39:05,478 INFO L226 Difference]: Without dead ends: 796 [2024-11-11 21:39:05,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2024-11-11 21:39:05,480 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 315 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:39:05,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 768 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:39:05,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2024-11-11 21:39:05,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 796. [2024-11-11 21:39:05,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 795 states have (on average 1.4477987421383647) internal successors, (1151), 795 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:05,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1151 transitions. [2024-11-11 21:39:05,498 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1151 transitions. Word has length 57 [2024-11-11 21:39:05,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:39:05,498 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1151 transitions. [2024-11-11 21:39:05,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:05,499 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1151 transitions. [2024-11-11 21:39:05,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-11 21:39:05,500 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:39:05,500 INFO L218 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] [2024-11-11 21:39:05,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:39:05,501 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:39:05,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:39:05,501 INFO L85 PathProgramCache]: Analyzing trace with hash -773234718, now seen corresponding path program 1 times [2024-11-11 21:39:05,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:39:05,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776519726] [2024-11-11 21:39:05,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:39:05,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:39:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:39:05,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:39:05,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:39:05,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776519726] [2024-11-11 21:39:05,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776519726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:39:05,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:39:05,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:39:05,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345529654] [2024-11-11 21:39:05,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:39:05,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:39:05,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:39:05,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:39:05,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:39:05,559 INFO L87 Difference]: Start difference. First operand 796 states and 1151 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:05,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:39:05,588 INFO L93 Difference]: Finished difference Result 2124 states and 3101 transitions. [2024-11-11 21:39:05,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:39:05,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-11-11 21:39:05,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:39:05,610 INFO L225 Difference]: With dead ends: 2124 [2024-11-11 21:39:05,610 INFO L226 Difference]: Without dead ends: 1402 [2024-11-11 21:39:05,612 INFO L434 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-11-11 21:39:05,612 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 50 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:39:05,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 279 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:39:05,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2024-11-11 21:39:05,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1400. [2024-11-11 21:39:05,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1399 states have (on average 1.4238741958541816) internal successors, (1992), 1399 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1992 transitions. [2024-11-11 21:39:05,637 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1992 transitions. Word has length 76 [2024-11-11 21:39:05,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:39:05,638 INFO L471 AbstractCegarLoop]: Abstraction has 1400 states and 1992 transitions. [2024-11-11 21:39:05,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:05,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1992 transitions. [2024-11-11 21:39:05,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 21:39:05,639 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:39:05,639 INFO L218 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] [2024-11-11 21:39:05,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 21:39:05,640 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:39:05,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:39:05,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2013626748, now seen corresponding path program 1 times [2024-11-11 21:39:05,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:39:05,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490136694] [2024-11-11 21:39:05,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:39:05,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:39:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:39:05,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:39:05,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:39:05,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490136694] [2024-11-11 21:39:05,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490136694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:39:05,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:39:05,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:39:05,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146531880] [2024-11-11 21:39:05,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:39:05,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:39:05,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:39:05,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:39:05,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:39:05,752 INFO L87 Difference]: Start difference. First operand 1400 states and 1992 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:05,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:39:05,777 INFO L93 Difference]: Finished difference Result 3566 states and 5096 transitions. [2024-11-11 21:39:05,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:39:05,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-11 21:39:05,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:39:05,785 INFO L225 Difference]: With dead ends: 3566 [2024-11-11 21:39:05,785 INFO L226 Difference]: Without dead ends: 2240 [2024-11-11 21:39:05,788 INFO L434 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-11-11 21:39:05,788 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 56 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:39:05,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 265 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:39:05,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2024-11-11 21:39:05,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 2094. [2024-11-11 21:39:05,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2094 states, 2093 states have (on average 1.4085045389393216) internal successors, (2948), 2093 states have internal predecessors, (2948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:05,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 2948 transitions. [2024-11-11 21:39:05,832 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 2948 transitions. Word has length 77 [2024-11-11 21:39:05,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:39:05,833 INFO L471 AbstractCegarLoop]: Abstraction has 2094 states and 2948 transitions. [2024-11-11 21:39:05,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:05,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 2948 transitions. [2024-11-11 21:39:05,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 21:39:05,834 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:39:05,834 INFO L218 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] [2024-11-11 21:39:05,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 21:39:05,834 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:39:05,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:39:05,835 INFO L85 PathProgramCache]: Analyzing trace with hash 31132410, now seen corresponding path program 1 times [2024-11-11 21:39:05,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:39:05,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6288844] [2024-11-11 21:39:05,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:39:05,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:39:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:39:05,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:39:05,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:39:05,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6288844] [2024-11-11 21:39:05,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6288844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:39:05,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:39:05,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:39:05,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227069676] [2024-11-11 21:39:05,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:39:05,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:39:05,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:39:05,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:39:05,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:39:05,932 INFO L87 Difference]: Start difference. First operand 2094 states and 2948 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:05,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:39:05,963 INFO L93 Difference]: Finished difference Result 5918 states and 8308 transitions. [2024-11-11 21:39:05,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:39:05,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-11-11 21:39:05,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:39:05,977 INFO L225 Difference]: With dead ends: 5918 [2024-11-11 21:39:05,977 INFO L226 Difference]: Without dead ends: 3898 [2024-11-11 21:39:05,982 INFO L434 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-11-11 21:39:05,982 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 49 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:39:05,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 263 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:39:05,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3898 states. [2024-11-11 21:39:06,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3898 to 3680. [2024-11-11 21:39:06,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3680 states, 3679 states have (on average 1.3900516444686055) internal successors, (5114), 3679 states have internal predecessors, (5114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 5114 transitions. [2024-11-11 21:39:06,058 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 5114 transitions. Word has length 78 [2024-11-11 21:39:06,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:39:06,058 INFO L471 AbstractCegarLoop]: Abstraction has 3680 states and 5114 transitions. [2024-11-11 21:39:06,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:06,058 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 5114 transitions. [2024-11-11 21:39:06,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 21:39:06,060 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:39:06,061 INFO L218 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] [2024-11-11 21:39:06,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 21:39:06,062 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:39:06,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:39:06,062 INFO L85 PathProgramCache]: Analyzing trace with hash 769651115, now seen corresponding path program 1 times [2024-11-11 21:39:06,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:39:06,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189472537] [2024-11-11 21:39:06,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:39:06,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:39:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:39:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:39:06,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:39:06,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189472537] [2024-11-11 21:39:06,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189472537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:39:06,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:39:06,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:39:06,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714041290] [2024-11-11 21:39:06,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:39:06,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:39:06,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:39:06,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:39:06,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:39:06,199 INFO L87 Difference]: Start difference. First operand 3680 states and 5114 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:06,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:39:06,247 INFO L93 Difference]: Finished difference Result 10460 states and 14428 transitions. [2024-11-11 21:39:06,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:39:06,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-11 21:39:06,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:39:06,279 INFO L225 Difference]: With dead ends: 10460 [2024-11-11 21:39:06,283 INFO L226 Difference]: Without dead ends: 6854 [2024-11-11 21:39:06,292 INFO L434 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-11-11 21:39:06,293 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 42 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:39:06,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 260 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:39:06,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6854 states. [2024-11-11 21:39:06,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6854 to 6420. [2024-11-11 21:39:06,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6420 states, 6419 states have (on average 1.3622059510827231) internal successors, (8744), 6419 states have internal predecessors, (8744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:06,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6420 states to 6420 states and 8744 transitions. [2024-11-11 21:39:06,417 INFO L78 Accepts]: Start accepts. Automaton has 6420 states and 8744 transitions. Word has length 79 [2024-11-11 21:39:06,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:39:06,417 INFO L471 AbstractCegarLoop]: Abstraction has 6420 states and 8744 transitions. [2024-11-11 21:39:06,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:06,418 INFO L276 IsEmpty]: Start isEmpty. Operand 6420 states and 8744 transitions. [2024-11-11 21:39:06,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 21:39:06,418 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:39:06,419 INFO L218 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] [2024-11-11 21:39:06,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 21:39:06,419 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:39:06,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:39:06,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1757386099, now seen corresponding path program 1 times [2024-11-11 21:39:06,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:39:06,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471605817] [2024-11-11 21:39:06,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:39:06,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:39:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:39:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:39:06,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:39:06,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471605817] [2024-11-11 21:39:06,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471605817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:39:06,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:39:06,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:39:06,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024048629] [2024-11-11 21:39:06,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:39:06,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:39:06,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:39:06,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:39:06,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:39:06,658 INFO L87 Difference]: Start difference. First operand 6420 states and 8744 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:06,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:39:06,748 INFO L93 Difference]: Finished difference Result 6614 states and 9001 transitions. [2024-11-11 21:39:06,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:39:06,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-11 21:39:06,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:39:06,760 INFO L225 Difference]: With dead ends: 6614 [2024-11-11 21:39:06,761 INFO L226 Difference]: Without dead ends: 6612 [2024-11-11 21:39:06,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:39:06,763 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:39:06,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 584 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:39:06,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6612 states. [2024-11-11 21:39:06,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6612 to 6612. [2024-11-11 21:39:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6612 states, 6611 states have (on average 1.3395855392527605) internal successors, (8856), 6611 states have internal predecessors, (8856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:06,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6612 states to 6612 states and 8856 transitions. [2024-11-11 21:39:06,872 INFO L78 Accepts]: Start accepts. Automaton has 6612 states and 8856 transitions. Word has length 80 [2024-11-11 21:39:06,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:39:06,872 INFO L471 AbstractCegarLoop]: Abstraction has 6612 states and 8856 transitions. [2024-11-11 21:39:06,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:06,873 INFO L276 IsEmpty]: Start isEmpty. Operand 6612 states and 8856 transitions. [2024-11-11 21:39:06,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 21:39:06,873 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:39:06,874 INFO L218 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] [2024-11-11 21:39:06,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 21:39:06,874 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:39:06,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:39:06,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1852306095, now seen corresponding path program 1 times [2024-11-11 21:39:06,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:39:06,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689908436] [2024-11-11 21:39:06,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:39:06,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:39:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:39:06,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:39:06,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:39:06,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689908436] [2024-11-11 21:39:06,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689908436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:39:06,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:39:06,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:39:06,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564901226] [2024-11-11 21:39:06,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:39:06,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:39:06,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:39:06,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:39:06,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:39:06,923 INFO L87 Difference]: Start difference. First operand 6612 states and 8856 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:06,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:39:06,969 INFO L93 Difference]: Finished difference Result 13400 states and 17974 transitions. [2024-11-11 21:39:06,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:39:06,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-11 21:39:06,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:39:06,982 INFO L225 Difference]: With dead ends: 13400 [2024-11-11 21:39:06,983 INFO L226 Difference]: Without dead ends: 6862 [2024-11-11 21:39:06,991 INFO L434 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-11-11 21:39:06,992 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 68 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:39:06,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 210 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:39:06,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6862 states. [2024-11-11 21:39:07,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6862 to 6860. [2024-11-11 21:39:07,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6860 states, 6859 states have (on average 1.3185595567867037) internal successors, (9044), 6859 states have internal predecessors, (9044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:07,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6860 states to 6860 states and 9044 transitions. [2024-11-11 21:39:07,096 INFO L78 Accepts]: Start accepts. Automaton has 6860 states and 9044 transitions. Word has length 80 [2024-11-11 21:39:07,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:39:07,097 INFO L471 AbstractCegarLoop]: Abstraction has 6860 states and 9044 transitions. [2024-11-11 21:39:07,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:07,098 INFO L276 IsEmpty]: Start isEmpty. Operand 6860 states and 9044 transitions. [2024-11-11 21:39:07,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 21:39:07,100 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:39:07,100 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:39:07,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 21:39:07,101 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:39:07,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:39:07,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1815794868, now seen corresponding path program 1 times [2024-11-11 21:39:07,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:39:07,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792555822] [2024-11-11 21:39:07,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:39:07,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:39:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:39:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:39:07,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:39:07,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792555822] [2024-11-11 21:39:07,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792555822] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:39:07,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427673636] [2024-11-11 21:39:07,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:39:07,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:39:07,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:39:07,670 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:39:07,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 21:39:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:39:07,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-11 21:39:07,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:39:08,046 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 21:39:08,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:39:08,499 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 21:39:08,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427673636] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:39:08,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:39:08,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 18 [2024-11-11 21:39:08,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018966460] [2024-11-11 21:39:08,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:39:08,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-11 21:39:08,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:39:08,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-11 21:39:08,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2024-11-11 21:39:08,504 INFO L87 Difference]: Start difference. First operand 6860 states and 9044 transitions. Second operand has 18 states, 18 states have (on average 15.833333333333334) internal successors, (285), 18 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:11,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:39:11,055 INFO L93 Difference]: Finished difference Result 38160 states and 50184 transitions. [2024-11-11 21:39:11,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-11 21:39:11,056 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 15.833333333333334) internal successors, (285), 18 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-11-11 21:39:11,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:39:11,123 INFO L225 Difference]: With dead ends: 38160 [2024-11-11 21:39:11,123 INFO L226 Difference]: Without dead ends: 31374 [2024-11-11 21:39:11,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=752, Invalid=3280, Unknown=0, NotChecked=0, Total=4032 [2024-11-11 21:39:11,147 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 2547 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2547 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 21:39:11,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2547 Valid, 1027 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 21:39:11,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31374 states. [2024-11-11 21:39:11,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31374 to 20352. [2024-11-11 21:39:11,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20352 states, 20351 states have (on average 1.3216058178959265) internal successors, (26896), 20351 states have internal predecessors, (26896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:11,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20352 states to 20352 states and 26896 transitions. [2024-11-11 21:39:11,610 INFO L78 Accepts]: Start accepts. Automaton has 20352 states and 26896 transitions. Word has length 101 [2024-11-11 21:39:11,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:39:11,611 INFO L471 AbstractCegarLoop]: Abstraction has 20352 states and 26896 transitions. [2024-11-11 21:39:11,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 15.833333333333334) internal successors, (285), 18 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:39:11,611 INFO L276 IsEmpty]: Start isEmpty. Operand 20352 states and 26896 transitions. [2024-11-11 21:39:11,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-11 21:39:11,615 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:39:11,615 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:39:11,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 21:39:11,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-11 21:39:11,817 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:39:11,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:39:11,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1244020718, now seen corresponding path program 1 times [2024-11-11 21:39:11,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:39:11,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553718634] [2024-11-11 21:39:11,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:39:11,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:39:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:39:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:39:12,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:39:12,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553718634] [2024-11-11 21:39:12,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553718634] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:39:12,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730700491] [2024-11-11 21:39:12,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:39:12,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:39:12,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:39:12,378 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:39:12,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 21:39:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:39:12,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-11 21:39:12,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:39:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:39:15,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:39:20,570 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:39:20,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730700491] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:39:20,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:39:20,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 23, 24] total 55 [2024-11-11 21:39:20,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358226760] [2024-11-11 21:39:20,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:39:20,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-11 21:39:20,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:39:20,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-11 21:39:20,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2762, Unknown=0, NotChecked=0, Total=2970 [2024-11-11 21:39:20,575 INFO L87 Difference]: Start difference. First operand 20352 states and 26896 transitions. Second operand has 55 states, 55 states have (on average 5.181818181818182) internal successors, (285), 55 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)