./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --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 78a4cc43ce1234c075e2c73cca2f6f44edddfccbee7278c746f2db07d17136bf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 19:23:20,183 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:23:20,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:23:20,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:23:20,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:23:20,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:23:20,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:23:20,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:23:20,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:23:20,306 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:23:20,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:23:20,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:23:20,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:23:20,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:23:20,308 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:23:20,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:23:20,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:23:20,309 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:23:20,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:23:20,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:23:20,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:23:20,310 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:23:20,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:23:20,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:23:20,311 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:23:20,311 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:23:20,312 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:23:20,312 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:23:20,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:23:20,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:23:20,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:23:20,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:23:20,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:23:20,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:23:20,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:23:20,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:23:20,314 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:23:20,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:23:20,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:23:20,315 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:23:20,316 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:23:20,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:23:20,316 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/certificate-witnesses-artifact/automizer/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/certificate-witnesses-artifact/automizer 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 -> 78a4cc43ce1234c075e2c73cca2f6f44edddfccbee7278c746f2db07d17136bf Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-11 19:23:20,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:23:20,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:23:20,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:23:20,594 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:23:20,595 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:23:20,596 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c [2024-09-11 19:23:21,994 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:23:22,229 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:23:22,230 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c [2024-09-11 19:23:22,247 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/fd1d3bdc2/bce75ba0ed3a4dfd8487380eb6873fd9/FLAG62dda6ba3 [2024-09-11 19:23:22,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/fd1d3bdc2/bce75ba0ed3a4dfd8487380eb6873fd9 [2024-09-11 19:23:22,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:23:22,582 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:23:22,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:23:22,583 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:23:22,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:23:22,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:23:22" (1/1) ... [2024-09-11 19:23:22,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bcad3ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:22, skipping insertion in model container [2024-09-11 19:23:22,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:23:22" (1/1) ... [2024-09-11 19:23:22,638 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:23:22,876 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c[6448,6461] [2024-09-11 19:23:22,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:23:22,931 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:23:22,966 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c[6448,6461] [2024-09-11 19:23:23,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:23:23,037 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:23:23,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:23 WrapperNode [2024-09-11 19:23:23,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:23:23,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:23:23,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:23:23,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:23:23,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:23" (1/1) ... [2024-09-11 19:23:23,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:23" (1/1) ... [2024-09-11 19:23:23,107 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 637 [2024-09-11 19:23:23,108 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:23:23,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:23:23,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:23:23,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:23:23,131 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:23" (1/1) ... [2024-09-11 19:23:23,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:23" (1/1) ... [2024-09-11 19:23:23,139 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:23" (1/1) ... [2024-09-11 19:23:23,169 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-09-11 19:23:23,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:23" (1/1) ... [2024-09-11 19:23:23,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:23" (1/1) ... [2024-09-11 19:23:23,177 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:23" (1/1) ... [2024-09-11 19:23:23,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:23" (1/1) ... [2024-09-11 19:23:23,193 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:23" (1/1) ... [2024-09-11 19:23:23,198 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:23" (1/1) ... [2024-09-11 19:23:23,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:23:23,207 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:23:23,207 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:23:23,207 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:23:23,208 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:23" (1/1) ... [2024-09-11 19:23:23,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:23:23,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:23:23,256 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-11 19:23:23,260 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-11 19:23:23,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:23:23,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:23:23,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:23:23,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:23:23,374 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:23:23,376 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:23:23,937 INFO L? ?]: Removed 74 outVars from TransFormulas that were not future-live. [2024-09-11 19:23:23,938 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:23:23,966 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:23:23,966 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-11 19:23:23,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:23:23 BoogieIcfgContainer [2024-09-11 19:23:23,967 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:23:23,968 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:23:23,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:23:23,972 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:23:23,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:23:22" (1/3) ... [2024-09-11 19:23:23,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50bf12e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:23:23, skipping insertion in model container [2024-09-11 19:23:23,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:23" (2/3) ... [2024-09-11 19:23:23,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50bf12e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:23:23, skipping insertion in model container [2024-09-11 19:23:23,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:23:23" (3/3) ... [2024-09-11 19:23:23,976 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+nlh-reducer.c [2024-09-11 19:23:23,991 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:23:23,991 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:23:24,069 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:23:24,078 INFO L336 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=All, 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;@2657fb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:23:24,079 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:23:24,083 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 140 states have (on average 1.9857142857142858) internal successors, (278), 141 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-09-11 19:23:24,097 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:24,099 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:24,101 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:24,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:24,107 INFO L85 PathProgramCache]: Analyzing trace with hash -2065817410, now seen corresponding path program 1 times [2024-09-11 19:23:24,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:24,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367171487] [2024-09-11 19:23:24,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:24,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:24,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:24,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:24,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367171487] [2024-09-11 19:23:24,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367171487] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:24,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:24,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:23:24,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729140428] [2024-09-11 19:23:24,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:24,615 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:23:24,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:24,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:23:24,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:23:24,640 INFO L87 Difference]: Start difference. First operand has 142 states, 140 states have (on average 1.9857142857142858) internal successors, (278), 141 states have internal predecessors, (278), 0 states have call successors, (0), 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 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:25,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:25,025 INFO L93 Difference]: Finished difference Result 281 states and 551 transitions. [2024-09-11 19:23:25,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:23:25,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-09-11 19:23:25,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:25,040 INFO L225 Difference]: With dead ends: 281 [2024-09-11 19:23:25,040 INFO L226 Difference]: Without dead ends: 140 [2024-09-11 19:23:25,043 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:23:25,049 INFO L434 NwaCegarLoop]: 271 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:25,050 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 19:23:25,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-09-11 19:23:25,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-09-11 19:23:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.4892086330935252) internal successors, (207), 139 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:25,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 207 transitions. [2024-09-11 19:23:25,105 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 207 transitions. Word has length 138 [2024-09-11 19:23:25,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:25,107 INFO L474 AbstractCegarLoop]: Abstraction has 140 states and 207 transitions. [2024-09-11 19:23:25,108 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:25,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:25,109 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 207 transitions. [2024-09-11 19:23:25,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-09-11 19:23:25,113 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:25,113 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:25,113 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:23:25,114 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:25,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:25,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1380941303, now seen corresponding path program 1 times [2024-09-11 19:23:25,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:25,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155929967] [2024-09-11 19:23:25,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:25,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:25,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:25,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155929967] [2024-09-11 19:23:25,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155929967] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:25,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:25,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:23:25,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098111698] [2024-09-11 19:23:25,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:25,296 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:23:25,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:25,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:23:25,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:23:25,302 INFO L87 Difference]: Start difference. First operand 140 states and 207 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:25,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:25,779 INFO L93 Difference]: Finished difference Result 405 states and 604 transitions. [2024-09-11 19:23:25,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:23:25,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-09-11 19:23:25,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:25,782 INFO L225 Difference]: With dead ends: 405 [2024-09-11 19:23:25,782 INFO L226 Difference]: Without dead ends: 272 [2024-09-11 19:23:25,783 INFO L433 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-09-11 19:23:25,786 INFO L434 NwaCegarLoop]: 77 mSDtfsCounter, 65 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:25,787 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 79 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-11 19:23:25,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-09-11 19:23:25,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2024-09-11 19:23:25,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 1.2546125461254614) internal successors, (340), 271 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:25,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 340 transitions. [2024-09-11 19:23:25,823 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 340 transitions. Word has length 138 [2024-09-11 19:23:25,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:25,825 INFO L474 AbstractCegarLoop]: Abstraction has 272 states and 340 transitions. [2024-09-11 19:23:25,825 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:25,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:25,826 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 340 transitions. [2024-09-11 19:23:25,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-09-11 19:23:25,829 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:25,829 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:25,829 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:23:25,829 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:25,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:25,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1091579007, now seen corresponding path program 1 times [2024-09-11 19:23:25,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:25,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351557610] [2024-09-11 19:23:25,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:25,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:26,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:26,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:26,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351557610] [2024-09-11 19:23:26,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351557610] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:26,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:26,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:23:26,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577408770] [2024-09-11 19:23:26,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:26,116 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:23:26,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:26,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:23:26,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:23:26,119 INFO L87 Difference]: Start difference. First operand 272 states and 340 transitions. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 5 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:26,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:26,421 INFO L93 Difference]: Finished difference Result 401 states and 469 transitions. [2024-09-11 19:23:26,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:23:26,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 5 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-09-11 19:23:26,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:26,425 INFO L225 Difference]: With dead ends: 401 [2024-09-11 19:23:26,426 INFO L226 Difference]: Without dead ends: 266 [2024-09-11 19:23:26,428 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:23:26,429 INFO L434 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:26,430 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 19:23:26,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-09-11 19:23:26,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2024-09-11 19:23:26,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.2490566037735849) internal successors, (331), 265 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:26,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 331 transitions. [2024-09-11 19:23:26,447 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 331 transitions. Word has length 138 [2024-09-11 19:23:26,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:26,448 INFO L474 AbstractCegarLoop]: Abstraction has 266 states and 331 transitions. [2024-09-11 19:23:26,448 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 5 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:26,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:26,449 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 331 transitions. [2024-09-11 19:23:26,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-09-11 19:23:26,454 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:26,454 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:26,454 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 19:23:26,454 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:26,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:26,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1605575413, now seen corresponding path program 1 times [2024-09-11 19:23:26,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:26,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008435921] [2024-09-11 19:23:26,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:26,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:26,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:26,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008435921] [2024-09-11 19:23:26,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008435921] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:26,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:26,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:23:26,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747047933] [2024-09-11 19:23:26,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:26,682 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 19:23:26,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:26,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 19:23:26,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:23:26,683 INFO L87 Difference]: Start difference. First operand 266 states and 331 transitions. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:26,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:26,976 INFO L93 Difference]: Finished difference Result 393 states and 458 transitions. [2024-09-11 19:23:26,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 19:23:26,976 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-09-11 19:23:26,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:26,979 INFO L225 Difference]: With dead ends: 393 [2024-09-11 19:23:26,979 INFO L226 Difference]: Without dead ends: 264 [2024-09-11 19:23:26,980 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:23:26,981 INFO L434 NwaCegarLoop]: 192 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:26,981 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 196 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 19:23:26,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-09-11 19:23:27,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-09-11 19:23:27,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 1.247148288973384) internal successors, (328), 263 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 328 transitions. [2024-09-11 19:23:27,012 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 328 transitions. Word has length 138 [2024-09-11 19:23:27,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:27,012 INFO L474 AbstractCegarLoop]: Abstraction has 264 states and 328 transitions. [2024-09-11 19:23:27,013 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:27,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:27,013 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 328 transitions. [2024-09-11 19:23:27,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-09-11 19:23:27,015 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:27,015 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:27,015 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-11 19:23:27,015 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:27,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:27,016 INFO L85 PathProgramCache]: Analyzing trace with hash 72262183, now seen corresponding path program 1 times [2024-09-11 19:23:27,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:27,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706130205] [2024-09-11 19:23:27,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:27,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:27,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:27,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:27,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706130205] [2024-09-11 19:23:27,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706130205] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:27,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:27,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-11 19:23:27,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304643974] [2024-09-11 19:23:27,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:27,273 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 19:23:27,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:27,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 19:23:27,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-09-11 19:23:27,274 INFO L87 Difference]: Start difference. First operand 264 states and 328 transitions. Second operand has 10 states, 10 states have (on average 13.8) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:27,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:27,638 INFO L93 Difference]: Finished difference Result 385 states and 449 transitions. [2024-09-11 19:23:27,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 19:23:27,639 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.8) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-09-11 19:23:27,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:27,640 INFO L225 Difference]: With dead ends: 385 [2024-09-11 19:23:27,640 INFO L226 Difference]: Without dead ends: 258 [2024-09-11 19:23:27,641 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-09-11 19:23:27,642 INFO L434 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:27,644 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 189 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 19:23:27,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-09-11 19:23:27,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-09-11 19:23:27,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 1.2412451361867705) internal successors, (319), 257 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:27,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 319 transitions. [2024-09-11 19:23:27,657 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 319 transitions. Word has length 138 [2024-09-11 19:23:27,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:27,657 INFO L474 AbstractCegarLoop]: Abstraction has 258 states and 319 transitions. [2024-09-11 19:23:27,657 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.8) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:27,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:27,658 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 319 transitions. [2024-09-11 19:23:27,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-09-11 19:23:27,659 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:27,659 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:27,660 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-11 19:23:27,660 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:27,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:27,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1119682688, now seen corresponding path program 1 times [2024-09-11 19:23:27,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:27,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407794677] [2024-09-11 19:23:27,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:27,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:27,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:27,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:27,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407794677] [2024-09-11 19:23:27,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407794677] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:27,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:27,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-09-11 19:23:27,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336399191] [2024-09-11 19:23:27,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:27,950 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-11 19:23:27,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:27,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-11 19:23:27,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-09-11 19:23:27,951 INFO L87 Difference]: Start difference. First operand 258 states and 319 transitions. Second operand has 13 states, 13 states have (on average 10.615384615384615) internal successors, (138), 12 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:28,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:28,293 INFO L93 Difference]: Finished difference Result 373 states and 434 transitions. [2024-09-11 19:23:28,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-11 19:23:28,294 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.615384615384615) internal successors, (138), 12 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-09-11 19:23:28,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:28,296 INFO L225 Difference]: With dead ends: 373 [2024-09-11 19:23:28,296 INFO L226 Difference]: Without dead ends: 252 [2024-09-11 19:23:28,297 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-09-11 19:23:28,297 INFO L434 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:28,298 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 19:23:28,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-09-11 19:23:28,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2024-09-11 19:23:28,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.2350597609561753) internal successors, (310), 251 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:28,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 310 transitions. [2024-09-11 19:23:28,308 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 310 transitions. Word has length 138 [2024-09-11 19:23:28,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:28,308 INFO L474 AbstractCegarLoop]: Abstraction has 252 states and 310 transitions. [2024-09-11 19:23:28,309 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.615384615384615) internal successors, (138), 12 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:28,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:28,309 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 310 transitions. [2024-09-11 19:23:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-09-11 19:23:28,310 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:28,310 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:28,311 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-11 19:23:28,311 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:28,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:28,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1980321201, now seen corresponding path program 1 times [2024-09-11 19:23:28,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:28,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127160092] [2024-09-11 19:23:28,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:28,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:28,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:28,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:28,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127160092] [2024-09-11 19:23:28,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127160092] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:28,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:28,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-09-11 19:23:28,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629445523] [2024-09-11 19:23:28,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:28,628 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-11 19:23:28,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:28,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-11 19:23:28,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2024-09-11 19:23:28,629 INFO L87 Difference]: Start difference. First operand 252 states and 310 transitions. Second operand has 15 states, 15 states have (on average 9.2) internal successors, (138), 14 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:28,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:28,943 INFO L93 Difference]: Finished difference Result 363 states and 421 transitions. [2024-09-11 19:23:28,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-11 19:23:28,944 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.2) internal successors, (138), 14 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-09-11 19:23:28,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:28,946 INFO L225 Difference]: With dead ends: 363 [2024-09-11 19:23:28,946 INFO L226 Difference]: Without dead ends: 248 [2024-09-11 19:23:28,947 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2024-09-11 19:23:28,947 INFO L434 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:28,948 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 19:23:28,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-09-11 19:23:28,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2024-09-11 19:23:28,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.2307692307692308) internal successors, (304), 247 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:28,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 304 transitions. [2024-09-11 19:23:28,957 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 304 transitions. Word has length 138 [2024-09-11 19:23:28,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:28,957 INFO L474 AbstractCegarLoop]: Abstraction has 248 states and 304 transitions. [2024-09-11 19:23:28,958 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.2) internal successors, (138), 14 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:28,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:28,958 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 304 transitions. [2024-09-11 19:23:28,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-09-11 19:23:28,959 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:28,959 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:28,960 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-11 19:23:28,960 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:28,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:28,960 INFO L85 PathProgramCache]: Analyzing trace with hash 443614953, now seen corresponding path program 1 times [2024-09-11 19:23:28,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:28,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876184824] [2024-09-11 19:23:28,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:28,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:29,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:29,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:29,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876184824] [2024-09-11 19:23:29,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876184824] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:29,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:29,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-09-11 19:23:29,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372158484] [2024-09-11 19:23:29,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:29,398 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-11 19:23:29,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:29,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-11 19:23:29,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2024-09-11 19:23:29,400 INFO L87 Difference]: Start difference. First operand 248 states and 304 transitions. Second operand has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 18 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:29,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:29,742 INFO L93 Difference]: Finished difference Result 351 states and 407 transitions. [2024-09-11 19:23:29,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-11 19:23:29,742 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 18 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-09-11 19:23:29,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:29,744 INFO L225 Difference]: With dead ends: 351 [2024-09-11 19:23:29,744 INFO L226 Difference]: Without dead ends: 240 [2024-09-11 19:23:29,745 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2024-09-11 19:23:29,745 INFO L434 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:29,746 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 19:23:29,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-09-11 19:23:29,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2024-09-11 19:23:29,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 1.2217573221757323) internal successors, (292), 239 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:29,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 292 transitions. [2024-09-11 19:23:29,754 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 292 transitions. Word has length 138 [2024-09-11 19:23:29,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:29,755 INFO L474 AbstractCegarLoop]: Abstraction has 240 states and 292 transitions. [2024-09-11 19:23:29,755 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 18 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:29,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:29,756 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 292 transitions. [2024-09-11 19:23:29,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-09-11 19:23:29,757 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:29,757 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:29,757 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-11 19:23:29,757 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:29,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:29,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1394752007, now seen corresponding path program 1 times [2024-09-11 19:23:29,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:29,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652918746] [2024-09-11 19:23:29,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:29,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:30,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:30,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:30,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652918746] [2024-09-11 19:23:30,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652918746] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:30,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:30,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-09-11 19:23:30,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511314048] [2024-09-11 19:23:30,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:30,255 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-11 19:23:30,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:30,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-11 19:23:30,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2024-09-11 19:23:30,257 INFO L87 Difference]: Start difference. First operand 240 states and 292 transitions. Second operand has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:30,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:30,595 INFO L93 Difference]: Finished difference Result 337 states and 389 transitions. [2024-09-11 19:23:30,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-11 19:23:30,596 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-09-11 19:23:30,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:30,598 INFO L225 Difference]: With dead ends: 337 [2024-09-11 19:23:30,598 INFO L226 Difference]: Without dead ends: 234 [2024-09-11 19:23:30,599 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2024-09-11 19:23:30,599 INFO L434 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:30,600 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 19:23:30,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-09-11 19:23:30,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2024-09-11 19:23:30,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.2145922746781115) internal successors, (283), 233 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:30,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 283 transitions. [2024-09-11 19:23:30,608 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 283 transitions. Word has length 138 [2024-09-11 19:23:30,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:30,609 INFO L474 AbstractCegarLoop]: Abstraction has 234 states and 283 transitions. [2024-09-11 19:23:30,609 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:30,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:30,609 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 283 transitions. [2024-09-11 19:23:30,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-09-11 19:23:30,610 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:30,611 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:30,611 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-11 19:23:30,611 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:30,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:30,611 INFO L85 PathProgramCache]: Analyzing trace with hash 326618323, now seen corresponding path program 1 times [2024-09-11 19:23:30,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:30,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137596213] [2024-09-11 19:23:30,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:30,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:31,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:31,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:31,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137596213] [2024-09-11 19:23:31,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137596213] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:31,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:31,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-09-11 19:23:31,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877190123] [2024-09-11 19:23:31,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:31,126 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-11 19:23:31,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:31,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-11 19:23:31,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-09-11 19:23:31,127 INFO L87 Difference]: Start difference. First operand 234 states and 283 transitions. Second operand has 23 states, 23 states have (on average 6.0) internal successors, (138), 22 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:31,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:31,514 INFO L93 Difference]: Finished difference Result 329 states and 378 transitions. [2024-09-11 19:23:31,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-11 19:23:31,515 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.0) internal successors, (138), 22 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-09-11 19:23:31,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:31,517 INFO L225 Difference]: With dead ends: 329 [2024-09-11 19:23:31,517 INFO L226 Difference]: Without dead ends: 232 [2024-09-11 19:23:31,517 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-09-11 19:23:31,518 INFO L434 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:31,519 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-11 19:23:31,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-09-11 19:23:31,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2024-09-11 19:23:31,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.2121212121212122) internal successors, (280), 231 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:31,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 280 transitions. [2024-09-11 19:23:31,527 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 280 transitions. Word has length 138 [2024-09-11 19:23:31,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:31,529 INFO L474 AbstractCegarLoop]: Abstraction has 232 states and 280 transitions. [2024-09-11 19:23:31,529 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.0) internal successors, (138), 22 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:31,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:31,529 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 280 transitions. [2024-09-11 19:23:31,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-09-11 19:23:31,531 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:31,531 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:31,531 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-11 19:23:31,531 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:31,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:31,532 INFO L85 PathProgramCache]: Analyzing trace with hash -707495457, now seen corresponding path program 1 times [2024-09-11 19:23:31,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:31,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193380932] [2024-09-11 19:23:31,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:31,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:32,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:32,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193380932] [2024-09-11 19:23:32,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193380932] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:32,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:32,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2024-09-11 19:23:32,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713237681] [2024-09-11 19:23:32,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:32,100 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-11 19:23:32,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:32,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-11 19:23:32,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2024-09-11 19:23:32,102 INFO L87 Difference]: Start difference. First operand 232 states and 280 transitions. Second operand has 26 states, 26 states have (on average 5.3076923076923075) internal successors, (138), 25 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:32,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:32,334 INFO L93 Difference]: Finished difference Result 321 states and 369 transitions. [2024-09-11 19:23:32,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-11 19:23:32,334 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.3076923076923075) internal successors, (138), 25 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-09-11 19:23:32,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:32,336 INFO L225 Difference]: With dead ends: 321 [2024-09-11 19:23:32,336 INFO L226 Difference]: Without dead ends: 226 [2024-09-11 19:23:32,337 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2024-09-11 19:23:32,338 INFO L434 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:32,338 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:23:32,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-09-11 19:23:32,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2024-09-11 19:23:32,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.2044444444444444) internal successors, (271), 225 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:32,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 271 transitions. [2024-09-11 19:23:32,346 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 271 transitions. Word has length 138 [2024-09-11 19:23:32,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:32,347 INFO L474 AbstractCegarLoop]: Abstraction has 226 states and 271 transitions. [2024-09-11 19:23:32,347 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.3076923076923075) internal successors, (138), 25 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:32,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:32,348 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 271 transitions. [2024-09-11 19:23:32,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-09-11 19:23:32,349 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:32,349 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:32,349 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-11 19:23:32,349 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:32,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:32,350 INFO L85 PathProgramCache]: Analyzing trace with hash -270620632, now seen corresponding path program 1 times [2024-09-11 19:23:32,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:32,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136941911] [2024-09-11 19:23:32,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:32,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:33,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:33,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:33,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136941911] [2024-09-11 19:23:33,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136941911] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:33,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:33,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2024-09-11 19:23:33,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190492550] [2024-09-11 19:23:33,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:33,016 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-11 19:23:33,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:33,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-11 19:23:33,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2024-09-11 19:23:33,018 INFO L87 Difference]: Start difference. First operand 226 states and 271 transitions. Second operand has 29 states, 29 states have (on average 4.758620689655173) internal successors, (138), 28 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:33,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:33,364 INFO L93 Difference]: Finished difference Result 309 states and 354 transitions. [2024-09-11 19:23:33,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-11 19:23:33,365 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.758620689655173) internal successors, (138), 28 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-09-11 19:23:33,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:33,367 INFO L225 Difference]: With dead ends: 309 [2024-09-11 19:23:33,367 INFO L226 Difference]: Without dead ends: 220 [2024-09-11 19:23:33,367 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2024-09-11 19:23:33,368 INFO L434 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:33,368 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 19:23:33,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-09-11 19:23:33,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2024-09-11 19:23:33,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.1963470319634704) internal successors, (262), 219 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:33,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 262 transitions. [2024-09-11 19:23:33,379 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 262 transitions. Word has length 138 [2024-09-11 19:23:33,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:33,380 INFO L474 AbstractCegarLoop]: Abstraction has 220 states and 262 transitions. [2024-09-11 19:23:33,380 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.758620689655173) internal successors, (138), 28 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:33,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:33,380 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 262 transitions. [2024-09-11 19:23:33,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-09-11 19:23:33,382 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:33,382 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:33,382 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-11 19:23:33,382 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:33,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:33,383 INFO L85 PathProgramCache]: Analyzing trace with hash 891628695, now seen corresponding path program 1 times [2024-09-11 19:23:33,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:33,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686423273] [2024-09-11 19:23:33,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:33,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:34,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:34,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686423273] [2024-09-11 19:23:34,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686423273] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:34,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:34,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2024-09-11 19:23:34,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19615297] [2024-09-11 19:23:34,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:34,080 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-09-11 19:23:34,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:34,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-09-11 19:23:34,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2024-09-11 19:23:34,082 INFO L87 Difference]: Start difference. First operand 220 states and 262 transitions. Second operand has 31 states, 31 states have (on average 4.451612903225806) internal successors, (138), 30 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:34,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:34,335 INFO L93 Difference]: Finished difference Result 299 states and 341 transitions. [2024-09-11 19:23:34,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-11 19:23:34,336 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.451612903225806) internal successors, (138), 30 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-09-11 19:23:34,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:34,338 INFO L225 Difference]: With dead ends: 299 [2024-09-11 19:23:34,338 INFO L226 Difference]: Without dead ends: 216 [2024-09-11 19:23:34,338 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2024-09-11 19:23:34,339 INFO L434 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:34,339 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:23:34,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-09-11 19:23:34,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2024-09-11 19:23:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.1906976744186046) internal successors, (256), 215 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:34,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 256 transitions. [2024-09-11 19:23:34,346 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 256 transitions. Word has length 138 [2024-09-11 19:23:34,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:34,347 INFO L474 AbstractCegarLoop]: Abstraction has 216 states and 256 transitions. [2024-09-11 19:23:34,347 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.451612903225806) internal successors, (138), 30 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:34,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:34,347 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 256 transitions. [2024-09-11 19:23:34,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-09-11 19:23:34,348 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:34,349 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:34,349 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-11 19:23:34,349 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:34,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:34,349 INFO L85 PathProgramCache]: Analyzing trace with hash 866190961, now seen corresponding path program 1 times [2024-09-11 19:23:34,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:34,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034221034] [2024-09-11 19:23:34,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:34,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:35,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-09-11 19:23:35,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:35,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034221034] [2024-09-11 19:23:35,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034221034] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:35,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:35,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2024-09-11 19:23:35,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733662144] [2024-09-11 19:23:35,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:35,101 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-09-11 19:23:35,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:35,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-09-11 19:23:35,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2024-09-11 19:23:35,103 INFO L87 Difference]: Start difference. First operand 216 states and 256 transitions. Second operand has 35 states, 35 states have (on average 3.942857142857143) internal successors, (138), 34 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:35,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:35,501 INFO L93 Difference]: Finished difference Result 287 states and 327 transitions. [2024-09-11 19:23:35,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-11 19:23:35,502 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.942857142857143) internal successors, (138), 34 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-09-11 19:23:35,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:35,504 INFO L225 Difference]: With dead ends: 287 [2024-09-11 19:23:35,505 INFO L226 Difference]: Without dead ends: 208 [2024-09-11 19:23:35,505 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2024-09-11 19:23:35,506 INFO L434 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:35,506 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-11 19:23:35,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-09-11 19:23:35,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-09-11 19:23:35,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.178743961352657) internal successors, (244), 207 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:35,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 244 transitions. [2024-09-11 19:23:35,514 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 244 transitions. Word has length 138 [2024-09-11 19:23:35,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:35,514 INFO L474 AbstractCegarLoop]: Abstraction has 208 states and 244 transitions. [2024-09-11 19:23:35,515 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.942857142857143) internal successors, (138), 34 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:35,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:35,515 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 244 transitions. [2024-09-11 19:23:35,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-09-11 19:23:35,516 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:35,516 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:35,516 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-11 19:23:35,517 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:35,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:35,517 INFO L85 PathProgramCache]: Analyzing trace with hash -309703311, now seen corresponding path program 1 times [2024-09-11 19:23:35,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:35,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458931821] [2024-09-11 19:23:35,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:35,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:36,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:36,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:36,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458931821] [2024-09-11 19:23:36,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458931821] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:36,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:36,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2024-09-11 19:23:36,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088702816] [2024-09-11 19:23:36,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:36,355 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-09-11 19:23:36,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:36,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-09-11 19:23:36,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2024-09-11 19:23:36,356 INFO L87 Difference]: Start difference. First operand 208 states and 244 transitions. Second operand has 38 states, 38 states have (on average 3.6315789473684212) internal successors, (138), 37 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:36,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:36,767 INFO L93 Difference]: Finished difference Result 273 states and 309 transitions. [2024-09-11 19:23:36,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-09-11 19:23:36,767 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.6315789473684212) internal successors, (138), 37 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-09-11 19:23:36,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:36,768 INFO L225 Difference]: With dead ends: 273 [2024-09-11 19:23:36,768 INFO L226 Difference]: Without dead ends: 202 [2024-09-11 19:23:36,769 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2024-09-11 19:23:36,770 INFO L434 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:36,770 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-11 19:23:36,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-09-11 19:23:36,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-09-11 19:23:36,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 1.1691542288557213) internal successors, (235), 201 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:36,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 235 transitions. [2024-09-11 19:23:36,776 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 235 transitions. Word has length 138 [2024-09-11 19:23:36,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:36,777 INFO L474 AbstractCegarLoop]: Abstraction has 202 states and 235 transitions. [2024-09-11 19:23:36,777 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.6315789473684212) internal successors, (138), 37 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:36,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:36,777 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 235 transitions. [2024-09-11 19:23:36,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-09-11 19:23:36,778 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:36,779 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:36,779 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-11 19:23:36,779 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:36,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:36,779 INFO L85 PathProgramCache]: Analyzing trace with hash -967585381, now seen corresponding path program 1 times [2024-09-11 19:23:36,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:36,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287221060] [2024-09-11 19:23:36,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:36,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:37,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:37,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287221060] [2024-09-11 19:23:37,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287221060] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:37,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:37,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2024-09-11 19:23:37,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084332249] [2024-09-11 19:23:37,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:37,661 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-09-11 19:23:37,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:37,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-09-11 19:23:37,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2024-09-11 19:23:37,663 INFO L87 Difference]: Start difference. First operand 202 states and 235 transitions. Second operand has 39 states, 39 states have (on average 3.5384615384615383) internal successors, (138), 38 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:37,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:37,953 INFO L93 Difference]: Finished difference Result 265 states and 298 transitions. [2024-09-11 19:23:37,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-09-11 19:23:37,954 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.5384615384615383) internal successors, (138), 38 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-09-11 19:23:37,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:37,956 INFO L225 Difference]: With dead ends: 265 [2024-09-11 19:23:37,956 INFO L226 Difference]: Without dead ends: 200 [2024-09-11 19:23:37,956 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2024-09-11 19:23:37,957 INFO L434 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:37,959 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 19:23:37,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-09-11 19:23:37,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-09-11 19:23:37,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.1658291457286432) internal successors, (232), 199 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:37,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 232 transitions. [2024-09-11 19:23:37,968 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 232 transitions. Word has length 138 [2024-09-11 19:23:37,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:37,968 INFO L474 AbstractCegarLoop]: Abstraction has 200 states and 232 transitions. [2024-09-11 19:23:37,969 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.5384615384615383) internal successors, (138), 38 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:37,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:37,969 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 232 transitions. [2024-09-11 19:23:37,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-09-11 19:23:37,970 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:37,970 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:37,970 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-11 19:23:37,971 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:37,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:37,971 INFO L85 PathProgramCache]: Analyzing trace with hash -511514985, now seen corresponding path program 1 times [2024-09-11 19:23:37,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:37,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389144956] [2024-09-11 19:23:37,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:37,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:38,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:38,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389144956] [2024-09-11 19:23:38,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389144956] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:38,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:38,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2024-09-11 19:23:38,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686089622] [2024-09-11 19:23:38,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:38,880 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-09-11 19:23:38,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:38,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-09-11 19:23:38,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2024-09-11 19:23:38,883 INFO L87 Difference]: Start difference. First operand 200 states and 232 transitions. Second operand has 42 states, 42 states have (on average 3.2857142857142856) internal successors, (138), 41 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:39,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:39,126 INFO L93 Difference]: Finished difference Result 257 states and 289 transitions. [2024-09-11 19:23:39,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-09-11 19:23:39,127 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.2857142857142856) internal successors, (138), 41 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-09-11 19:23:39,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:39,129 INFO L225 Difference]: With dead ends: 257 [2024-09-11 19:23:39,129 INFO L226 Difference]: Without dead ends: 194 [2024-09-11 19:23:39,130 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2024-09-11 19:23:39,130 INFO L434 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:39,130 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:23:39,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-09-11 19:23:39,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-09-11 19:23:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.1554404145077721) internal successors, (223), 193 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:39,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 223 transitions. [2024-09-11 19:23:39,136 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 223 transitions. Word has length 138 [2024-09-11 19:23:39,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:39,137 INFO L474 AbstractCegarLoop]: Abstraction has 194 states and 223 transitions. [2024-09-11 19:23:39,137 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.2857142857142856) internal successors, (138), 41 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:39,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:39,138 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 223 transitions. [2024-09-11 19:23:39,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-09-11 19:23:39,139 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:39,139 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:39,139 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-11 19:23:39,139 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:39,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:39,140 INFO L85 PathProgramCache]: Analyzing trace with hash 789603536, now seen corresponding path program 1 times [2024-09-11 19:23:39,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:39,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728391923] [2024-09-11 19:23:39,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:39,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:40,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:40,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:40,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728391923] [2024-09-11 19:23:40,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728391923] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:40,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:40,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2024-09-11 19:23:40,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644810586] [2024-09-11 19:23:40,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:40,140 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-09-11 19:23:40,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:40,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-09-11 19:23:40,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2024-09-11 19:23:40,142 INFO L87 Difference]: Start difference. First operand 194 states and 223 transitions. Second operand has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 44 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:40,385 INFO L93 Difference]: Finished difference Result 245 states and 274 transitions. [2024-09-11 19:23:40,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-09-11 19:23:40,386 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 44 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-09-11 19:23:40,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:40,387 INFO L225 Difference]: With dead ends: 245 [2024-09-11 19:23:40,387 INFO L226 Difference]: Without dead ends: 188 [2024-09-11 19:23:40,388 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2024-09-11 19:23:40,388 INFO L434 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:40,389 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:23:40,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-09-11 19:23:40,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-09-11 19:23:40,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.1443850267379678) internal successors, (214), 187 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:40,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 214 transitions. [2024-09-11 19:23:40,395 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 214 transitions. Word has length 138 [2024-09-11 19:23:40,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:40,395 INFO L474 AbstractCegarLoop]: Abstraction has 188 states and 214 transitions. [2024-09-11 19:23:40,395 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 44 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:40,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:40,396 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 214 transitions. [2024-09-11 19:23:40,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-09-11 19:23:40,397 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:40,397 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:40,397 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-11 19:23:40,397 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:40,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:40,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2102967263, now seen corresponding path program 1 times [2024-09-11 19:23:40,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:40,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196539792] [2024-09-11 19:23:40,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:40,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:41,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:41,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:41,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196539792] [2024-09-11 19:23:41,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196539792] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:41,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:41,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2024-09-11 19:23:41,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688929316] [2024-09-11 19:23:41,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:41,406 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-09-11 19:23:41,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:41,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-09-11 19:23:41,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2024-09-11 19:23:41,407 INFO L87 Difference]: Start difference. First operand 188 states and 214 transitions. Second operand has 47 states, 47 states have (on average 2.9361702127659575) internal successors, (138), 46 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:41,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:41,662 INFO L93 Difference]: Finished difference Result 235 states and 261 transitions. [2024-09-11 19:23:41,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-09-11 19:23:41,663 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.9361702127659575) internal successors, (138), 46 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-09-11 19:23:41,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:41,664 INFO L225 Difference]: With dead ends: 235 [2024-09-11 19:23:41,664 INFO L226 Difference]: Without dead ends: 184 [2024-09-11 19:23:41,665 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2024-09-11 19:23:41,665 INFO L434 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:41,666 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:23:41,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-09-11 19:23:41,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-09-11 19:23:41,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.1366120218579234) internal successors, (208), 183 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:41,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 208 transitions. [2024-09-11 19:23:41,672 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 208 transitions. Word has length 138 [2024-09-11 19:23:41,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:41,672 INFO L474 AbstractCegarLoop]: Abstraction has 184 states and 208 transitions. [2024-09-11 19:23:41,672 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.9361702127659575) internal successors, (138), 46 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:41,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:41,673 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 208 transitions. [2024-09-11 19:23:41,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-09-11 19:23:41,673 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:41,673 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:41,674 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-09-11 19:23:41,674 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:41,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:41,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1728060153, now seen corresponding path program 1 times [2024-09-11 19:23:41,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:41,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365765177] [2024-09-11 19:23:41,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:41,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:42,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:42,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:42,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365765177] [2024-09-11 19:23:42,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365765177] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:42,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:42,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2024-09-11 19:23:42,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968780849] [2024-09-11 19:23:42,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:42,846 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-09-11 19:23:42,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:42,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-09-11 19:23:42,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2024-09-11 19:23:42,848 INFO L87 Difference]: Start difference. First operand 184 states and 208 transitions. Second operand has 51 states, 51 states have (on average 2.7058823529411766) internal successors, (138), 50 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:43,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:43,156 INFO L93 Difference]: Finished difference Result 223 states and 247 transitions. [2024-09-11 19:23:43,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-09-11 19:23:43,157 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.7058823529411766) internal successors, (138), 50 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-09-11 19:23:43,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:43,158 INFO L225 Difference]: With dead ends: 223 [2024-09-11 19:23:43,159 INFO L226 Difference]: Without dead ends: 176 [2024-09-11 19:23:43,160 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2024-09-11 19:23:43,160 INFO L434 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:43,161 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 19:23:43,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-09-11 19:23:43,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2024-09-11 19:23:43,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 1.12) internal successors, (196), 175 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 196 transitions. [2024-09-11 19:23:43,167 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 196 transitions. Word has length 138 [2024-09-11 19:23:43,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:43,167 INFO L474 AbstractCegarLoop]: Abstraction has 176 states and 196 transitions. [2024-09-11 19:23:43,167 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.7058823529411766) internal successors, (138), 50 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:43,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:43,168 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 196 transitions. [2024-09-11 19:23:43,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-09-11 19:23:43,168 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:43,169 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:43,169 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-09-11 19:23:43,169 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:43,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:43,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1486711273, now seen corresponding path program 1 times [2024-09-11 19:23:43,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:43,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683158045] [2024-09-11 19:23:43,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:43,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:44,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:44,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:44,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683158045] [2024-09-11 19:23:44,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683158045] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:44,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:44,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2024-09-11 19:23:44,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873995330] [2024-09-11 19:23:44,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:44,466 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-09-11 19:23:44,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:44,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-09-11 19:23:44,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2024-09-11 19:23:44,468 INFO L87 Difference]: Start difference. First operand 176 states and 196 transitions. Second operand has 53 states, 53 states have (on average 2.6037735849056602) internal successors, (138), 52 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:44,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:44,795 INFO L93 Difference]: Finished difference Result 211 states and 231 transitions. [2024-09-11 19:23:44,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-09-11 19:23:44,795 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.6037735849056602) internal successors, (138), 52 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-09-11 19:23:44,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:44,797 INFO L225 Difference]: With dead ends: 211 [2024-09-11 19:23:44,797 INFO L226 Difference]: Without dead ends: 142 [2024-09-11 19:23:44,798 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2024-09-11 19:23:44,798 INFO L434 NwaCegarLoop]: 2 mSDtfsCounter, 17 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:44,799 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 12 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 19:23:44,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-09-11 19:23:44,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2024-09-11 19:23:44,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:44,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2024-09-11 19:23:44,816 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 138 [2024-09-11 19:23:44,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:44,817 INFO L474 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2024-09-11 19:23:44,817 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.6037735849056602) internal successors, (138), 52 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:44,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:44,817 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2024-09-11 19:23:44,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-09-11 19:23:44,818 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:44,818 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:44,818 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-09-11 19:23:44,818 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:44,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:44,819 INFO L85 PathProgramCache]: Analyzing trace with hash -851195132, now seen corresponding path program 1 times [2024-09-11 19:23:44,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:44,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795910475] [2024-09-11 19:23:44,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:44,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:46,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:46,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:46,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795910475] [2024-09-11 19:23:46,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795910475] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:46,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:46,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2024-09-11 19:23:46,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345233963] [2024-09-11 19:23:46,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:46,921 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-09-11 19:23:46,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:46,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-09-11 19:23:46,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2024-09-11 19:23:46,924 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand has 70 states, 70 states have (on average 1.9714285714285715) internal successors, (138), 69 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:47,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:47,169 INFO L93 Difference]: Finished difference Result 181 states and 183 transitions. [2024-09-11 19:23:47,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2024-09-11 19:23:47,170 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.9714285714285715) internal successors, (138), 69 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-09-11 19:23:47,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:47,171 INFO L225 Difference]: With dead ends: 181 [2024-09-11 19:23:47,171 INFO L226 Difference]: Without dead ends: 142 [2024-09-11 19:23:47,173 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2024-09-11 19:23:47,173 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:47,174 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 9 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:23:47,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-09-11 19:23:47,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2024-09-11 19:23:47,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.0071428571428571) internal successors, (141), 140 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:47,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2024-09-11 19:23:47,180 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2024-09-11 19:23:47,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:47,181 INFO L474 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2024-09-11 19:23:47,181 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 1.9714285714285715) internal successors, (138), 69 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:47,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:47,181 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2024-09-11 19:23:47,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-09-11 19:23:47,182 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:47,182 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:47,182 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-09-11 19:23:47,182 INFO L399 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:47,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:47,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1962261058, now seen corresponding path program 1 times [2024-09-11 19:23:47,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:47,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295385887] [2024-09-11 19:23:47,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:47,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:49,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:49,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:49,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295385887] [2024-09-11 19:23:49,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295385887] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:23:49,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139906619] [2024-09-11 19:23:49,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:49,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:23:49,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:23:49,238 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:23:49,240 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-11 19:23:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:49,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-09-11 19:23:49,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:23:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:49,599 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:23:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:53,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139906619] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:23:53,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:23:53,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 102 [2024-09-11 19:23:53,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344037042] [2024-09-11 19:23:53,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:23:53,245 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2024-09-11 19:23:53,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:53,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2024-09-11 19:23:53,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2024-09-11 19:23:53,250 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand has 103 states, 103 states have (on average 2.7281553398058254) internal successors, (281), 102 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:53,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:53,726 INFO L93 Difference]: Finished difference Result 208 states and 239 transitions. [2024-09-11 19:23:53,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-09-11 19:23:53,727 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 2.7281553398058254) internal successors, (281), 102 states have internal predecessors, (281), 0 states have call successors, (0), 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 140 [2024-09-11 19:23:53,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:53,729 INFO L225 Difference]: With dead ends: 208 [2024-09-11 19:23:53,729 INFO L226 Difference]: Without dead ends: 205 [2024-09-11 19:23:53,732 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 209 SyntacticMatches, 38 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2153 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2024-09-11 19:23:53,733 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 105 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:53,734 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 15 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-11 19:23:53,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-09-11 19:23:53,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-09-11 19:23:53,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.0049019607843137) internal successors, (205), 204 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:53,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2024-09-11 19:23:53,745 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 140 [2024-09-11 19:23:53,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:53,746 INFO L474 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2024-09-11 19:23:53,746 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 2.7281553398058254) internal successors, (281), 102 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:53,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:53,747 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2024-09-11 19:23:53,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-09-11 19:23:53,747 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:53,748 INFO L216 NwaCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-11 19:23:53,765 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 19:23:53,954 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-09-11 19:23:53,955 INFO L399 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:53,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:53,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2094150910, now seen corresponding path program 2 times [2024-09-11 19:23:53,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:53,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952373941] [2024-09-11 19:23:53,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:53,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:55,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:55,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:55,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952373941] [2024-09-11 19:23:55,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952373941] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:23:55,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593105410] [2024-09-11 19:23:55,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:23:55,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:23:55,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:23:55,591 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:23:55,592 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-11 19:23:55,688 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:23:55,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:23:55,690 INFO L262 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-09-11 19:23:55,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:23:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:55,973 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:23:56,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:56,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593105410] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:23:56,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:23:56,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 54 [2024-09-11 19:23:56,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961707299] [2024-09-11 19:23:56,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:23:56,279 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-09-11 19:23:56,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:56,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-09-11 19:23:56,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2024-09-11 19:23:56,281 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand has 55 states, 55 states have (on average 3.7454545454545456) internal successors, (206), 54 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:57,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:57,216 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2024-09-11 19:23:57,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-09-11 19:23:57,216 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 3.7454545454545456) internal successors, (206), 54 states have internal predecessors, (206), 0 states have call successors, (0), 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 204 [2024-09-11 19:23:57,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:57,218 INFO L225 Difference]: With dead ends: 211 [2024-09-11 19:23:57,219 INFO L226 Difference]: Without dead ends: 208 [2024-09-11 19:23:57,219 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 405 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2024-09-11 19:23:57,219 INFO L434 NwaCegarLoop]: 153 mSDtfsCounter, 1 mSDsluCounter, 7956 mSDsCounter, 0 mSdLazyCounter, 2813 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8109 SdHoareTripleChecker+Invalid, 2813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:57,220 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 8109 Invalid, 2813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2813 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-09-11 19:23:57,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-09-11 19:23:57,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2024-09-11 19:23:57,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.0048543689320388) internal successors, (207), 206 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:57,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2024-09-11 19:23:57,236 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2024-09-11 19:23:57,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:57,236 INFO L474 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2024-09-11 19:23:57,237 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 3.7454545454545456) internal successors, (206), 54 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:57,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:57,237 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2024-09-11 19:23:57,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-09-11 19:23:57,238 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:57,238 INFO L216 NwaCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-11 19:23:57,254 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 19:23:57,439 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-09-11 19:23:57,439 INFO L399 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:57,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:57,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1868162760, now seen corresponding path program 3 times [2024-09-11 19:23:57,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:57,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323828489] [2024-09-11 19:23:57,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:57,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:59,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 1156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:59,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:59,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323828489] [2024-09-11 19:23:59,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323828489] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:59,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:59,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2024-09-11 19:23:59,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513352615] [2024-09-11 19:23:59,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:59,037 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-09-11 19:23:59,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:59,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-09-11 19:23:59,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2024-09-11 19:23:59,039 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand has 52 states, 52 states have (on average 3.9615384615384617) internal successors, (206), 52 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:59,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:59,384 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2024-09-11 19:23:59,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-09-11 19:23:59,385 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.9615384615384617) internal successors, (206), 52 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2024-09-11 19:23:59,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:59,387 INFO L225 Difference]: With dead ends: 207 [2024-09-11 19:23:59,387 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 19:23:59,388 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2024-09-11 19:23:59,389 INFO L434 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:59,389 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 19:23:59,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 19:23:59,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 19:23:59,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:59,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 19:23:59,390 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 206 [2024-09-11 19:23:59,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:59,391 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 19:23:59,391 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.9615384615384617) internal successors, (206), 52 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:59,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:59,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 19:23:59,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 19:23:59,394 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 19:23:59,395 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-09-11 19:23:59,397 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:59,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 19:24:00,240 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 19:24:00,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 07:24:00 BoogieIcfgContainer [2024-09-11 19:24:00,271 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 19:24:00,271 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 19:24:00,271 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 19:24:00,272 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 19:24:00,272 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:23:23" (3/4) ... [2024-09-11 19:24:00,274 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 19:24:00,290 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-09-11 19:24:00,292 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-11 19:24:00,293 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 19:24:00,294 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 19:24:00,508 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 19:24:00,511 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 19:24:00,512 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 19:24:00,512 INFO L158 Benchmark]: Toolchain (without parser) took 37930.37ms. Allocated memory was 182.5MB in the beginning and 522.2MB in the end (delta: 339.7MB). Free memory was 115.0MB in the beginning and 454.9MB in the end (delta: -339.9MB). Peak memory consumption was 536.4kB. Max. memory is 16.1GB. [2024-09-11 19:24:00,512 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 109.1MB. Free memory is still 71.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 19:24:00,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.24ms. Allocated memory is still 182.5MB. Free memory was 114.6MB in the beginning and 153.9MB in the end (delta: -39.2MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2024-09-11 19:24:00,513 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.61ms. Allocated memory is still 182.5MB. Free memory was 153.9MB in the beginning and 151.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 19:24:00,513 INFO L158 Benchmark]: Boogie Preprocessor took 93.41ms. Allocated memory is still 182.5MB. Free memory was 151.1MB in the beginning and 147.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-11 19:24:00,513 INFO L158 Benchmark]: RCFGBuilder took 760.22ms. Allocated memory is still 182.5MB. Free memory was 147.6MB in the beginning and 100.7MB in the end (delta: 46.9MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-09-11 19:24:00,513 INFO L158 Benchmark]: TraceAbstraction took 36302.41ms. Allocated memory was 182.5MB in the beginning and 522.2MB in the end (delta: 339.7MB). Free memory was 100.1MB in the beginning and 467.5MB in the end (delta: -367.4MB). Peak memory consumption was 209.3MB. Max. memory is 16.1GB. [2024-09-11 19:24:00,513 INFO L158 Benchmark]: Witness Printer took 240.29ms. Allocated memory is still 522.2MB. Free memory was 466.4MB in the beginning and 454.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 19:24:00,519 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 109.1MB. Free memory is still 71.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 455.24ms. Allocated memory is still 182.5MB. Free memory was 114.6MB in the beginning and 153.9MB in the end (delta: -39.2MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.61ms. Allocated memory is still 182.5MB. Free memory was 153.9MB in the beginning and 151.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.41ms. Allocated memory is still 182.5MB. Free memory was 151.1MB in the beginning and 147.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 760.22ms. Allocated memory is still 182.5MB. Free memory was 147.6MB in the beginning and 100.7MB in the end (delta: 46.9MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 36302.41ms. Allocated memory was 182.5MB in the beginning and 522.2MB in the end (delta: 339.7MB). Free memory was 100.1MB in the beginning and 467.5MB in the end (delta: -367.4MB). Peak memory consumption was 209.3MB. Max. memory is 16.1GB. * Witness Printer took 240.29ms. Allocated memory is still 522.2MB. Free memory was 466.4MB in the beginning and 454.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 444]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 142 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.4s, OverallIterations: 25, TraceHistogramMax: 34, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 189 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 189 mSDsluCounter, 11052 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8101 mSDsCounter, 347 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17041 IncrementalHoareTripleChecker+Invalid, 17388 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 347 mSolverCounterUnsat, 2951 mSDtfsCounter, 17041 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1465 GetRequests, 639 SyntacticMatches, 39 SemanticMatches, 787 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2153 ImplicationChecksByTransitivity, 15.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=272occurred in iteration=2, InterpolantAutomatonStates: 835, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 24.3s InterpolantComputationTime, 3930 NumberOfCodeBlocks, 3930 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 4245 ConstructedInterpolants, 0 QuantifiedInterpolants, 8808 SizeOfPredicates, 0 NumberOfNonLiveVariables, 882 ConjunctsInSsa, 175 ConjunctsInUnsatCore, 29 InterpolantComputations, 23 PerfectInterpolantSequences, 1156/4426 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 257]: Location Invariant Derived location invariant: ((40 == main__x) && (main__y == 50)) - InvariantResult [Line: 155]: Location Invariant Derived location invariant: ((23 == main__x) && (main__y == 50)) - InvariantResult [Line: 77]: Location Invariant Derived location invariant: ((main__x == 10) && (main__y == 50)) - InvariantResult [Line: 101]: Location Invariant Derived location invariant: ((14 == main__x) && (main__y == 50)) - InvariantResult [Line: 179]: Location Invariant Derived location invariant: ((main__x == 27) && (main__y == 50)) - InvariantResult [Line: 293]: Location Invariant Derived location invariant: ((main__y == 50) && (main__x == 46)) - InvariantResult [Line: 23]: Location Invariant Derived location invariant: ((main__x == 1) && (main__y == 50)) - InvariantResult [Line: 239]: Location Invariant Derived location invariant: ((main__x == 37) && (main__y == 50)) - InvariantResult [Line: 359]: Location Invariant Derived location invariant: ((57 == main__y) && (57 == main__x)) - InvariantResult [Line: 125]: Location Invariant Derived location invariant: ((main__x == 18) && (main__y == 50)) - InvariantResult [Line: 401]: Location Invariant Derived location invariant: ((64 == main__x) && (64 == main__y)) - InvariantResult [Line: 191]: Location Invariant Derived location invariant: ((29 == main__x) && (main__y == 50)) - InvariantResult [Line: 269]: Location Invariant Derived location invariant: ((main__y == 50) && (42 == main__x)) - InvariantResult [Line: 149]: Location Invariant Derived location invariant: ((main__y == 50) && (22 == main__x)) - InvariantResult [Line: 305]: Location Invariant Derived location invariant: ((main__y == 50) && (main__x == 48)) - InvariantResult [Line: 167]: Location Invariant Derived location invariant: ((main__x == 25) && (main__y == 50)) - InvariantResult [Line: 245]: Location Invariant Derived location invariant: ((main__y == 50) && (main__x == 38)) - InvariantResult [Line: 107]: Location Invariant Derived location invariant: ((main__x == 15) && (main__y == 50)) - InvariantResult [Line: 323]: Location Invariant Derived location invariant: ((51 == main__x) && (51 == main__y)) - InvariantResult [Line: 47]: Location Invariant Derived location invariant: ((5 == main__x) && (main__y == 50)) - InvariantResult [Line: 83]: Location Invariant Derived location invariant: ((main__y == 50) && (main__x == 11)) - InvariantResult [Line: 41]: Location Invariant Derived location invariant: ((main__y == 50) && (main__x == 4)) - InvariantResult [Line: 173]: Location Invariant Derived location invariant: ((main__x == 26) && (main__y == 50)) - InvariantResult [Line: 420]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((((main__y == 83) && (main__x == 83)) || ((84 == main__x) && (84 == main__y))) || ((77 == main__x) && (77 == main__y))) || ((main__y == 100) && (100 <= main__x))) || ((76 == main__x) && (76 == main__y))) || ((71 == main__x) && (71 == main__y))) || ((main__x == 70) && (main__y == 70))) || ((72 == main__y) && (72 == main__x))) || ((67 == main__x) && (67 == main__y))) || ((main__x == 74) && (main__y == 74))) || ((98 == main__x) && (98 == main__y))) || ((main__y == 90) && (main__x == 90))) || ((main__y == 82) && (main__x == 82))) || ((main__x == 80) && (main__y == 80))) || ((main__y == 93) && (main__x == 93))) || ((main__y == 85) && (main__x == 85))) || ((94 == main__x) && (94 == main__y))) || ((81 == main__x) && (81 == main__y))) || ((main__y == 73) && (main__x == 73))) || ((68 == main__y) && (68 == main__x))) || ((main__y == 79) && (main__x == 79))) || ((95 == main__y) && (95 == main__x))) || ((main__y == 78) && (main__x == 78))) || ((69 == main__x) && (69 == main__y))) || ((main__x == 99) && (main__y == 99))) || ((87 == main__x) && (87 == main__y))) || ((main__x == 75) && (main__y == 75))) || ((97 == main__y) && (97 == main__x))) || ((main__x == 86) && (main__y == 86))) || ((88 == main__x) && (88 == main__y))) || ((91 == main__x) && (91 == main__y))) || ((main__y == 89) && (main__x == 89))) || ((main__x == 96) && (main__y == 96))) || ((92 == main__y) && (92 == main__x))) - InvariantResult [Line: 113]: Location Invariant Derived location invariant: ((main__y == 50) && (16 == main__x)) - InvariantResult [Line: 407]: Location Invariant Derived location invariant: ((main__x == 65) && (main__y == 65)) - InvariantResult [Line: 311]: Location Invariant Derived location invariant: ((49 == main__x) && (main__y == 50)) - InvariantResult [Line: 131]: Location Invariant Derived location invariant: ((19 == main__x) && (main__y == 50)) - InvariantResult [Line: 209]: Location Invariant Derived location invariant: ((32 == main__x) && (main__y == 50)) - InvariantResult [Line: 143]: Location Invariant Derived location invariant: ((21 == main__x) && (main__y == 50)) - InvariantResult [Line: 299]: Location Invariant Derived location invariant: ((main__y == 50) && (47 == main__x)) - InvariantResult [Line: 185]: Location Invariant Derived location invariant: ((main__y == 50) && (main__x == 28)) - InvariantResult [Line: 263]: Location Invariant Derived location invariant: ((main__y == 50) && (41 == main__x)) - InvariantResult [Line: 413]: Location Invariant Derived location invariant: ((66 == main__y) && (66 == main__x)) - InvariantResult [Line: 197]: Location Invariant Derived location invariant: ((30 == main__x) && (main__y == 50)) - InvariantResult [Line: 203]: Location Invariant Derived location invariant: ((main__x == 31) && (main__y == 50)) - InvariantResult [Line: 119]: Location Invariant Derived location invariant: ((main__x == 17) && (main__y == 50)) - InvariantResult [Line: 95]: Location Invariant Derived location invariant: ((main__x == 13) && (main__y == 50)) - InvariantResult [Line: 335]: Location Invariant Derived location invariant: ((53 == main__y) && (53 == main__x)) - InvariantResult [Line: 329]: Location Invariant Derived location invariant: ((52 == main__x) && (52 == main__y)) - InvariantResult [Line: 341]: Location Invariant Derived location invariant: ((main__y == 54) && (main__x == 54)) - InvariantResult [Line: 53]: Location Invariant Derived location invariant: ((main__x == 6) && (main__y == 50)) - InvariantResult [Line: 233]: Location Invariant Derived location invariant: ((main__y == 50) && (main__x == 36)) - InvariantResult [Line: 383]: Location Invariant Derived location invariant: ((main__y == 61) && (main__x == 61)) - InvariantResult [Line: 389]: Location Invariant Derived location invariant: ((62 == main__x) && (62 == main__y)) - InvariantResult [Line: 161]: Location Invariant Derived location invariant: ((main__x == 24) && (main__y == 50)) - InvariantResult [Line: 35]: Location Invariant Derived location invariant: ((3 == main__x) && (main__y == 50)) - InvariantResult [Line: 59]: Location Invariant Derived location invariant: ((7 == main__x) && (main__y == 50)) - InvariantResult [Line: 275]: Location Invariant Derived location invariant: ((main__x == 43) && (main__y == 50)) - InvariantResult [Line: 371]: Location Invariant Derived location invariant: ((59 == main__x) && (59 == main__y)) - InvariantResult [Line: 71]: Location Invariant Derived location invariant: ((main__y == 50) && (9 == main__x)) - InvariantResult [Line: 137]: Location Invariant Derived location invariant: ((main__y == 50) && (main__x == 20)) - InvariantResult [Line: 221]: Location Invariant Derived location invariant: ((main__x == 34) && (main__y == 50)) - InvariantResult [Line: 227]: Location Invariant Derived location invariant: ((35 == main__x) && (main__y == 50)) - InvariantResult [Line: 317]: Location Invariant Derived location invariant: ((main__x == 50) && (main__y == 50)) - InvariantResult [Line: 353]: Location Invariant Derived location invariant: ((56 == main__y) && (56 == main__x)) - InvariantResult [Line: 281]: Location Invariant Derived location invariant: ((44 == main__x) && (main__y == 50)) - InvariantResult [Line: 287]: Location Invariant Derived location invariant: ((main__y == 50) && (main__x == 45)) - InvariantResult [Line: 215]: Location Invariant Derived location invariant: ((main__x == 33) && (main__y == 50)) - InvariantResult [Line: 395]: Location Invariant Derived location invariant: ((main__y == 63) && (main__x == 63)) - InvariantResult [Line: 13]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 365]: Location Invariant Derived location invariant: ((main__x == 58) && (main__y == 58)) - InvariantResult [Line: 89]: Location Invariant Derived location invariant: ((main__y == 50) && (main__x == 12)) - InvariantResult [Line: 65]: Location Invariant Derived location invariant: ((main__x == 8) && (main__y == 50)) - InvariantResult [Line: 29]: Location Invariant Derived location invariant: ((2 == main__x) && (main__y == 50)) - InvariantResult [Line: 347]: Location Invariant Derived location invariant: ((main__x == 55) && (main__y == 55)) - InvariantResult [Line: 251]: Location Invariant Derived location invariant: ((main__x == 39) && (main__y == 50)) - InvariantResult [Line: 377]: Location Invariant Derived location invariant: ((main__x == 60) && (main__y == 60)) RESULT: Ultimate proved your program to be correct! [2024-09-11 19:24:00,553 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE