./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b8cc349a19a972b0be64ea80cb0d8ffd687af01d6d76bd436b271bb666f9a3a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:32:43,068 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:32:43,138 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:32:43,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:32:43,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:32:43,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:32:43,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:32:43,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:32:43,175 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:32:43,175 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:32:43,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:32:43,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:32:43,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:32:43,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:32:43,178 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:32:43,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:32:43,179 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:32:43,179 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:32:43,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:32:43,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:32:43,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:32:43,184 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:32:43,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:32:43,185 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:32:43,185 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:32:43,186 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:32:43,186 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:32:43,186 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:32:43,186 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:32:43,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:32:43,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:32:43,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:32:43,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:32:43,188 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:32:43,189 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:32:43,189 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:32:43,189 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:32:43,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:32:43,190 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:32:43,190 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:32:43,190 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:32:43,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:32:43,191 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 -> 2b8cc349a19a972b0be64ea80cb0d8ffd687af01d6d76bd436b271bb666f9a3a [2024-10-12 20:32:43,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:32:43,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:32:43,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:32:43,464 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:32:43,465 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:32:43,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2024-10-12 20:32:44,925 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:32:45,152 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:32:45,153 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2024-10-12 20:32:45,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43727543e/e1370f702c844f66a91f67f76a5d8cc6/FLAG7e2782973 [2024-10-12 20:32:45,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43727543e/e1370f702c844f66a91f67f76a5d8cc6 [2024-10-12 20:32:45,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:32:45,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:32:45,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:32:45,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:32:45,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:32:45,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:32:45" (1/1) ... [2024-10-12 20:32:45,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b2b972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:45, skipping insertion in model container [2024-10-12 20:32:45,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:32:45" (1/1) ... [2024-10-12 20:32:45,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:32:45,511 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c[7631,7644] [2024-10-12 20:32:45,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:32:45,624 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:32:45,678 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c[7631,7644] [2024-10-12 20:32:45,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:32:45,720 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:32:45,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:45 WrapperNode [2024-10-12 20:32:45,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:32:45,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:32:45,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:32:45,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:32:45,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:45" (1/1) ... [2024-10-12 20:32:45,737 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:45" (1/1) ... [2024-10-12 20:32:45,772 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 629 [2024-10-12 20:32:45,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:32:45,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:32:45,774 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:32:45,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:32:45,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:45" (1/1) ... [2024-10-12 20:32:45,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:45" (1/1) ... [2024-10-12 20:32:45,793 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:45" (1/1) ... [2024-10-12 20:32:45,809 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 20:32:45,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:45" (1/1) ... [2024-10-12 20:32:45,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:45" (1/1) ... [2024-10-12 20:32:45,823 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:45" (1/1) ... [2024-10-12 20:32:45,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:45" (1/1) ... [2024-10-12 20:32:45,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:45" (1/1) ... [2024-10-12 20:32:45,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:45" (1/1) ... [2024-10-12 20:32:45,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:32:45,844 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:32:45,845 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:32:45,845 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:32:45,846 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:45" (1/1) ... [2024-10-12 20:32:45,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:32:45,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:32:45,878 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:32:45,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:32:45,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:32:45,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:32:45,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:32:45,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:32:46,071 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:32:46,073 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:32:46,616 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-10-12 20:32:46,616 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:32:46,671 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:32:46,671 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:32:46,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:32:46 BoogieIcfgContainer [2024-10-12 20:32:46,672 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:32:46,675 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:32:46,675 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:32:46,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:32:46,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:32:45" (1/3) ... [2024-10-12 20:32:46,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5457822b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:32:46, skipping insertion in model container [2024-10-12 20:32:46,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:45" (2/3) ... [2024-10-12 20:32:46,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5457822b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:32:46, skipping insertion in model container [2024-10-12 20:32:46,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:32:46" (3/3) ... [2024-10-12 20:32:46,683 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2024-10-12 20:32:46,700 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:32:46,700 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:32:46,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:32:46,783 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;@3c06fb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:32:46,785 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:32:46,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 132 states have (on average 1.7651515151515151) internal successors, (233), 133 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:46,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 20:32:46,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:46,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:46,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:32:46,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:46,811 INFO L85 PathProgramCache]: Analyzing trace with hash 555090615, now seen corresponding path program 1 times [2024-10-12 20:32:46,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:46,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833814871] [2024-10-12 20:32:46,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:46,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:47,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:47,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:47,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833814871] [2024-10-12 20:32:47,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833814871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:47,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:47,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:32:47,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008901854] [2024-10-12 20:32:47,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:47,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:32:47,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:47,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:32:47,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:32:47,403 INFO L87 Difference]: Start difference. First operand has 134 states, 132 states have (on average 1.7651515151515151) internal successors, (233), 133 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:47,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:47,469 INFO L93 Difference]: Finished difference Result 290 states and 480 transitions. [2024-10-12 20:32:47,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:32:47,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-10-12 20:32:47,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:47,483 INFO L225 Difference]: With dead ends: 290 [2024-10-12 20:32:47,483 INFO L226 Difference]: Without dead ends: 204 [2024-10-12 20:32:47,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:32:47,489 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 165 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 467 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-10-12 20:32:47,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 467 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:32:47,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-12 20:32:47,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2024-10-12 20:32:47,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 1.4477611940298507) internal successors, (291), 201 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:47,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 291 transitions. [2024-10-12 20:32:47,550 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 291 transitions. Word has length 85 [2024-10-12 20:32:47,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:47,551 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 291 transitions. [2024-10-12 20:32:47,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:47,551 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 291 transitions. [2024-10-12 20:32:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 20:32:47,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:47,554 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:47,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:32:47,554 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:32:47,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:47,555 INFO L85 PathProgramCache]: Analyzing trace with hash 2129284340, now seen corresponding path program 1 times [2024-10-12 20:32:47,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:47,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708197259] [2024-10-12 20:32:47,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:47,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:47,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:47,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:47,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708197259] [2024-10-12 20:32:47,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708197259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:47,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:47,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:32:47,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061554847] [2024-10-12 20:32:47,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:47,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:32:47,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:47,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:32:47,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:32:47,720 INFO L87 Difference]: Start difference. First operand 202 states and 291 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:47,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:47,756 INFO L93 Difference]: Finished difference Result 486 states and 743 transitions. [2024-10-12 20:32:47,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:32:47,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-10-12 20:32:47,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:47,759 INFO L225 Difference]: With dead ends: 486 [2024-10-12 20:32:47,759 INFO L226 Difference]: Without dead ends: 336 [2024-10-12 20:32:47,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:32:47,765 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 112 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:47,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 406 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:32:47,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-10-12 20:32:47,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2024-10-12 20:32:47,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 1.5045045045045045) internal successors, (501), 333 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:47,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 501 transitions. [2024-10-12 20:32:47,793 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 501 transitions. Word has length 86 [2024-10-12 20:32:47,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:47,794 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 501 transitions. [2024-10-12 20:32:47,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:47,795 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 501 transitions. [2024-10-12 20:32:47,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 20:32:47,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:47,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:47,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:32:47,798 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:32:47,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:47,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2096979309, now seen corresponding path program 1 times [2024-10-12 20:32:47,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:47,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556576729] [2024-10-12 20:32:47,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:47,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:47,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:47,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:47,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556576729] [2024-10-12 20:32:47,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556576729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:47,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:47,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:32:47,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817065607] [2024-10-12 20:32:47,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:47,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:32:47,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:47,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:32:47,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:32:47,968 INFO L87 Difference]: Start difference. First operand 334 states and 501 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:47,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:47,998 INFO L93 Difference]: Finished difference Result 866 states and 1347 transitions. [2024-10-12 20:32:47,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:32:47,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-10-12 20:32:47,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:48,006 INFO L225 Difference]: With dead ends: 866 [2024-10-12 20:32:48,006 INFO L226 Difference]: Without dead ends: 584 [2024-10-12 20:32:48,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:32:48,008 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 107 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:48,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 402 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:32:48,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-10-12 20:32:48,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 582. [2024-10-12 20:32:48,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 1.5370051635111877) internal successors, (893), 581 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:48,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 893 transitions. [2024-10-12 20:32:48,050 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 893 transitions. Word has length 87 [2024-10-12 20:32:48,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:48,051 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 893 transitions. [2024-10-12 20:32:48,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:48,051 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 893 transitions. [2024-10-12 20:32:48,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-12 20:32:48,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:48,052 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:48,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:32:48,053 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:32:48,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:48,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1649402853, now seen corresponding path program 1 times [2024-10-12 20:32:48,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:48,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124098762] [2024-10-12 20:32:48,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:48,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:48,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:48,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124098762] [2024-10-12 20:32:48,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124098762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:48,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:48,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:32:48,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123597548] [2024-10-12 20:32:48,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:48,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:32:48,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:48,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:32:48,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:32:48,198 INFO L87 Difference]: Start difference. First operand 582 states and 893 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:48,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:48,227 INFO L93 Difference]: Finished difference Result 1578 states and 2471 transitions. [2024-10-12 20:32:48,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:32:48,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-10-12 20:32:48,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:48,235 INFO L225 Difference]: With dead ends: 1578 [2024-10-12 20:32:48,235 INFO L226 Difference]: Without dead ends: 1048 [2024-10-12 20:32:48,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:32:48,239 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 102 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:48,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 398 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:32:48,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2024-10-12 20:32:48,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1046. [2024-10-12 20:32:48,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 1045 states have (on average 1.551196172248804) internal successors, (1621), 1045 states have internal predecessors, (1621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:48,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1621 transitions. [2024-10-12 20:32:48,270 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1621 transitions. Word has length 88 [2024-10-12 20:32:48,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:48,272 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1621 transitions. [2024-10-12 20:32:48,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:48,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1621 transitions. [2024-10-12 20:32:48,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-12 20:32:48,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:48,276 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:48,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:32:48,277 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:32:48,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:48,277 INFO L85 PathProgramCache]: Analyzing trace with hash -2093999040, now seen corresponding path program 1 times [2024-10-12 20:32:48,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:48,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165167568] [2024-10-12 20:32:48,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:48,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:48,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:48,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165167568] [2024-10-12 20:32:48,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165167568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:48,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:48,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:32:48,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78359939] [2024-10-12 20:32:48,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:48,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:32:48,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:48,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:32:48,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:32:48,438 INFO L87 Difference]: Start difference. First operand 1046 states and 1621 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:48,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:48,474 INFO L93 Difference]: Finished difference Result 2906 states and 4551 transitions. [2024-10-12 20:32:48,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:32:48,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-10-12 20:32:48,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:48,484 INFO L225 Difference]: With dead ends: 2906 [2024-10-12 20:32:48,484 INFO L226 Difference]: Without dead ends: 1912 [2024-10-12 20:32:48,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:32:48,487 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 97 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:48,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 394 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:32:48,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2024-10-12 20:32:48,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1910. [2024-10-12 20:32:48,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1910 states, 1909 states have (on average 1.5531691985332634) internal successors, (2965), 1909 states have internal predecessors, (2965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:48,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2965 transitions. [2024-10-12 20:32:48,538 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2965 transitions. Word has length 89 [2024-10-12 20:32:48,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:48,540 INFO L471 AbstractCegarLoop]: Abstraction has 1910 states and 2965 transitions. [2024-10-12 20:32:48,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:48,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2965 transitions. [2024-10-12 20:32:48,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-12 20:32:48,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:48,543 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:48,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:32:48,544 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:32:48,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:48,545 INFO L85 PathProgramCache]: Analyzing trace with hash 999636698, now seen corresponding path program 1 times [2024-10-12 20:32:48,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:48,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108721619] [2024-10-12 20:32:48,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:48,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:48,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:48,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:48,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108721619] [2024-10-12 20:32:48,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108721619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:48,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:48,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:32:48,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494343554] [2024-10-12 20:32:48,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:48,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:32:48,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:48,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:32:48,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:32:48,652 INFO L87 Difference]: Start difference. First operand 1910 states and 2965 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:48,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:48,689 INFO L93 Difference]: Finished difference Result 5370 states and 8375 transitions. [2024-10-12 20:32:48,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:32:48,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-10-12 20:32:48,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:48,705 INFO L225 Difference]: With dead ends: 5370 [2024-10-12 20:32:48,706 INFO L226 Difference]: Without dead ends: 3512 [2024-10-12 20:32:48,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:32:48,710 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 92 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:48,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 390 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:32:48,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3512 states. [2024-10-12 20:32:48,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3512 to 3510. [2024-10-12 20:32:48,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3510 states, 3509 states have (on average 1.5471644343117696) internal successors, (5429), 3509 states have internal predecessors, (5429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:48,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3510 states to 3510 states and 5429 transitions. [2024-10-12 20:32:48,788 INFO L78 Accepts]: Start accepts. Automaton has 3510 states and 5429 transitions. Word has length 90 [2024-10-12 20:32:48,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:48,792 INFO L471 AbstractCegarLoop]: Abstraction has 3510 states and 5429 transitions. [2024-10-12 20:32:48,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:48,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3510 states and 5429 transitions. [2024-10-12 20:32:48,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 20:32:48,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:48,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:48,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:32:48,794 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:32:48,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:48,794 INFO L85 PathProgramCache]: Analyzing trace with hash 335643408, now seen corresponding path program 1 times [2024-10-12 20:32:48,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:48,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596276362] [2024-10-12 20:32:48,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:48,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:48,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:48,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:48,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596276362] [2024-10-12 20:32:48,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596276362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:48,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:48,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:32:48,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037278742] [2024-10-12 20:32:48,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:48,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:32:48,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:48,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:32:48,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:32:48,909 INFO L87 Difference]: Start difference. First operand 3510 states and 5429 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:48,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:48,962 INFO L93 Difference]: Finished difference Result 9914 states and 15351 transitions. [2024-10-12 20:32:48,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:32:48,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-10-12 20:32:48,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:48,984 INFO L225 Difference]: With dead ends: 9914 [2024-10-12 20:32:48,985 INFO L226 Difference]: Without dead ends: 6456 [2024-10-12 20:32:48,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:32:48,992 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 87 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:48,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 386 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:32:48,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6456 states. [2024-10-12 20:32:49,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6456 to 6454. [2024-10-12 20:32:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6454 states, 6453 states have (on average 1.5355648535564854) internal successors, (9909), 6453 states have internal predecessors, (9909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:49,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6454 states to 6454 states and 9909 transitions. [2024-10-12 20:32:49,116 INFO L78 Accepts]: Start accepts. Automaton has 6454 states and 9909 transitions. Word has length 91 [2024-10-12 20:32:49,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:49,116 INFO L471 AbstractCegarLoop]: Abstraction has 6454 states and 9909 transitions. [2024-10-12 20:32:49,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:49,117 INFO L276 IsEmpty]: Start isEmpty. Operand 6454 states and 9909 transitions. [2024-10-12 20:32:49,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 20:32:49,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:49,117 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:49,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:32:49,118 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:32:49,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:49,118 INFO L85 PathProgramCache]: Analyzing trace with hash 426949996, now seen corresponding path program 1 times [2024-10-12 20:32:49,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:49,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825976599] [2024-10-12 20:32:49,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:49,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:49,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:49,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:49,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825976599] [2024-10-12 20:32:49,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825976599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:49,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:49,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:32:49,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744207194] [2024-10-12 20:32:49,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:49,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:32:49,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:49,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:32:49,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:32:49,389 INFO L87 Difference]: Start difference. First operand 6454 states and 9909 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:50,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:50,217 INFO L93 Difference]: Finished difference Result 96082 states and 147907 transitions. [2024-10-12 20:32:50,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:32:50,218 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-12 20:32:50,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:50,545 INFO L225 Difference]: With dead ends: 96082 [2024-10-12 20:32:50,545 INFO L226 Difference]: Without dead ends: 89680 [2024-10-12 20:32:50,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2024-10-12 20:32:50,594 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 2471 mSDsluCounter, 3751 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2471 SdHoareTripleChecker+Valid, 3925 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:50,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2471 Valid, 3925 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:32:50,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89680 states. [2024-10-12 20:32:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89680 to 12854. [2024-10-12 20:32:51,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12854 states, 12853 states have (on average 1.5178557535205788) internal successors, (19509), 12853 states have internal predecessors, (19509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:51,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12854 states to 12854 states and 19509 transitions. [2024-10-12 20:32:51,695 INFO L78 Accepts]: Start accepts. Automaton has 12854 states and 19509 transitions. Word has length 92 [2024-10-12 20:32:51,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:51,696 INFO L471 AbstractCegarLoop]: Abstraction has 12854 states and 19509 transitions. [2024-10-12 20:32:51,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:51,697 INFO L276 IsEmpty]: Start isEmpty. Operand 12854 states and 19509 transitions. [2024-10-12 20:32:51,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:32:51,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:51,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:51,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:32:51,698 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:32:51,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:51,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1355234760, now seen corresponding path program 1 times [2024-10-12 20:32:51,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:51,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088027933] [2024-10-12 20:32:51,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:51,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:51,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:51,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:51,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088027933] [2024-10-12 20:32:51,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088027933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:51,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:51,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:32:51,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791875887] [2024-10-12 20:32:51,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:51,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:32:51,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:51,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:32:51,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:32:51,850 INFO L87 Difference]: Start difference. First operand 12854 states and 19509 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:51,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:51,957 INFO L93 Difference]: Finished difference Result 31868 states and 48377 transitions. [2024-10-12 20:32:51,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:32:51,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-12 20:32:51,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:51,991 INFO L225 Difference]: With dead ends: 31868 [2024-10-12 20:32:51,992 INFO L226 Difference]: Without dead ends: 19066 [2024-10-12 20:32:52,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:32:52,014 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 78 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:52,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 346 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:32:52,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19066 states. [2024-10-12 20:32:52,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19066 to 19064. [2024-10-12 20:32:52,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19064 states, 19063 states have (on average 1.5069506373603316) internal successors, (28727), 19063 states have internal predecessors, (28727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:52,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19064 states to 19064 states and 28727 transitions. [2024-10-12 20:32:52,381 INFO L78 Accepts]: Start accepts. Automaton has 19064 states and 28727 transitions. Word has length 94 [2024-10-12 20:32:52,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:52,381 INFO L471 AbstractCegarLoop]: Abstraction has 19064 states and 28727 transitions. [2024-10-12 20:32:52,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:52,382 INFO L276 IsEmpty]: Start isEmpty. Operand 19064 states and 28727 transitions. [2024-10-12 20:32:52,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:32:52,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:52,383 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:52,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:32:52,383 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:32:52,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:52,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1376237415, now seen corresponding path program 1 times [2024-10-12 20:32:52,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:52,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896925894] [2024-10-12 20:32:52,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:52,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:53,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:53,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:53,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896925894] [2024-10-12 20:32:53,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896925894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:53,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:53,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:32:53,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260447644] [2024-10-12 20:32:53,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:53,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:32:53,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:53,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:32:53,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:32:53,083 INFO L87 Difference]: Start difference. First operand 19064 states and 28727 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:53,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:53,512 INFO L93 Difference]: Finished difference Result 38076 states and 57401 transitions. [2024-10-12 20:32:53,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:32:53,513 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-12 20:32:53,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:53,543 INFO L225 Difference]: With dead ends: 38076 [2024-10-12 20:32:53,544 INFO L226 Difference]: Without dead ends: 19066 [2024-10-12 20:32:53,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-10-12 20:32:53,564 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 218 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:53,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 919 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:32:53,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19066 states. [2024-10-12 20:32:53,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19066 to 19064. [2024-10-12 20:32:53,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19064 states, 19063 states have (on average 1.4968787703929076) internal successors, (28535), 19063 states have internal predecessors, (28535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:53,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19064 states to 19064 states and 28535 transitions. [2024-10-12 20:32:53,871 INFO L78 Accepts]: Start accepts. Automaton has 19064 states and 28535 transitions. Word has length 94 [2024-10-12 20:32:53,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:53,872 INFO L471 AbstractCegarLoop]: Abstraction has 19064 states and 28535 transitions. [2024-10-12 20:32:53,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:53,872 INFO L276 IsEmpty]: Start isEmpty. Operand 19064 states and 28535 transitions. [2024-10-12 20:32:53,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-12 20:32:53,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:53,873 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:53,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:32:53,873 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:32:53,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:53,874 INFO L85 PathProgramCache]: Analyzing trace with hash -288222367, now seen corresponding path program 1 times [2024-10-12 20:32:53,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:53,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287506637] [2024-10-12 20:32:53,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:53,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:54,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:54,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:54,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287506637] [2024-10-12 20:32:54,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287506637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:54,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:54,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:32:54,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702812297] [2024-10-12 20:32:54,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:54,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:54,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:54,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:54,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:54,013 INFO L87 Difference]: Start difference. First operand 19064 states and 28535 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:54,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:54,222 INFO L93 Difference]: Finished difference Result 38074 states and 57016 transitions. [2024-10-12 20:32:54,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:32:54,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-10-12 20:32:54,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:54,253 INFO L225 Difference]: With dead ends: 38074 [2024-10-12 20:32:54,253 INFO L226 Difference]: Without dead ends: 19064 [2024-10-12 20:32:54,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:32:54,279 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 447 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:54,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 129 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:32:54,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19064 states. [2024-10-12 20:32:54,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19064 to 19064. [2024-10-12 20:32:54,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19064 states, 19063 states have (on average 1.4868069034254838) internal successors, (28343), 19063 states have internal predecessors, (28343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:54,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19064 states to 19064 states and 28343 transitions. [2024-10-12 20:32:54,673 INFO L78 Accepts]: Start accepts. Automaton has 19064 states and 28343 transitions. Word has length 95 [2024-10-12 20:32:54,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:54,674 INFO L471 AbstractCegarLoop]: Abstraction has 19064 states and 28343 transitions. [2024-10-12 20:32:54,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:54,674 INFO L276 IsEmpty]: Start isEmpty. Operand 19064 states and 28343 transitions. [2024-10-12 20:32:54,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-12 20:32:54,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:54,675 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:54,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:32:54,676 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:32:54,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:54,676 INFO L85 PathProgramCache]: Analyzing trace with hash 80048860, now seen corresponding path program 1 times [2024-10-12 20:32:54,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:54,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676520432] [2024-10-12 20:32:54,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:54,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:54,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:54,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:54,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676520432] [2024-10-12 20:32:54,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676520432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:54,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:54,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:32:54,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438225706] [2024-10-12 20:32:54,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:54,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:54,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:54,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:54,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:54,939 INFO L87 Difference]: Start difference. First operand 19064 states and 28343 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:55,097 INFO L93 Difference]: Finished difference Result 38074 states and 56632 transitions. [2024-10-12 20:32:55,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:32:55,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-10-12 20:32:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:55,126 INFO L225 Difference]: With dead ends: 38074 [2024-10-12 20:32:55,126 INFO L226 Difference]: Without dead ends: 19064 [2024-10-12 20:32:55,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:32:55,144 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 418 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:55,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 145 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:32:55,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19064 states. [2024-10-12 20:32:55,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19064 to 19064. [2024-10-12 20:32:55,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19064 states, 19063 states have (on average 1.47673503645806) internal successors, (28151), 19063 states have internal predecessors, (28151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19064 states to 19064 states and 28151 transitions. [2024-10-12 20:32:55,479 INFO L78 Accepts]: Start accepts. Automaton has 19064 states and 28151 transitions. Word has length 95 [2024-10-12 20:32:55,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:55,479 INFO L471 AbstractCegarLoop]: Abstraction has 19064 states and 28151 transitions. [2024-10-12 20:32:55,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:55,479 INFO L276 IsEmpty]: Start isEmpty. Operand 19064 states and 28151 transitions. [2024-10-12 20:32:55,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-12 20:32:55,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:55,480 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:55,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:32:55,481 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:32:55,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:55,481 INFO L85 PathProgramCache]: Analyzing trace with hash 208134167, now seen corresponding path program 1 times [2024-10-12 20:32:55,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:55,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653902671] [2024-10-12 20:32:55,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:55,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:55,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:55,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653902671] [2024-10-12 20:32:55,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653902671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:55,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:55,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:32:55,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909280032] [2024-10-12 20:32:55,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:55,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:55,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:55,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:55,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:55,612 INFO L87 Difference]: Start difference. First operand 19064 states and 28151 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:55,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:55,760 INFO L93 Difference]: Finished difference Result 38074 states and 56248 transitions. [2024-10-12 20:32:55,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:32:55,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-10-12 20:32:55,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:55,782 INFO L225 Difference]: With dead ends: 38074 [2024-10-12 20:32:55,782 INFO L226 Difference]: Without dead ends: 19064 [2024-10-12 20:32:55,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:32:55,798 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 389 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:55,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 161 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:32:55,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19064 states. [2024-10-12 20:32:56,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19064 to 19064. [2024-10-12 20:32:56,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19064 states, 19063 states have (on average 1.4666631694906362) internal successors, (27959), 19063 states have internal predecessors, (27959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19064 states to 19064 states and 27959 transitions. [2024-10-12 20:32:56,291 INFO L78 Accepts]: Start accepts. Automaton has 19064 states and 27959 transitions. Word has length 95 [2024-10-12 20:32:56,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:56,291 INFO L471 AbstractCegarLoop]: Abstraction has 19064 states and 27959 transitions. [2024-10-12 20:32:56,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:56,292 INFO L276 IsEmpty]: Start isEmpty. Operand 19064 states and 27959 transitions. [2024-10-12 20:32:56,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-12 20:32:56,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:56,293 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:56,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:32:56,293 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:32:56,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:56,294 INFO L85 PathProgramCache]: Analyzing trace with hash -321156334, now seen corresponding path program 1 times [2024-10-12 20:32:56,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:56,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639274811] [2024-10-12 20:32:56,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:56,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:56,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:56,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639274811] [2024-10-12 20:32:56,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639274811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:56,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:56,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:32:56,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234182110] [2024-10-12 20:32:56,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:56,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:56,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:56,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:56,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:56,444 INFO L87 Difference]: Start difference. First operand 19064 states and 27959 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:56,614 INFO L93 Difference]: Finished difference Result 38074 states and 55864 transitions. [2024-10-12 20:32:56,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:32:56,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-10-12 20:32:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:56,638 INFO L225 Difference]: With dead ends: 38074 [2024-10-12 20:32:56,639 INFO L226 Difference]: Without dead ends: 19064 [2024-10-12 20:32:56,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:32:56,663 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 425 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:56,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 137 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:32:56,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19064 states. [2024-10-12 20:32:56,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19064 to 19064. [2024-10-12 20:32:56,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19064 states, 19063 states have (on average 1.4565913025232125) internal successors, (27767), 19063 states have internal predecessors, (27767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19064 states to 19064 states and 27767 transitions. [2024-10-12 20:32:56,985 INFO L78 Accepts]: Start accepts. Automaton has 19064 states and 27767 transitions. Word has length 95 [2024-10-12 20:32:56,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:56,985 INFO L471 AbstractCegarLoop]: Abstraction has 19064 states and 27767 transitions. [2024-10-12 20:32:56,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:56,986 INFO L276 IsEmpty]: Start isEmpty. Operand 19064 states and 27767 transitions. [2024-10-12 20:32:56,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-12 20:32:56,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:56,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:56,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:32:56,987 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:32:56,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:56,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1084020041, now seen corresponding path program 1 times [2024-10-12 20:32:56,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:56,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275183110] [2024-10-12 20:32:56,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:56,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:57,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:57,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:57,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275183110] [2024-10-12 20:32:57,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275183110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:57,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:57,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:32:57,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570059481] [2024-10-12 20:32:57,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:57,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:57,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:57,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:57,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:57,102 INFO L87 Difference]: Start difference. First operand 19064 states and 27767 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:57,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:57,357 INFO L93 Difference]: Finished difference Result 38074 states and 55480 transitions. [2024-10-12 20:32:57,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:32:57,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-10-12 20:32:57,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:57,379 INFO L225 Difference]: With dead ends: 38074 [2024-10-12 20:32:57,379 INFO L226 Difference]: Without dead ends: 19064 [2024-10-12 20:32:57,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:32:57,396 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 448 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:57,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 121 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:32:57,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19064 states. [2024-10-12 20:32:57,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19064 to 19064. [2024-10-12 20:32:57,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19064 states, 19063 states have (on average 1.4465194355557887) internal successors, (27575), 19063 states have internal predecessors, (27575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:57,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19064 states to 19064 states and 27575 transitions. [2024-10-12 20:32:57,734 INFO L78 Accepts]: Start accepts. Automaton has 19064 states and 27575 transitions. Word has length 95 [2024-10-12 20:32:57,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:57,734 INFO L471 AbstractCegarLoop]: Abstraction has 19064 states and 27575 transitions. [2024-10-12 20:32:57,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 19064 states and 27575 transitions. [2024-10-12 20:32:57,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-12 20:32:57,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:57,736 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:57,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:32:57,736 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:32:57,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:57,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1469530140, now seen corresponding path program 1 times [2024-10-12 20:32:57,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:57,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248674542] [2024-10-12 20:32:57,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:57,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:57,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:57,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248674542] [2024-10-12 20:32:57,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248674542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:57,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:57,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:32:57,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702114502] [2024-10-12 20:32:57,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:57,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:57,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:57,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:57,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:57,992 INFO L87 Difference]: Start difference. First operand 19064 states and 27575 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:58,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:58,055 INFO L93 Difference]: Finished difference Result 19578 states and 28344 transitions. [2024-10-12 20:32:58,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:32:58,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-10-12 20:32:58,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:58,076 INFO L225 Difference]: With dead ends: 19578 [2024-10-12 20:32:58,077 INFO L226 Difference]: Without dead ends: 19576 [2024-10-12 20:32:58,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:58,084 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:58,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 671 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:32:58,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19576 states. [2024-10-12 20:32:58,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19576 to 19576. [2024-10-12 20:32:58,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19576 states, 19575 states have (on average 1.4315708812260537) internal successors, (28023), 19575 states have internal predecessors, (28023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:58,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19576 states to 19576 states and 28023 transitions. [2024-10-12 20:32:58,466 INFO L78 Accepts]: Start accepts. Automaton has 19576 states and 28023 transitions. Word has length 95 [2024-10-12 20:32:58,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:58,466 INFO L471 AbstractCegarLoop]: Abstraction has 19576 states and 28023 transitions. [2024-10-12 20:32:58,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:58,467 INFO L276 IsEmpty]: Start isEmpty. Operand 19576 states and 28023 transitions. [2024-10-12 20:32:58,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-12 20:32:58,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:58,475 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:58,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:32:58,475 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:32:58,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:58,476 INFO L85 PathProgramCache]: Analyzing trace with hash -2086990711, now seen corresponding path program 1 times [2024-10-12 20:32:58,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:58,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129162977] [2024-10-12 20:32:58,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:58,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:58,775 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:32:58,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:58,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129162977] [2024-10-12 20:32:58,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129162977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:58,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:58,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:32:58,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502598667] [2024-10-12 20:32:58,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:58,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:32:58,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:58,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:32:58,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:32:58,779 INFO L87 Difference]: Start difference. First operand 19576 states and 28023 transitions. Second operand has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:59,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:59,463 INFO L93 Difference]: Finished difference Result 153608 states and 219999 transitions. [2024-10-12 20:32:59,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:32:59,464 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 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 129 [2024-10-12 20:32:59,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:59,616 INFO L225 Difference]: With dead ends: 153608 [2024-10-12 20:32:59,617 INFO L226 Difference]: Without dead ends: 140294 [2024-10-12 20:32:59,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:32:59,666 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 2073 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2073 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:59,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2073 Valid, 1941 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:32:59,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140294 states. [2024-10-12 20:33:00,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140294 to 36024. [2024-10-12 20:33:00,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36024 states, 36023 states have (on average 1.4272825694695055) internal successors, (51415), 36023 states have internal predecessors, (51415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:00,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36024 states to 36024 states and 51415 transitions. [2024-10-12 20:33:00,770 INFO L78 Accepts]: Start accepts. Automaton has 36024 states and 51415 transitions. Word has length 129 [2024-10-12 20:33:00,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:00,770 INFO L471 AbstractCegarLoop]: Abstraction has 36024 states and 51415 transitions. [2024-10-12 20:33:00,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:00,771 INFO L276 IsEmpty]: Start isEmpty. Operand 36024 states and 51415 transitions. [2024-10-12 20:33:00,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-12 20:33:00,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:00,781 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:00,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:33:00,781 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:33:00,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:00,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1020070641, now seen corresponding path program 1 times [2024-10-12 20:33:00,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:00,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506797463] [2024-10-12 20:33:00,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:00,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:01,021 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 20:33:01,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:01,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506797463] [2024-10-12 20:33:01,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506797463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:01,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:01,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:33:01,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930337804] [2024-10-12 20:33:01,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:01,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:33:01,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:01,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:33:01,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:33:01,024 INFO L87 Difference]: Start difference. First operand 36024 states and 51415 transitions. Second operand has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 9 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:01,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:01,751 INFO L93 Difference]: Finished difference Result 173128 states and 247839 transitions. [2024-10-12 20:33:01,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:33:01,752 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 9 states have internal predecessors, (127), 0 states have call successors, (0), 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 129 [2024-10-12 20:33:01,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:01,940 INFO L225 Difference]: With dead ends: 173128 [2024-10-12 20:33:01,940 INFO L226 Difference]: Without dead ends: 153606 [2024-10-12 20:33:01,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:33:01,984 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 2072 mSDsluCounter, 1611 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2072 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:01,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2072 Valid, 1900 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:33:02,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153606 states. [2024-10-12 20:33:03,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153606 to 62200. [2024-10-12 20:33:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62200 states, 62199 states have (on average 1.4244441228958664) internal successors, (88599), 62199 states have internal predecessors, (88599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62200 states to 62200 states and 88599 transitions. [2024-10-12 20:33:03,655 INFO L78 Accepts]: Start accepts. Automaton has 62200 states and 88599 transitions. Word has length 129 [2024-10-12 20:33:03,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:03,656 INFO L471 AbstractCegarLoop]: Abstraction has 62200 states and 88599 transitions. [2024-10-12 20:33:03,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 9 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:03,656 INFO L276 IsEmpty]: Start isEmpty. Operand 62200 states and 88599 transitions. [2024-10-12 20:33:03,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-12 20:33:03,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:03,666 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:03,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:33:03,667 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:33:03,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:03,667 INFO L85 PathProgramCache]: Analyzing trace with hash 78062119, now seen corresponding path program 1 times [2024-10-12 20:33:03,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:03,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501215407] [2024-10-12 20:33:03,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:03,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:03,885 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 20:33:03,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:03,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501215407] [2024-10-12 20:33:03,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501215407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:03,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:03,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:33:03,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295950998] [2024-10-12 20:33:03,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:03,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:33:03,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:03,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:33:03,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:33:03,889 INFO L87 Difference]: Start difference. First operand 62200 states and 88599 transitions. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:04,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:04,442 INFO L93 Difference]: Finished difference Result 192648 states and 275615 transitions. [2024-10-12 20:33:04,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:33:04,443 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 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 129 [2024-10-12 20:33:04,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:05,029 INFO L225 Difference]: With dead ends: 192648 [2024-10-12 20:33:05,030 INFO L226 Difference]: Without dead ends: 173126 [2024-10-12 20:33:05,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:33:05,074 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 2170 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2170 SdHoareTripleChecker+Valid, 2056 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:05,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2170 Valid, 2056 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:33:05,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173126 states. [2024-10-12 20:33:06,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173126 to 81720. [2024-10-12 20:33:06,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81720 states, 81719 states have (on average 1.4240874215298767) internal successors, (116375), 81719 states have internal predecessors, (116375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:06,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81720 states to 81720 states and 116375 transitions. [2024-10-12 20:33:06,665 INFO L78 Accepts]: Start accepts. Automaton has 81720 states and 116375 transitions. Word has length 129 [2024-10-12 20:33:06,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:06,666 INFO L471 AbstractCegarLoop]: Abstraction has 81720 states and 116375 transitions. [2024-10-12 20:33:06,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:06,666 INFO L276 IsEmpty]: Start isEmpty. Operand 81720 states and 116375 transitions. [2024-10-12 20:33:06,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-12 20:33:06,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:06,677 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:06,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:33:06,678 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:33:06,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:06,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1075883987, now seen corresponding path program 1 times [2024-10-12 20:33:06,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:06,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851779262] [2024-10-12 20:33:06,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:06,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:07,475 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 20:33:07,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:07,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851779262] [2024-10-12 20:33:07,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851779262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:07,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:07,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:33:07,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387279399] [2024-10-12 20:33:07,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:07,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:33:07,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:07,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:33:07,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:33:07,477 INFO L87 Difference]: Start difference. First operand 81720 states and 116375 transitions. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:08,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:08,139 INFO L93 Difference]: Finished difference Result 212168 states and 303391 transitions. [2024-10-12 20:33:08,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:33:08,140 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 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 129 [2024-10-12 20:33:08,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:08,342 INFO L225 Difference]: With dead ends: 212168 [2024-10-12 20:33:08,342 INFO L226 Difference]: Without dead ends: 192646 [2024-10-12 20:33:08,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:33:08,404 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 1999 mSDsluCounter, 1840 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1999 SdHoareTripleChecker+Valid, 2127 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:08,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1999 Valid, 2127 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:33:08,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192646 states. [2024-10-12 20:33:10,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192646 to 101240. [2024-10-12 20:33:10,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101240 states, 101239 states have (on average 1.4238682721085747) internal successors, (144151), 101239 states have internal predecessors, (144151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101240 states to 101240 states and 144151 transitions. [2024-10-12 20:33:10,419 INFO L78 Accepts]: Start accepts. Automaton has 101240 states and 144151 transitions. Word has length 129 [2024-10-12 20:33:10,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:10,419 INFO L471 AbstractCegarLoop]: Abstraction has 101240 states and 144151 transitions. [2024-10-12 20:33:10,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:10,420 INFO L276 IsEmpty]: Start isEmpty. Operand 101240 states and 144151 transitions. [2024-10-12 20:33:10,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-12 20:33:10,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:10,427 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:10,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:33:10,427 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:33:10,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:10,428 INFO L85 PathProgramCache]: Analyzing trace with hash -779838559, now seen corresponding path program 1 times [2024-10-12 20:33:10,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:10,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101236924] [2024-10-12 20:33:10,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:10,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:10,657 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 20:33:10,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:10,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101236924] [2024-10-12 20:33:10,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101236924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:10,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:10,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:33:10,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186158809] [2024-10-12 20:33:10,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:10,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:33:10,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:10,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:33:10,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:33:10,661 INFO L87 Difference]: Start difference. First operand 101240 states and 144151 transitions. Second operand has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:11,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:11,954 INFO L93 Difference]: Finished difference Result 231688 states and 331167 transitions. [2024-10-12 20:33:11,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:33:11,955 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 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 129 [2024-10-12 20:33:11,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:12,264 INFO L225 Difference]: With dead ends: 231688 [2024-10-12 20:33:12,265 INFO L226 Difference]: Without dead ends: 212166 [2024-10-12 20:33:12,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:33:12,316 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 1746 mSDsluCounter, 1987 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1746 SdHoareTripleChecker+Valid, 2274 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:12,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1746 Valid, 2274 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:33:12,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212166 states. [2024-10-12 20:33:14,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212166 to 120760. [2024-10-12 20:33:14,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120760 states, 120759 states have (on average 1.4237199711822721) internal successors, (171927), 120759 states have internal predecessors, (171927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:15,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120760 states to 120760 states and 171927 transitions. [2024-10-12 20:33:15,054 INFO L78 Accepts]: Start accepts. Automaton has 120760 states and 171927 transitions. Word has length 129 [2024-10-12 20:33:15,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:15,054 INFO L471 AbstractCegarLoop]: Abstraction has 120760 states and 171927 transitions. [2024-10-12 20:33:15,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:15,054 INFO L276 IsEmpty]: Start isEmpty. Operand 120760 states and 171927 transitions. [2024-10-12 20:33:15,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-12 20:33:15,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:15,063 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:15,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 20:33:15,064 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:33:15,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:15,064 INFO L85 PathProgramCache]: Analyzing trace with hash 648658075, now seen corresponding path program 1 times [2024-10-12 20:33:15,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:15,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305549356] [2024-10-12 20:33:15,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:15,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:15,307 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 20:33:15,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:15,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305549356] [2024-10-12 20:33:15,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305549356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:15,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:15,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:33:15,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663208654] [2024-10-12 20:33:15,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:15,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:33:15,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:15,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:33:15,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:33:15,309 INFO L87 Difference]: Start difference. First operand 120760 states and 171927 transitions. Second operand has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:15,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:15,960 INFO L93 Difference]: Finished difference Result 251208 states and 358943 transitions. [2024-10-12 20:33:15,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:33:15,961 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 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 129 [2024-10-12 20:33:15,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:16,235 INFO L225 Difference]: With dead ends: 251208 [2024-10-12 20:33:16,235 INFO L226 Difference]: Without dead ends: 231686 [2024-10-12 20:33:16,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:33:16,311 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 1730 mSDsluCounter, 2018 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1730 SdHoareTripleChecker+Valid, 2305 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:16,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1730 Valid, 2305 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:33:16,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231686 states. [2024-10-12 20:33:19,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231686 to 140280. [2024-10-12 20:33:19,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140280 states, 140279 states have (on average 1.4236129427783204) internal successors, (199703), 140279 states have internal predecessors, (199703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:19,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140280 states to 140280 states and 199703 transitions. [2024-10-12 20:33:19,402 INFO L78 Accepts]: Start accepts. Automaton has 140280 states and 199703 transitions. Word has length 129 [2024-10-12 20:33:19,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:19,403 INFO L471 AbstractCegarLoop]: Abstraction has 140280 states and 199703 transitions. [2024-10-12 20:33:19,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:19,404 INFO L276 IsEmpty]: Start isEmpty. Operand 140280 states and 199703 transitions. [2024-10-12 20:33:19,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-12 20:33:19,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:19,415 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:19,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 20:33:19,416 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:33:19,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:19,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1670871787, now seen corresponding path program 1 times [2024-10-12 20:33:19,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:19,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600094941] [2024-10-12 20:33:19,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:19,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:20,247 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 20:33:20,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:20,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600094941] [2024-10-12 20:33:20,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600094941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:20,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:20,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:33:20,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148168162] [2024-10-12 20:33:20,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:20,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:33:20,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:20,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:33:20,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:33:20,249 INFO L87 Difference]: Start difference. First operand 140280 states and 199703 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:21,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:21,048 INFO L93 Difference]: Finished difference Result 270728 states and 386719 transitions. [2024-10-12 20:33:21,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:33:21,048 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 0 states have call successors, (0), 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 129 [2024-10-12 20:33:21,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:21,379 INFO L225 Difference]: With dead ends: 270728 [2024-10-12 20:33:21,379 INFO L226 Difference]: Without dead ends: 251206 [2024-10-12 20:33:21,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:33:21,463 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 1826 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1826 SdHoareTripleChecker+Valid, 2315 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:21,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1826 Valid, 2315 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:33:21,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251206 states. [2024-10-12 20:33:24,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251206 to 159800. [2024-10-12 20:33:24,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159800 states, 159799 states have (on average 1.4235320621530798) internal successors, (227479), 159799 states have internal predecessors, (227479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:24,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159800 states to 159800 states and 227479 transitions. [2024-10-12 20:33:24,360 INFO L78 Accepts]: Start accepts. Automaton has 159800 states and 227479 transitions. Word has length 129 [2024-10-12 20:33:24,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:24,360 INFO L471 AbstractCegarLoop]: Abstraction has 159800 states and 227479 transitions. [2024-10-12 20:33:24,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:24,360 INFO L276 IsEmpty]: Start isEmpty. Operand 159800 states and 227479 transitions. [2024-10-12 20:33:24,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-12 20:33:24,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:24,372 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:24,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 20:33:24,372 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:33:24,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:24,373 INFO L85 PathProgramCache]: Analyzing trace with hash 655202412, now seen corresponding path program 1 times [2024-10-12 20:33:24,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:24,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260579416] [2024-10-12 20:33:24,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:24,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:25,735 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:25,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:25,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260579416] [2024-10-12 20:33:25,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260579416] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:33:25,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828892389] [2024-10-12 20:33:25,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:25,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:33:25,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:33:25,739 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-10-12 20:33:25,742 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-10-12 20:33:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:25,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 20:33:25,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:33:26,890 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:26,891 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:33:28,280 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:28,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828892389] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:33:28,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:33:28,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 26 [2024-10-12 20:33:28,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608471626] [2024-10-12 20:33:28,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:33:28,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-12 20:33:28,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:28,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-12 20:33:28,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2024-10-12 20:33:28,283 INFO L87 Difference]: Start difference. First operand 159800 states and 227479 transitions. Second operand has 27 states, 27 states have (on average 13.481481481481481) internal successors, (364), 26 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:39,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:39,384 INFO L93 Difference]: Finished difference Result 1665662 states and 2359388 transitions. [2024-10-12 20:33:39,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2024-10-12 20:33:39,385 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 13.481481481481481) internal successors, (364), 26 states have internal predecessors, (364), 0 states have call successors, (0), 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 130 [2024-10-12 20:33:39,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:42,873 INFO L225 Difference]: With dead ends: 1665662 [2024-10-12 20:33:42,873 INFO L226 Difference]: Without dead ends: 1505916 [2024-10-12 20:33:43,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13456 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5004, Invalid=29778, Unknown=0, NotChecked=0, Total=34782 [2024-10-12 20:33:43,294 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 10795 mSDsluCounter, 1887 mSDsCounter, 0 mSdLazyCounter, 2741 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10795 SdHoareTripleChecker+Valid, 2060 SdHoareTripleChecker+Invalid, 2812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:43,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10795 Valid, 2060 Invalid, 2812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 2741 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]