./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/in-de51.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/loops-crafted-1/in-de51.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 6b650e50691cb35e1bdf008faa87d25716bf83c58902e8bffb444ab81952ff19 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:27:24,580 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:27:24,638 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:27:24,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:27:24,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:27:24,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:27:24,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:27:24,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:27:24,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:27:24,671 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:27:24,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:27:24,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:27:24,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:27:24,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:27:24,672 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:27:24,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:27:24,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:27:24,672 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:27:24,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:27:24,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:27:24,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:27:24,676 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:27:24,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:27:24,677 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:27:24,677 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:27:24,677 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:27:24,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:27:24,677 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:27:24,678 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:27:24,678 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:27:24,678 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:27:24,678 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:27:24,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:27:24,679 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:27:24,679 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:27:24,679 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:27:24,680 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:27:24,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:27:24,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:27:24,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:27:24,681 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:27:24,681 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:27:24,681 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 -> 6b650e50691cb35e1bdf008faa87d25716bf83c58902e8bffb444ab81952ff19 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER 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.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 10:27:24,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:27:24,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:27:24,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:27:24,956 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:27:24,957 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:27:24,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops-crafted-1/in-de51.c [2024-09-25 10:27:26,269 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:27:26,385 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:27:26,386 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/in-de51.c [2024-09-25 10:27:26,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/6cd5a387d/da84043580ed4bb18457ac7fd41f0230/FLAG0adb01ac1 [2024-09-25 10:27:26,400 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/6cd5a387d/da84043580ed4bb18457ac7fd41f0230 [2024-09-25 10:27:26,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:27:26,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:27:26,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:27:26,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:27:26,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:27:26,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:27:26" (1/1) ... [2024-09-25 10:27:26,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17c2dd6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:27:26, skipping insertion in model container [2024-09-25 10:27:26,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:27:26" (1/1) ... [2024-09-25 10:27:26,424 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:27:26,530 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/in-de51.c[368,381] [2024-09-25 10:27:26,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:27:26,552 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:27:26,561 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/in-de51.c[368,381] [2024-09-25 10:27:26,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:27:26,581 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:27:26,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:27:26 WrapperNode [2024-09-25 10:27:26,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:27:26,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:27:26,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:27:26,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:27:26,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:27:26" (1/1) ... [2024-09-25 10:27:26,591 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:27:26" (1/1) ... [2024-09-25 10:27:26,595 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:27:26,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:27:26,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:27:26,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:27:26,597 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:27:26,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:27:26" (1/1) ... [2024-09-25 10:27:26,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:27:26" (1/1) ... [2024-09-25 10:27:26,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:27:26" (1/1) ... [2024-09-25 10:27:26,619 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-25 10:27:26,619 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:27:26" (1/1) ... [2024-09-25 10:27:26,619 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:27:26" (1/1) ... [2024-09-25 10:27:26,622 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:27:26" (1/1) ... [2024-09-25 10:27:26,625 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:27:26" (1/1) ... [2024-09-25 10:27:26,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:27:26" (1/1) ... [2024-09-25 10:27:26,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:27:26" (1/1) ... [2024-09-25 10:27:26,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:27:26,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:27:26,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:27:26,631 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:27:26,631 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:27:26" (1/1) ... [2024-09-25 10:27:26,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:27:26,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:27:26,659 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-25 10:27:26,668 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-25 10:27:26,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:27:26,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:27:26,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:27:26,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:27:26,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:27:26,700 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:27:26,700 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:27:26,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:27:26,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:27:26,702 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:27:26,753 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:27:26,754 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:27:26,882 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-25 10:27:26,882 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:27:26,903 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:27:26,903 INFO L317 CfgBuilder]: Removed 5 assume(true) statements. [2024-09-25 10:27:26,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:27:26 BoogieIcfgContainer [2024-09-25 10:27:26,907 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:27:26,909 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:27:26,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:27:26,911 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:27:26,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:27:26" (1/3) ... [2024-09-25 10:27:26,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fff6f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:27:26, skipping insertion in model container [2024-09-25 10:27:26,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:27:26" (2/3) ... [2024-09-25 10:27:26,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fff6f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:27:26, skipping insertion in model container [2024-09-25 10:27:26,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:27:26" (3/3) ... [2024-09-25 10:27:26,917 INFO L112 eAbstractionObserver]: Analyzing ICFG in-de51.c [2024-09-25 10:27:26,932 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:27:26,932 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:27:26,982 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:27:26,988 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;@5eab5b34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:27:26,988 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:27:26,992 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 15 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:27:27,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-25 10:27:27,000 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:27:27,000 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:27:27,001 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:27:27,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:27,005 INFO L85 PathProgramCache]: Analyzing trace with hash -356520028, now seen corresponding path program 1 times [2024-09-25 10:27:27,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:27:27,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068059904] [2024-09-25 10:27:27,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:27,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:27:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:27,124 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:27:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:27,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-25 10:27:27,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:27:27,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068059904] [2024-09-25 10:27:27,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068059904] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:27:27,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:27:27,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 10:27:27,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088986277] [2024-09-25 10:27:27,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:27:27,149 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 10:27:27,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:27:27,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 10:27:27,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:27:27,171 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 15 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:27,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:27:27,188 INFO L93 Difference]: Finished difference Result 38 states and 57 transitions. [2024-09-25 10:27:27,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 10:27:27,190 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-25 10:27:27,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:27:27,194 INFO L225 Difference]: With dead ends: 38 [2024-09-25 10:27:27,195 INFO L226 Difference]: Without dead ends: 16 [2024-09-25 10:27:27,197 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:27:27,199 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:27:27,200 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:27:27,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-09-25 10:27:27,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-09-25 10:27:27,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-09-25 10:27:27,225 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 15 [2024-09-25 10:27:27,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:27:27,226 INFO L474 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-09-25 10:27:27,226 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:27,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:27,227 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2024-09-25 10:27:27,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-25 10:27:27,228 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:27:27,228 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:27:27,228 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:27:27,229 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:27:27,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:27,229 INFO L85 PathProgramCache]: Analyzing trace with hash 315017388, now seen corresponding path program 1 times [2024-09-25 10:27:27,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:27:27,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437789483] [2024-09-25 10:27:27,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:27,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:27:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:27,584 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:27:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:27,591 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-25 10:27:27,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:27:27,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437789483] [2024-09-25 10:27:27,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437789483] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:27:27,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:27:27,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:27:27,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115686933] [2024-09-25 10:27:27,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:27:27,592 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:27:27,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:27:27,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:27:27,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:27:27,594 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:27,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:27:27,635 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2024-09-25 10:27:27,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:27:27,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-25 10:27:27,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:27:27,636 INFO L225 Difference]: With dead ends: 27 [2024-09-25 10:27:27,637 INFO L226 Difference]: Without dead ends: 22 [2024-09-25 10:27:27,638 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:27:27,638 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:27:27,639 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 45 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:27:27,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-25 10:27:27,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-25 10:27:27,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2024-09-25 10:27:27,648 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 15 [2024-09-25 10:27:27,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:27:27,648 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-09-25 10:27:27,649 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:27,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:27,649 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2024-09-25 10:27:27,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:27:27,649 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:27:27,649 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:27:27,649 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:27:27,650 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:27:27,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:27,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1680996671, now seen corresponding path program 1 times [2024-09-25 10:27:27,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:27:27,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042730070] [2024-09-25 10:27:27,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:27,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:27:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:27,699 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:27:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:27,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:27:27,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:27:27,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042730070] [2024-09-25 10:27:27,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042730070] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:27:27,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:27:27,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:27:27,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985670691] [2024-09-25 10:27:27,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:27:27,706 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:27:27,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:27:27,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:27:27,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:27:27,707 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:27,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:27:27,730 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2024-09-25 10:27:27,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:27:27,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-25 10:27:27,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:27:27,731 INFO L225 Difference]: With dead ends: 34 [2024-09-25 10:27:27,732 INFO L226 Difference]: Without dead ends: 27 [2024-09-25 10:27:27,733 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-25 10:27:27,734 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:27:27,735 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 30 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:27:27,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-25 10:27:27,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2024-09-25 10:27:27,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2024-09-25 10:27:27,748 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 16 [2024-09-25 10:27:27,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:27:27,748 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2024-09-25 10:27:27,748 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:27,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2024-09-25 10:27:27,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:27:27,749 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:27:27,749 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:27:27,749 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 10:27:27,749 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:27:27,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:27,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1211142226, now seen corresponding path program 1 times [2024-09-25 10:27:27,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:27:27,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637402997] [2024-09-25 10:27:27,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:27,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:27:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:27,777 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:27:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:27,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:27:27,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:27:27,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637402997] [2024-09-25 10:27:27,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637402997] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:27:27,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:27:27,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:27:27,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73706181] [2024-09-25 10:27:27,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:27:27,783 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:27:27,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:27:27,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:27:27,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:27:27,784 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:27,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:27:27,807 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2024-09-25 10:27:27,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:27:27,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-25 10:27:27,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:27:27,809 INFO L225 Difference]: With dead ends: 39 [2024-09-25 10:27:27,809 INFO L226 Difference]: Without dead ends: 31 [2024-09-25 10:27:27,809 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-25 10:27:27,810 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:27:27,810 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 29 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:27:27,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-25 10:27:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-25 10:27:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2024-09-25 10:27:27,818 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2024-09-25 10:27:27,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:27:27,818 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2024-09-25 10:27:27,818 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:27,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2024-09-25 10:27:27,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:27:27,819 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:27:27,819 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:27:27,819 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-25 10:27:27,819 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:27:27,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:27,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1644628767, now seen corresponding path program 1 times [2024-09-25 10:27:27,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:27:27,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818499571] [2024-09-25 10:27:27,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:27,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:27:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:27,874 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:27:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:27,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:27:27,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:27:27,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818499571] [2024-09-25 10:27:27,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818499571] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:27:27,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:27:27,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-25 10:27:27,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651198414] [2024-09-25 10:27:27,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:27:27,881 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-25 10:27:27,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:27:27,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-25 10:27:27,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-25 10:27:27,884 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:27,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:27:27,924 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2024-09-25 10:27:27,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-25 10:27:27,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-25 10:27:27,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:27:27,925 INFO L225 Difference]: With dead ends: 43 [2024-09-25 10:27:27,925 INFO L226 Difference]: Without dead ends: 25 [2024-09-25 10:27:27,925 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:27:27,926 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:27:27,926 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 40 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:27:27,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-25 10:27:27,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-09-25 10:27:27,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:27,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2024-09-25 10:27:27,930 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 16 [2024-09-25 10:27:27,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:27:27,930 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2024-09-25 10:27:27,930 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:27,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:27,931 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2024-09-25 10:27:27,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:27:27,931 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:27:27,931 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:27:27,931 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-25 10:27:27,932 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:27:27,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:27,932 INFO L85 PathProgramCache]: Analyzing trace with hash -677262176, now seen corresponding path program 1 times [2024-09-25 10:27:27,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:27:27,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514195631] [2024-09-25 10:27:27,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:27,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:27:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:27,989 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:27:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:27,994 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-25 10:27:27,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:27:27,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514195631] [2024-09-25 10:27:27,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514195631] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:27:27,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725801347] [2024-09-25 10:27:27,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:27,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:27,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:27:27,999 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-25 10:27:28,006 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-25 10:27:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:28,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:27:28,048 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:27:28,073 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-25 10:27:28,075 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:27:28,127 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-25 10:27:28,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725801347] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:27:28,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:27:28,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-09-25 10:27:28,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479585740] [2024-09-25 10:27:28,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:27:28,129 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 10:27:28,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:27:28,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 10:27:28,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:27:28,131 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:28,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:27:28,241 INFO L93 Difference]: Finished difference Result 74 states and 113 transitions. [2024-09-25 10:27:28,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 10:27:28,245 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-25 10:27:28,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:27:28,246 INFO L225 Difference]: With dead ends: 74 [2024-09-25 10:27:28,246 INFO L226 Difference]: Without dead ends: 60 [2024-09-25 10:27:28,246 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-09-25 10:27:28,247 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 38 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:27:28,247 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 87 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:27:28,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-25 10:27:28,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 37. [2024-09-25 10:27:28,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:28,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2024-09-25 10:27:28,258 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 16 [2024-09-25 10:27:28,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:27:28,258 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2024-09-25 10:27:28,259 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:28,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:28,259 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2024-09-25 10:27:28,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-25 10:27:28,262 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:27:28,262 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:27:28,275 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 10:27:28,466 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-25 10:27:28,467 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:27:28,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:28,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1860399215, now seen corresponding path program 1 times [2024-09-25 10:27:28,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:27:28,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229081225] [2024-09-25 10:27:28,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:28,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:27:28,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:28,613 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:27:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:28,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:27:28,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:27:28,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229081225] [2024-09-25 10:27:28,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229081225] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:27:28,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862668415] [2024-09-25 10:27:28,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:28,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:28,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:27:28,638 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-25 10:27:28,639 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-25 10:27:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:28,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-25 10:27:28,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:27:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:27:28,688 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:27:28,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:27:28,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862668415] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:27:28,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:27:28,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2024-09-25 10:27:28,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643975953] [2024-09-25 10:27:28,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:27:28,801 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 10:27:28,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:27:28,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 10:27:28,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:27:28,802 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:29,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:27:29,160 INFO L93 Difference]: Finished difference Result 91 states and 140 transitions. [2024-09-25 10:27:29,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-09-25 10:27:29,161 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-09-25 10:27:29,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:27:29,162 INFO L225 Difference]: With dead ends: 91 [2024-09-25 10:27:29,162 INFO L226 Difference]: Without dead ends: 81 [2024-09-25 10:27:29,162 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2024-09-25 10:27:29,163 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 67 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:27:29,163 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 97 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:27:29,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-09-25 10:27:29,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 44. [2024-09-25 10:27:29,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 39 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2024-09-25 10:27:29,176 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 18 [2024-09-25 10:27:29,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:27:29,176 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2024-09-25 10:27:29,176 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:29,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:29,177 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2024-09-25 10:27:29,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-25 10:27:29,177 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:27:29,177 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:27:29,190 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-25 10:27:29,377 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-25 10:27:29,378 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:27:29,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:29,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1802263027, now seen corresponding path program 1 times [2024-09-25 10:27:29,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:27:29,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751116295] [2024-09-25 10:27:29,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:29,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:27:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:29,480 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:27:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 10:27:29,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:27:29,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751116295] [2024-09-25 10:27:29,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751116295] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:27:29,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332599023] [2024-09-25 10:27:29,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:29,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:29,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:27:29,484 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:27:29,485 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 10:27:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:29,514 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 10:27:29,515 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:27:29,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 10:27:29,544 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:27:29,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 10:27:29,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332599023] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:27:29,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:27:29,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-09-25 10:27:29,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504120743] [2024-09-25 10:27:29,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:27:29,568 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-25 10:27:29,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:27:29,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-25 10:27:29,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-25 10:27:29,568 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:29,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:27:29,606 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2024-09-25 10:27:29,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-25 10:27:29,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-09-25 10:27:29,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:27:29,607 INFO L225 Difference]: With dead ends: 71 [2024-09-25 10:27:29,607 INFO L226 Difference]: Without dead ends: 62 [2024-09-25 10:27:29,608 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-25 10:27:29,608 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:27:29,608 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 46 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:27:29,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-09-25 10:27:29,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2024-09-25 10:27:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.469387755102041) internal successors, (72), 49 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:29,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 76 transitions. [2024-09-25 10:27:29,618 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 76 transitions. Word has length 19 [2024-09-25 10:27:29,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:27:29,618 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 76 transitions. [2024-09-25 10:27:29,619 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:29,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:29,619 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 76 transitions. [2024-09-25 10:27:29,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-25 10:27:29,619 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:27:29,619 INFO L216 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:27:29,632 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 10:27:29,823 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-25 10:27:29,824 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:27:29,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:29,824 INFO L85 PathProgramCache]: Analyzing trace with hash -211671636, now seen corresponding path program 2 times [2024-09-25 10:27:29,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:27:29,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003381134] [2024-09-25 10:27:29,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:29,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:27:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:29,887 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:27:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:29,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:27:29,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:27:29,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003381134] [2024-09-25 10:27:29,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003381134] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:27:29,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818254648] [2024-09-25 10:27:29,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:27:29,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:29,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:27:29,891 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:27:29,893 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 10:27:29,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:27:29,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:27:29,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-25 10:27:29,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:27:29,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:27:29,945 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:27:30,036 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:27:30,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818254648] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:27:30,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:27:30,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-09-25 10:27:30,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687210539] [2024-09-25 10:27:30,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:27:30,037 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-25 10:27:30,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:27:30,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-25 10:27:30,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-09-25 10:27:30,038 INFO L87 Difference]: Start difference. First operand 54 states and 76 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:30,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:27:30,577 INFO L93 Difference]: Finished difference Result 224 states and 356 transitions. [2024-09-25 10:27:30,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-25 10:27:30,577 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-09-25 10:27:30,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:27:30,578 INFO L225 Difference]: With dead ends: 224 [2024-09-25 10:27:30,578 INFO L226 Difference]: Without dead ends: 200 [2024-09-25 10:27:30,579 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=301, Invalid=691, Unknown=0, NotChecked=0, Total=992 [2024-09-25 10:27:30,579 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 226 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:27:30,579 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 270 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:27:30,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-09-25 10:27:30,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 81. [2024-09-25 10:27:30,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 76 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:30,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 114 transitions. [2024-09-25 10:27:30,609 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 114 transitions. Word has length 19 [2024-09-25 10:27:30,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:27:30,609 INFO L474 AbstractCegarLoop]: Abstraction has 81 states and 114 transitions. [2024-09-25 10:27:30,609 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:30,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:30,609 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 114 transitions. [2024-09-25 10:27:30,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-25 10:27:30,610 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:27:30,610 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] [2024-09-25 10:27:30,625 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 10:27:30,810 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:30,811 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:27:30,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:30,811 INFO L85 PathProgramCache]: Analyzing trace with hash 537966210, now seen corresponding path program 1 times [2024-09-25 10:27:30,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:27:30,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254785415] [2024-09-25 10:27:30,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:30,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:27:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:30,971 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:27:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 10:27:30,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:27:30,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254785415] [2024-09-25 10:27:30,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254785415] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:27:30,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499806242] [2024-09-25 10:27:30,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:30,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:30,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:27:30,975 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:27:30,976 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 10:27:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:31,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-25 10:27:31,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:27:31,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 10:27:31,129 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:27:31,209 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 10:27:31,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499806242] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:27:31,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:27:31,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 14 [2024-09-25 10:27:31,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22084371] [2024-09-25 10:27:31,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:27:31,210 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-25 10:27:31,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:27:31,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-25 10:27:31,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-09-25 10:27:31,211 INFO L87 Difference]: Start difference. First operand 81 states and 114 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:31,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:27:31,293 INFO L93 Difference]: Finished difference Result 95 states and 129 transitions. [2024-09-25 10:27:31,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 10:27:31,294 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-09-25 10:27:31,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:27:31,295 INFO L225 Difference]: With dead ends: 95 [2024-09-25 10:27:31,295 INFO L226 Difference]: Without dead ends: 75 [2024-09-25 10:27:31,295 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-09-25 10:27:31,296 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:27:31,296 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:27:31,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-09-25 10:27:31,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2024-09-25 10:27:31,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 68 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:31,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 104 transitions. [2024-09-25 10:27:31,311 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 104 transitions. Word has length 20 [2024-09-25 10:27:31,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:27:31,311 INFO L474 AbstractCegarLoop]: Abstraction has 73 states and 104 transitions. [2024-09-25 10:27:31,311 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:31,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:31,311 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 104 transitions. [2024-09-25 10:27:31,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-25 10:27:31,312 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:27:31,312 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:27:31,326 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 10:27:31,516 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-25 10:27:31,516 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:27:31,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:31,517 INFO L85 PathProgramCache]: Analyzing trace with hash 548739116, now seen corresponding path program 1 times [2024-09-25 10:27:31,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:27:31,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304568444] [2024-09-25 10:27:31,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:31,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:27:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:31,578 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:27:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:31,580 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:27:31,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:27:31,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304568444] [2024-09-25 10:27:31,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304568444] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:27:31,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960074941] [2024-09-25 10:27:31,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:31,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:31,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:27:31,582 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:27:31,583 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 10:27:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:31,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-25 10:27:31,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:27:31,647 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:27:31,647 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:27:31,703 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:27:31,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960074941] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:27:31,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:27:31,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2024-09-25 10:27:31,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83520738] [2024-09-25 10:27:31,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:27:31,704 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 10:27:31,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:27:31,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 10:27:31,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-09-25 10:27:31,704 INFO L87 Difference]: Start difference. First operand 73 states and 104 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:31,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:27:31,834 INFO L93 Difference]: Finished difference Result 115 states and 164 transitions. [2024-09-25 10:27:31,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-25 10:27:31,834 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-25 10:27:31,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:27:31,835 INFO L225 Difference]: With dead ends: 115 [2024-09-25 10:27:31,835 INFO L226 Difference]: Without dead ends: 95 [2024-09-25 10:27:31,835 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-09-25 10:27:31,836 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 32 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:27:31,836 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 118 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:27:31,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-09-25 10:27:31,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 67. [2024-09-25 10:27:31,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 62 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:31,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2024-09-25 10:27:31,849 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 21 [2024-09-25 10:27:31,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:27:31,849 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2024-09-25 10:27:31,850 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:31,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:31,850 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2024-09-25 10:27:31,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-25 10:27:31,850 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:27:31,851 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:27:31,863 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-25 10:27:32,054 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-25 10:27:32,055 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:27:32,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:32,055 INFO L85 PathProgramCache]: Analyzing trace with hash 47519372, now seen corresponding path program 2 times [2024-09-25 10:27:32,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:27:32,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860040201] [2024-09-25 10:27:32,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:32,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:27:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:32,123 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:27:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:32,125 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:27:32,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:27:32,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860040201] [2024-09-25 10:27:32,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860040201] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:27:32,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309235287] [2024-09-25 10:27:32,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:27:32,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:32,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:27:32,127 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:27:32,128 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-25 10:27:32,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:27:32,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:27:32,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-25 10:27:32,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:27:32,214 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:27:32,214 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:27:32,264 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:27:32,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309235287] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:27:32,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:27:32,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2024-09-25 10:27:32,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304897795] [2024-09-25 10:27:32,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:27:32,265 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-25 10:27:32,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:27:32,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-25 10:27:32,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-09-25 10:27:32,266 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:32,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:27:32,587 INFO L93 Difference]: Finished difference Result 125 states and 185 transitions. [2024-09-25 10:27:32,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-25 10:27:32,589 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-25 10:27:32,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:27:32,590 INFO L225 Difference]: With dead ends: 125 [2024-09-25 10:27:32,590 INFO L226 Difference]: Without dead ends: 111 [2024-09-25 10:27:32,590 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2024-09-25 10:27:32,590 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 47 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:27:32,591 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 151 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:27:32,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-09-25 10:27:32,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 87. [2024-09-25 10:27:32,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 82 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:32,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 120 transitions. [2024-09-25 10:27:32,627 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 120 transitions. Word has length 21 [2024-09-25 10:27:32,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:27:32,627 INFO L474 AbstractCegarLoop]: Abstraction has 87 states and 120 transitions. [2024-09-25 10:27:32,627 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:32,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:32,628 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 120 transitions. [2024-09-25 10:27:32,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-25 10:27:32,631 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:27:32,631 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:27:32,643 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-25 10:27:32,831 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:32,832 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:27:32,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:32,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1261948831, now seen corresponding path program 2 times [2024-09-25 10:27:32,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:27:32,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192213898] [2024-09-25 10:27:32,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:32,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:27:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:32,896 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:27:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:32,902 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-25 10:27:32,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:27:32,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192213898] [2024-09-25 10:27:32,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192213898] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:27:32,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150278808] [2024-09-25 10:27:32,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:27:32,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:32,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:27:32,906 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:27:32,914 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-25 10:27:32,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:27:32,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:27:32,949 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-25 10:27:32,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:27:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-25 10:27:33,011 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:27:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-25 10:27:33,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150278808] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:27:33,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:27:33,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-09-25 10:27:33,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359944573] [2024-09-25 10:27:33,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:27:33,052 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 10:27:33,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:27:33,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 10:27:33,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:27:33,052 INFO L87 Difference]: Start difference. First operand 87 states and 120 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:33,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:27:33,175 INFO L93 Difference]: Finished difference Result 176 states and 262 transitions. [2024-09-25 10:27:33,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 10:27:33,176 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-09-25 10:27:33,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:27:33,177 INFO L225 Difference]: With dead ends: 176 [2024-09-25 10:27:33,177 INFO L226 Difference]: Without dead ends: 162 [2024-09-25 10:27:33,177 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:27:33,177 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 32 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:27:33,177 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 91 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:27:33,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-09-25 10:27:33,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 130. [2024-09-25 10:27:33,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 125 states have (on average 1.432) internal successors, (179), 125 states have internal predecessors, (179), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 183 transitions. [2024-09-25 10:27:33,219 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 183 transitions. Word has length 24 [2024-09-25 10:27:33,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:27:33,220 INFO L474 AbstractCegarLoop]: Abstraction has 130 states and 183 transitions. [2024-09-25 10:27:33,220 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:33,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:33,220 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 183 transitions. [2024-09-25 10:27:33,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-25 10:27:33,222 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:27:33,222 INFO L216 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:27:33,235 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-25 10:27:33,423 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:33,423 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:27:33,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:33,424 INFO L85 PathProgramCache]: Analyzing trace with hash 453474690, now seen corresponding path program 3 times [2024-09-25 10:27:33,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:27:33,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922690279] [2024-09-25 10:27:33,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:33,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:27:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:33,520 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:27:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:33,522 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:27:33,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:27:33,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922690279] [2024-09-25 10:27:33,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922690279] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:27:33,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899852832] [2024-09-25 10:27:33,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:27:33,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:33,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:27:33,527 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:27:33,529 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-25 10:27:33,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-25 10:27:33,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:27:33,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-25 10:27:33,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:27:33,581 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:27:33,581 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:27:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:27:33,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899852832] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:27:33,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:27:33,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2024-09-25 10:27:33,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939065246] [2024-09-25 10:27:33,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:27:33,684 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-25 10:27:33,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:27:33,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-25 10:27:33,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2024-09-25 10:27:33,685 INFO L87 Difference]: Start difference. First operand 130 states and 183 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:35,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:27:35,159 INFO L93 Difference]: Finished difference Result 373 states and 573 transitions. [2024-09-25 10:27:35,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-09-25 10:27:35,160 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-09-25 10:27:35,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:27:35,162 INFO L225 Difference]: With dead ends: 373 [2024-09-25 10:27:35,162 INFO L226 Difference]: Without dead ends: 326 [2024-09-25 10:27:35,163 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1369 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1148, Invalid=3142, Unknown=0, NotChecked=0, Total=4290 [2024-09-25 10:27:35,164 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 362 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:27:35,164 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 399 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 10:27:35,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-09-25 10:27:35,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 160. [2024-09-25 10:27:35,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 155 states have (on average 1.4387096774193548) internal successors, (223), 155 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:35,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 227 transitions. [2024-09-25 10:27:35,211 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 227 transitions. Word has length 24 [2024-09-25 10:27:35,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:27:35,212 INFO L474 AbstractCegarLoop]: Abstraction has 160 states and 227 transitions. [2024-09-25 10:27:35,212 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:35,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:35,212 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 227 transitions. [2024-09-25 10:27:35,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-25 10:27:35,212 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:27:35,213 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:27:35,224 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-25 10:27:35,413 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-25 10:27:35,413 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:27:35,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:35,413 INFO L85 PathProgramCache]: Analyzing trace with hash -931809812, now seen corresponding path program 4 times [2024-09-25 10:27:35,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:27:35,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006821892] [2024-09-25 10:27:35,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:35,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:27:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:35,644 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:27:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:35,646 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:27:35,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:27:35,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006821892] [2024-09-25 10:27:35,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006821892] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:27:35,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406704008] [2024-09-25 10:27:35,646 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:27:35,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:35,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:27:35,648 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:27:35,651 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-25 10:27:35,682 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:27:35,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:27:35,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-25 10:27:35,684 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:27:35,725 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:27:35,725 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:27:35,831 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:27:35,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406704008] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:27:35,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:27:35,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 16 [2024-09-25 10:27:35,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723834974] [2024-09-25 10:27:35,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:27:35,834 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-25 10:27:35,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:27:35,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-25 10:27:35,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-09-25 10:27:35,835 INFO L87 Difference]: Start difference. First operand 160 states and 227 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:35,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:27:35,947 INFO L93 Difference]: Finished difference Result 166 states and 232 transitions. [2024-09-25 10:27:35,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 10:27:35,948 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-09-25 10:27:35,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:27:35,949 INFO L225 Difference]: With dead ends: 166 [2024-09-25 10:27:35,949 INFO L226 Difference]: Without dead ends: 148 [2024-09-25 10:27:35,949 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-09-25 10:27:35,950 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:27:35,950 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 111 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:27:35,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-09-25 10:27:36,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-09-25 10:27:36,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.4685314685314685) internal successors, (210), 143 states have internal predecessors, (210), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:36,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 214 transitions. [2024-09-25 10:27:36,009 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 214 transitions. Word has length 25 [2024-09-25 10:27:36,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:27:36,009 INFO L474 AbstractCegarLoop]: Abstraction has 148 states and 214 transitions. [2024-09-25 10:27:36,009 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:36,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:36,010 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 214 transitions. [2024-09-25 10:27:36,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-25 10:27:36,010 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:27:36,010 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:27:36,028 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-09-25 10:27:36,214 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-25 10:27:36,215 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:27:36,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:36,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1117230082, now seen corresponding path program 2 times [2024-09-25 10:27:36,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:27:36,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407541857] [2024-09-25 10:27:36,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:36,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:27:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:36,324 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:27:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-25 10:27:36,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:27:36,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407541857] [2024-09-25 10:27:36,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407541857] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:27:36,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891040430] [2024-09-25 10:27:36,329 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:27:36,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:36,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:27:36,334 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:27:36,335 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-25 10:27:36,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:27:36,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:27:36,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-25 10:27:36,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:27:36,407 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-25 10:27:36,407 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:27:36,489 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-25 10:27:36,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891040430] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:27:36,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:27:36,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2024-09-25 10:27:36,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033134935] [2024-09-25 10:27:36,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:27:36,490 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-25 10:27:36,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:27:36,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-25 10:27:36,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-09-25 10:27:36,491 INFO L87 Difference]: Start difference. First operand 148 states and 214 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:36,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:27:36,766 INFO L93 Difference]: Finished difference Result 223 states and 312 transitions. [2024-09-25 10:27:36,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-25 10:27:36,767 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-09-25 10:27:36,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:27:36,768 INFO L225 Difference]: With dead ends: 223 [2024-09-25 10:27:36,768 INFO L226 Difference]: Without dead ends: 189 [2024-09-25 10:27:36,768 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2024-09-25 10:27:36,768 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 49 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:27:36,769 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 216 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:27:36,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-09-25 10:27:36,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 138. [2024-09-25 10:27:36,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 133 states have (on average 1.4511278195488722) internal successors, (193), 133 states have internal predecessors, (193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:36,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 197 transitions. [2024-09-25 10:27:36,798 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 197 transitions. Word has length 25 [2024-09-25 10:27:36,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:27:36,798 INFO L474 AbstractCegarLoop]: Abstraction has 138 states and 197 transitions. [2024-09-25 10:27:36,798 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:36,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:36,798 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 197 transitions. [2024-09-25 10:27:36,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-25 10:27:36,799 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:27:36,799 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:27:36,811 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-09-25 10:27:37,002 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-25 10:27:37,002 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:27:37,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:37,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1301171089, now seen corresponding path program 3 times [2024-09-25 10:27:37,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:27:37,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279713669] [2024-09-25 10:27:37,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:37,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:27:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:37,100 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:27:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:27:37,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:27:37,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279713669] [2024-09-25 10:27:37,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279713669] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:27:37,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284240617] [2024-09-25 10:27:37,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:27:37,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:37,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:27:37,105 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:27:37,106 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-09-25 10:27:37,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-25 10:27:37,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:27:37,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-25 10:27:37,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:27:37,206 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-25 10:27:37,206 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:27:37,293 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-25 10:27:37,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284240617] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:27:37,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:27:37,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 15 [2024-09-25 10:27:37,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869388037] [2024-09-25 10:27:37,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:27:37,294 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-25 10:27:37,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:27:37,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-25 10:27:37,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2024-09-25 10:27:37,295 INFO L87 Difference]: Start difference. First operand 138 states and 197 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:37,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:27:37,758 INFO L93 Difference]: Finished difference Result 202 states and 287 transitions. [2024-09-25 10:27:37,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-25 10:27:37,758 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-09-25 10:27:37,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:27:37,760 INFO L225 Difference]: With dead ends: 202 [2024-09-25 10:27:37,760 INFO L226 Difference]: Without dead ends: 186 [2024-09-25 10:27:37,760 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=1299, Unknown=0, NotChecked=0, Total=1482 [2024-09-25 10:27:37,761 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 45 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:27:37,761 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 188 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:27:37,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-09-25 10:27:37,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 160. [2024-09-25 10:27:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 155 states have (on average 1.4064516129032258) internal successors, (218), 155 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 222 transitions. [2024-09-25 10:27:37,812 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 222 transitions. Word has length 26 [2024-09-25 10:27:37,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:27:37,812 INFO L474 AbstractCegarLoop]: Abstraction has 160 states and 222 transitions. [2024-09-25 10:27:37,812 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:37,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:37,812 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 222 transitions. [2024-09-25 10:27:37,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-25 10:27:37,813 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:27:37,814 INFO L216 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:27:37,826 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-09-25 10:27:38,014 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-09-25 10:27:38,014 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:27:38,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:38,015 INFO L85 PathProgramCache]: Analyzing trace with hash -2140232672, now seen corresponding path program 3 times [2024-09-25 10:27:38,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:27:38,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897062393] [2024-09-25 10:27:38,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:38,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:27:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:38,221 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:27:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:38,223 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:27:38,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:27:38,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897062393] [2024-09-25 10:27:38,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897062393] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:27:38,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815230565] [2024-09-25 10:27:38,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:27:38,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:38,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:27:38,225 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:27:38,226 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-09-25 10:27:38,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-09-25 10:27:38,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:27:38,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-25 10:27:38,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:27:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:27:38,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:27:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:27:38,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815230565] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:27:38,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:27:38,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2024-09-25 10:27:38,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948635144] [2024-09-25 10:27:38,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:27:38,552 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-25 10:27:38,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:27:38,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-25 10:27:38,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=611, Unknown=0, NotChecked=0, Total=812 [2024-09-25 10:27:38,553 INFO L87 Difference]: Start difference. First operand 160 states and 222 transitions. Second operand has 29 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:41,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:27:41,880 INFO L93 Difference]: Finished difference Result 841 states and 1299 transitions. [2024-09-25 10:27:41,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-09-25 10:27:41,881 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-09-25 10:27:41,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:27:41,883 INFO L225 Difference]: With dead ends: 841 [2024-09-25 10:27:41,883 INFO L226 Difference]: Without dead ends: 791 [2024-09-25 10:27:41,884 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1575, Invalid=3537, Unknown=0, NotChecked=0, Total=5112 [2024-09-25 10:27:41,885 INFO L434 NwaCegarLoop]: 73 mSDtfsCounter, 1361 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:27:41,885 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 989 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-09-25 10:27:41,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-09-25 10:27:41,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 227. [2024-09-25 10:27:41,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 222 states have (on average 1.4009009009009008) internal successors, (311), 222 states have internal predecessors, (311), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:41,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 315 transitions. [2024-09-25 10:27:41,996 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 315 transitions. Word has length 26 [2024-09-25 10:27:41,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:27:41,997 INFO L474 AbstractCegarLoop]: Abstraction has 227 states and 315 transitions. [2024-09-25 10:27:41,997 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:41,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:41,997 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 315 transitions. [2024-09-25 10:27:41,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-25 10:27:41,998 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:27:41,998 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:27:42,010 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-09-25 10:27:42,201 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-09-25 10:27:42,202 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:27:42,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:42,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1872800161, now seen corresponding path program 3 times [2024-09-25 10:27:42,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:27:42,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095751448] [2024-09-25 10:27:42,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:42,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:27:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:42,299 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:27:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-25 10:27:42,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:27:42,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095751448] [2024-09-25 10:27:42,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095751448] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:27:42,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321288189] [2024-09-25 10:27:42,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:27:42,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:42,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:27:42,302 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:27:42,303 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-09-25 10:27:42,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-25 10:27:42,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:27:42,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 10:27:42,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:27:42,406 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-25 10:27:42,406 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:27:42,500 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-25 10:27:42,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321288189] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:27:42,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:27:42,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 22 [2024-09-25 10:27:42,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034503076] [2024-09-25 10:27:42,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:27:42,501 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-25 10:27:42,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:27:42,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-25 10:27:42,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2024-09-25 10:27:42,502 INFO L87 Difference]: Start difference. First operand 227 states and 315 transitions. Second operand has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:27:43,337 INFO L93 Difference]: Finished difference Result 594 states and 780 transitions. [2024-09-25 10:27:43,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-09-25 10:27:43,338 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-09-25 10:27:43,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:27:43,340 INFO L225 Difference]: With dead ends: 594 [2024-09-25 10:27:43,340 INFO L226 Difference]: Without dead ends: 566 [2024-09-25 10:27:43,340 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=533, Invalid=1819, Unknown=0, NotChecked=0, Total=2352 [2024-09-25 10:27:43,341 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 127 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:27:43,341 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 297 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 10:27:43,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-09-25 10:27:43,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 331. [2024-09-25 10:27:43,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 326 states have (on average 1.4049079754601228) internal successors, (458), 326 states have internal predecessors, (458), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:43,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 462 transitions. [2024-09-25 10:27:43,470 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 462 transitions. Word has length 28 [2024-09-25 10:27:43,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:27:43,470 INFO L474 AbstractCegarLoop]: Abstraction has 331 states and 462 transitions. [2024-09-25 10:27:43,470 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:43,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:43,471 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 462 transitions. [2024-09-25 10:27:43,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-25 10:27:43,471 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:27:43,471 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:27:43,487 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-09-25 10:27:43,672 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:43,672 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:27:43,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:43,672 INFO L85 PathProgramCache]: Analyzing trace with hash 398019010, now seen corresponding path program 5 times [2024-09-25 10:27:43,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:27:43,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948426767] [2024-09-25 10:27:43,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:43,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:27:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:43,976 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:27:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:43,978 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 10:27:43,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:27:43,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948426767] [2024-09-25 10:27:43,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948426767] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:27:43,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754455524] [2024-09-25 10:27:43,978 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 10:27:43,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:43,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:27:43,980 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:27:43,981 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-09-25 10:27:44,020 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-09-25 10:27:44,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:27:44,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-25 10:27:44,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:27:44,084 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 10:27:44,084 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:27:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 10:27:44,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754455524] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:27:44,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:27:44,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 20 [2024-09-25 10:27:44,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283076817] [2024-09-25 10:27:44,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:27:44,228 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-25 10:27:44,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:27:44,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-25 10:27:44,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2024-09-25 10:27:44,229 INFO L87 Difference]: Start difference. First operand 331 states and 462 transitions. Second operand has 20 states, 20 states have (on average 3.2) internal successors, (64), 18 states have internal predecessors, (64), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:48,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-25 10:27:48,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:27:48,526 INFO L93 Difference]: Finished difference Result 344 states and 475 transitions. [2024-09-25 10:27:48,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-25 10:27:48,526 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.2) internal successors, (64), 18 states have internal predecessors, (64), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-09-25 10:27:48,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:27:48,528 INFO L225 Difference]: With dead ends: 344 [2024-09-25 10:27:48,528 INFO L226 Difference]: Without dead ends: 335 [2024-09-25 10:27:48,528 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2024-09-25 10:27:48,529 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:27:48,529 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 100 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-09-25 10:27:48,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-09-25 10:27:48,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2024-09-25 10:27:48,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 327 states have (on average 1.4036697247706422) internal successors, (459), 327 states have internal predecessors, (459), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:48,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 463 transitions. [2024-09-25 10:27:48,669 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 463 transitions. Word has length 30 [2024-09-25 10:27:48,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:27:48,669 INFO L474 AbstractCegarLoop]: Abstraction has 332 states and 463 transitions. [2024-09-25 10:27:48,670 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.2) internal successors, (64), 18 states have internal predecessors, (64), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:48,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:48,670 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 463 transitions. [2024-09-25 10:27:48,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-25 10:27:48,670 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:27:48,670 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:27:48,684 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-09-25 10:27:48,874 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:48,875 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:27:48,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:48,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1118269741, now seen corresponding path program 6 times [2024-09-25 10:27:48,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:27:48,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375542220] [2024-09-25 10:27:48,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:48,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:27:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:48,965 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:27:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-25 10:27:48,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:27:48,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375542220] [2024-09-25 10:27:48,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375542220] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:27:48,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345725730] [2024-09-25 10:27:48,968 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-25 10:27:48,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:48,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:27:48,970 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:27:48,971 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-09-25 10:27:49,006 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-09-25 10:27:49,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:27:49,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-25 10:27:49,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:27:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-25 10:27:49,032 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:27:49,081 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-25 10:27:49,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345725730] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:27:49,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:27:49,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-09-25 10:27:49,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336469568] [2024-09-25 10:27:49,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:27:49,082 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:27:49,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:27:49,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:27:49,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:27:49,082 INFO L87 Difference]: Start difference. First operand 332 states and 463 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:49,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:27:49,270 INFO L93 Difference]: Finished difference Result 393 states and 542 transitions. [2024-09-25 10:27:49,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:27:49,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-09-25 10:27:49,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:27:49,272 INFO L225 Difference]: With dead ends: 393 [2024-09-25 10:27:49,272 INFO L226 Difference]: Without dead ends: 361 [2024-09-25 10:27:49,273 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:27:49,273 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:27:49,273 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 125 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:27:49,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-09-25 10:27:49,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 333. [2024-09-25 10:27:49,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 328 states have (on average 1.399390243902439) internal successors, (459), 328 states have internal predecessors, (459), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:49,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 463 transitions. [2024-09-25 10:27:49,408 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 463 transitions. Word has length 31 [2024-09-25 10:27:49,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:27:49,408 INFO L474 AbstractCegarLoop]: Abstraction has 333 states and 463 transitions. [2024-09-25 10:27:49,408 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:49,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:49,409 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 463 transitions. [2024-09-25 10:27:49,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-25 10:27:49,409 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:27:49,409 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:27:49,421 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-09-25 10:27:49,613 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:49,614 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:27:49,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:49,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1904854835, now seen corresponding path program 2 times [2024-09-25 10:27:49,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:27:49,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849156369] [2024-09-25 10:27:49,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:49,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:27:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:49,773 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:27:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:49,774 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:27:49,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:27:49,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849156369] [2024-09-25 10:27:49,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849156369] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:27:49,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926371520] [2024-09-25 10:27:49,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:27:49,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:49,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:27:49,777 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:27:49,778 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-09-25 10:27:49,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:27:49,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:27:49,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-09-25 10:27:49,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:27:49,834 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:27:49,834 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:27:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-25 10:27:49,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926371520] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:27:49,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:27:49,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 8] total 21 [2024-09-25 10:27:49,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286544451] [2024-09-25 10:27:49,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:27:49,948 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-25 10:27:49,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:27:49,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-25 10:27:49,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2024-09-25 10:27:49,949 INFO L87 Difference]: Start difference. First operand 333 states and 463 transitions. Second operand has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:51,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:27:51,040 INFO L93 Difference]: Finished difference Result 556 states and 735 transitions. [2024-09-25 10:27:51,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-09-25 10:27:51,041 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-09-25 10:27:51,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:27:51,042 INFO L225 Difference]: With dead ends: 556 [2024-09-25 10:27:51,042 INFO L226 Difference]: Without dead ends: 533 [2024-09-25 10:27:51,043 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=811, Invalid=3221, Unknown=0, NotChecked=0, Total=4032 [2024-09-25 10:27:51,044 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 150 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-25 10:27:51,044 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 322 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-25 10:27:51,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-09-25 10:27:51,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 351. [2024-09-25 10:27:51,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 346 states have (on average 1.3815028901734103) internal successors, (478), 346 states have internal predecessors, (478), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:51,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 482 transitions. [2024-09-25 10:27:51,195 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 482 transitions. Word has length 31 [2024-09-25 10:27:51,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:27:51,195 INFO L474 AbstractCegarLoop]: Abstraction has 351 states and 482 transitions. [2024-09-25 10:27:51,195 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:27:51,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:51,196 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 482 transitions. [2024-09-25 10:27:51,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-25 10:27:51,196 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:27:51,196 INFO L216 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:27:51,208 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-09-25 10:27:51,397 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:51,397 INFO L399 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:27:51,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:27:51,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1643388018, now seen corresponding path program 7 times [2024-09-25 10:27:51,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:27:51,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311690812] [2024-09-25 10:27:51,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:27:51,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:27:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:51,587 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:27:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:27:51,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:27:51,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311690812] [2024-09-25 10:27:51,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311690812] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:27:51,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982047832] [2024-09-25 10:27:51,590 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-25 10:27:51,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:51,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:27:51,593 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:27:51,596 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-09-25 10:27:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:51,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-25 10:27:51,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:27:51,663 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:27:51,663 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:27:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:27:51,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982047832] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:27:51,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:27:51,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2024-09-25 10:27:51,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691070359] [2024-09-25 10:27:51,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:27:51,998 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-09-25 10:27:51,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:27:51,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-09-25 10:27:51,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=818, Unknown=0, NotChecked=0, Total=1056 [2024-09-25 10:27:51,999 INFO L87 Difference]: Start difference. First operand 351 states and 482 transitions. Second operand has 33 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:28:02,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:28:02,011 INFO L93 Difference]: Finished difference Result 1398 states and 2123 transitions. [2024-09-25 10:28:02,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2024-09-25 10:28:02,011 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-09-25 10:28:02,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:28:02,015 INFO L225 Difference]: With dead ends: 1398 [2024-09-25 10:28:02,015 INFO L226 Difference]: Without dead ends: 1291 [2024-09-25 10:28:02,018 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7001 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=5082, Invalid=13550, Unknown=0, NotChecked=0, Total=18632 [2024-09-25 10:28:02,023 INFO L434 NwaCegarLoop]: 81 mSDtfsCounter, 1326 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 605 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 605 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-09-25 10:28:02,023 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 1314 Invalid, 1809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [605 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-09-25 10:28:02,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2024-09-25 10:28:02,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 382. [2024-09-25 10:28:02,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 377 states have (on average 1.389920424403183) internal successors, (524), 377 states have internal predecessors, (524), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:28:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 528 transitions. [2024-09-25 10:28:02,228 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 528 transitions. Word has length 31 [2024-09-25 10:28:02,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:28:02,228 INFO L474 AbstractCegarLoop]: Abstraction has 382 states and 528 transitions. [2024-09-25 10:28:02,228 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:28:02,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:28:02,229 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 528 transitions. [2024-09-25 10:28:02,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-25 10:28:02,229 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:28:02,229 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:28:02,241 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-09-25 10:28:02,433 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-09-25 10:28:02,433 INFO L399 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:28:02,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:28:02,434 INFO L85 PathProgramCache]: Analyzing trace with hash -737150836, now seen corresponding path program 8 times [2024-09-25 10:28:02,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:28:02,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899594080] [2024-09-25 10:28:02,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:28:02,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:28:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:28:02,593 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:28:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:28:02,595 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-09-25 10:28:02,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:28:02,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899594080] [2024-09-25 10:28:02,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899594080] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:28:02,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300039726] [2024-09-25 10:28:02,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:28:02,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:28:02,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:28:02,599 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:28:02,603 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-09-25 10:28:02,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:28:02,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:28:02,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-25 10:28:02,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:28:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-09-25 10:28:02,719 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:28:02,827 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-09-25 10:28:02,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300039726] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:28:02,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:28:02,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2024-09-25 10:28:02,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859367711] [2024-09-25 10:28:02,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:28:02,828 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-25 10:28:02,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:28:02,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-25 10:28:02,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-09-25 10:28:02,829 INFO L87 Difference]: Start difference. First operand 382 states and 528 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:28:07,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-25 10:28:07,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:28:07,556 INFO L93 Difference]: Finished difference Result 741 states and 1098 transitions. [2024-09-25 10:28:07,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-25 10:28:07,557 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2024-09-25 10:28:07,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:28:07,559 INFO L225 Difference]: With dead ends: 741 [2024-09-25 10:28:07,559 INFO L226 Difference]: Without dead ends: 719 [2024-09-25 10:28:07,559 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2024-09-25 10:28:07,560 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 113 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 77 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:28:07,560 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 161 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 94 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-09-25 10:28:07,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-09-25 10:28:07,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 529. [2024-09-25 10:28:07,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 524 states have (on average 1.4312977099236641) internal successors, (750), 524 states have internal predecessors, (750), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:28:07,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 754 transitions. [2024-09-25 10:28:07,862 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 754 transitions. Word has length 33 [2024-09-25 10:28:07,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:28:07,863 INFO L474 AbstractCegarLoop]: Abstraction has 529 states and 754 transitions. [2024-09-25 10:28:07,863 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:28:07,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:28:07,864 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 754 transitions. [2024-09-25 10:28:07,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-25 10:28:07,864 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:28:07,864 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:28:07,876 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-09-25 10:28:08,065 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-09-25 10:28:08,065 INFO L399 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:28:08,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:28:08,066 INFO L85 PathProgramCache]: Analyzing trace with hash 434530706, now seen corresponding path program 9 times [2024-09-25 10:28:08,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:28:08,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020795141] [2024-09-25 10:28:08,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:28:08,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:28:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:28:08,193 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:28:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:28:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-25 10:28:08,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:28:08,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020795141] [2024-09-25 10:28:08,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020795141] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:28:08,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124996807] [2024-09-25 10:28:08,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:28:08,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:28:08,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:28:08,197 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:28:08,198 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-09-25 10:28:08,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-25 10:28:08,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:28:08,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-25 10:28:08,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:28:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-25 10:28:08,312 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:28:08,466 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-09-25 10:28:08,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124996807] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:28:08,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:28:08,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 25 [2024-09-25 10:28:08,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889500975] [2024-09-25 10:28:08,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:28:08,466 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-25 10:28:08,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:28:08,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-25 10:28:08,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2024-09-25 10:28:08,467 INFO L87 Difference]: Start difference. First operand 529 states and 754 transitions. Second operand has 25 states, 25 states have (on average 1.6) internal successors, (40), 25 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:28:09,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:28:09,659 INFO L93 Difference]: Finished difference Result 805 states and 1088 transitions. [2024-09-25 10:28:09,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-09-25 10:28:09,660 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.6) internal successors, (40), 25 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2024-09-25 10:28:09,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:28:09,662 INFO L225 Difference]: With dead ends: 805 [2024-09-25 10:28:09,662 INFO L226 Difference]: Without dead ends: 703 [2024-09-25 10:28:09,663 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=301, Invalid=1955, Unknown=0, NotChecked=0, Total=2256 [2024-09-25 10:28:09,663 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 91 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:28:09,664 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 494 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 10:28:09,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2024-09-25 10:28:09,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 497. [2024-09-25 10:28:09,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 492 states have (on average 1.4166666666666667) internal successors, (697), 492 states have internal predecessors, (697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:28:09,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 701 transitions. [2024-09-25 10:28:09,966 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 701 transitions. Word has length 34 [2024-09-25 10:28:09,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:28:09,966 INFO L474 AbstractCegarLoop]: Abstraction has 497 states and 701 transitions. [2024-09-25 10:28:09,966 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.6) internal successors, (40), 25 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:28:09,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:28:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 701 transitions. [2024-09-25 10:28:09,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-25 10:28:09,968 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:28:09,968 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:28:09,984 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-09-25 10:28:10,171 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-09-25 10:28:10,171 INFO L399 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:28:10,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:28:10,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1785638100, now seen corresponding path program 10 times [2024-09-25 10:28:10,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:28:10,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501854767] [2024-09-25 10:28:10,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:28:10,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:28:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:28:10,588 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:28:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:28:10,590 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-25 10:28:10,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:28:10,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501854767] [2024-09-25 10:28:10,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501854767] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:28:10,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289636654] [2024-09-25 10:28:10,591 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:28:10,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:28:10,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:28:10,592 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:28:10,594 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-09-25 10:28:10,673 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:28:10,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:28:10,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-09-25 10:28:10,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:28:10,773 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-25 10:28:10,773 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:28:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-25 10:28:10,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289636654] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:28:10,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:28:10,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 24 [2024-09-25 10:28:10,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563617311] [2024-09-25 10:28:10,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:28:10,944 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-25 10:28:10,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:28:10,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-25 10:28:10,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2024-09-25 10:28:10,946 INFO L87 Difference]: Start difference. First operand 497 states and 701 transitions. Second operand has 24 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 22 states have internal predecessors, (76), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:28:11,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:28:11,424 INFO L93 Difference]: Finished difference Result 512 states and 715 transitions. [2024-09-25 10:28:11,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-25 10:28:11,424 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 22 states have internal predecessors, (76), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2024-09-25 10:28:11,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:28:11,426 INFO L225 Difference]: With dead ends: 512 [2024-09-25 10:28:11,426 INFO L226 Difference]: Without dead ends: 486 [2024-09-25 10:28:11,426 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2024-09-25 10:28:11,427 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:28:11,427 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 155 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:28:11,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-09-25 10:28:11,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2024-09-25 10:28:11,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 481 states have (on average 1.4241164241164241) internal successors, (685), 481 states have internal predecessors, (685), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:28:11,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 689 transitions. [2024-09-25 10:28:11,710 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 689 transitions. Word has length 35 [2024-09-25 10:28:11,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:28:11,710 INFO L474 AbstractCegarLoop]: Abstraction has 486 states and 689 transitions. [2024-09-25 10:28:11,710 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 22 states have internal predecessors, (76), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:28:11,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:28:11,711 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 689 transitions. [2024-09-25 10:28:11,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-25 10:28:11,711 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:28:11,712 INFO L216 NwaCegarLoop]: trace histogram [8, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:28:11,723 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-09-25 10:28:11,912 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-09-25 10:28:11,912 INFO L399 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:28:11,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:28:11,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1273319442, now seen corresponding path program 3 times [2024-09-25 10:28:11,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:28:11,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181451332] [2024-09-25 10:28:11,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:28:11,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:28:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:28:12,093 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:28:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:28:12,095 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-09-25 10:28:12,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:28:12,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181451332] [2024-09-25 10:28:12,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181451332] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:28:12,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303131356] [2024-09-25 10:28:12,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:28:12,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:28:12,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:28:12,097 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:28:12,101 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-09-25 10:28:12,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-25 10:28:12,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:28:12,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-25 10:28:12,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:28:12,278 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-09-25 10:28:12,279 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:28:12,468 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-09-25 10:28:12,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303131356] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:28:12,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:28:12,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 30 [2024-09-25 10:28:12,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79342399] [2024-09-25 10:28:12,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:28:12,469 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-25 10:28:12,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:28:12,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-25 10:28:12,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2024-09-25 10:28:12,470 INFO L87 Difference]: Start difference. First operand 486 states and 689 transitions. Second operand has 30 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:28:14,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:28:14,785 INFO L93 Difference]: Finished difference Result 939 states and 1257 transitions. [2024-09-25 10:28:14,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-09-25 10:28:14,785 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-09-25 10:28:14,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:28:14,788 INFO L225 Difference]: With dead ends: 939 [2024-09-25 10:28:14,788 INFO L226 Difference]: Without dead ends: 901 [2024-09-25 10:28:14,789 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1567 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1414, Invalid=5228, Unknown=0, NotChecked=0, Total=6642 [2024-09-25 10:28:14,790 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 280 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-25 10:28:14,791 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 495 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1277 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-25 10:28:14,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2024-09-25 10:28:15,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 485. [2024-09-25 10:28:15,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 480 states have (on average 1.4833333333333334) internal successors, (712), 480 states have internal predecessors, (712), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:28:15,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 716 transitions. [2024-09-25 10:28:15,077 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 716 transitions. Word has length 36 [2024-09-25 10:28:15,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:28:15,077 INFO L474 AbstractCegarLoop]: Abstraction has 485 states and 716 transitions. [2024-09-25 10:28:15,077 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:28:15,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:28:15,078 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 716 transitions. [2024-09-25 10:28:15,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-25 10:28:15,079 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:28:15,079 INFO L216 NwaCegarLoop]: trace histogram [13, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:28:15,091 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-09-25 10:28:15,282 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-09-25 10:28:15,282 INFO L399 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:28:15,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:28:15,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1377251232, now seen corresponding path program 11 times [2024-09-25 10:28:15,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:28:15,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192807818] [2024-09-25 10:28:15,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:28:15,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:28:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:28:15,542 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:28:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:28:15,543 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-25 10:28:15,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:28:15,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192807818] [2024-09-25 10:28:15,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192807818] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:28:15,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806586499] [2024-09-25 10:28:15,544 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 10:28:15,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:28:15,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:28:15,546 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:28:15,557 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-09-25 10:28:15,601 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-09-25 10:28:15,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:28:15,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-25 10:28:15,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:28:15,635 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-25 10:28:15,635 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:28:16,064 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-25 10:28:16,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806586499] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:28:16,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:28:16,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2024-09-25 10:28:16,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065083341] [2024-09-25 10:28:16,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:28:16,065 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-09-25 10:28:16,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:28:16,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-09-25 10:28:16,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1053, Unknown=0, NotChecked=0, Total=1332 [2024-09-25 10:28:16,066 INFO L87 Difference]: Start difference. First operand 485 states and 716 transitions. Second operand has 37 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:28:39,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:28:39,124 INFO L93 Difference]: Finished difference Result 1988 states and 2995 transitions. [2024-09-25 10:28:39,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2024-09-25 10:28:39,124 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-09-25 10:28:39,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:28:39,129 INFO L225 Difference]: With dead ends: 1988 [2024-09-25 10:28:39,129 INFO L226 Difference]: Without dead ends: 1785 [2024-09-25 10:28:39,135 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19625 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=11169, Invalid=37451, Unknown=0, NotChecked=0, Total=48620 [2024-09-25 10:28:39,136 INFO L434 NwaCegarLoop]: 87 mSDtfsCounter, 2055 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 1004 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2055 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 2519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1004 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-09-25 10:28:39,136 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2055 Valid, 1388 Invalid, 2519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1004 Valid, 1515 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-09-25 10:28:39,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2024-09-25 10:28:39,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 584. [2024-09-25 10:28:39,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 579 states have (on average 1.4455958549222798) internal successors, (837), 579 states have internal predecessors, (837), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:28:39,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 841 transitions. [2024-09-25 10:28:39,532 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 841 transitions. Word has length 36 [2024-09-25 10:28:39,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:28:39,532 INFO L474 AbstractCegarLoop]: Abstraction has 584 states and 841 transitions. [2024-09-25 10:28:39,532 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:28:39,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:28:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 841 transitions. [2024-09-25 10:28:39,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-25 10:28:39,533 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:28:39,533 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:28:39,546 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-09-25 10:28:39,734 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-09-25 10:28:39,734 INFO L399 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:28:39,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:28:39,734 INFO L85 PathProgramCache]: Analyzing trace with hash 771129250, now seen corresponding path program 12 times [2024-09-25 10:28:39,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:28:39,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116095060] [2024-09-25 10:28:39,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:28:39,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:28:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:28:39,929 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:28:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:28:39,930 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-09-25 10:28:39,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:28:39,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116095060] [2024-09-25 10:28:39,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116095060] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:28:39,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623342189] [2024-09-25 10:28:39,931 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-25 10:28:39,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:28:39,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:28:39,932 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:28:39,935 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-09-25 10:28:39,989 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-09-25 10:28:39,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:28:39,992 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-25 10:28:39,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:28:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-09-25 10:28:40,144 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:28:40,231 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-09-25 10:28:40,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623342189] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:28:40,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:28:40,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 24 [2024-09-25 10:28:40,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736339692] [2024-09-25 10:28:40,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:28:40,232 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-25 10:28:40,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:28:40,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-25 10:28:40,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2024-09-25 10:28:40,234 INFO L87 Difference]: Start difference. First operand 584 states and 841 transitions. Second operand has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:28:56,377 WARN L293 SmtUtils]: Spent 16.06s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:29:08,435 WARN L293 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:29:16,489 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:29:32,752 WARN L293 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:29:40,831 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:29:53,061 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:30:05,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-25 10:30:09,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-25 10:30:13,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-25 10:30:14,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:30:14,155 INFO L93 Difference]: Finished difference Result 1378 states and 2122 transitions. [2024-09-25 10:30:14,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-09-25 10:30:14,155 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2024-09-25 10:30:14,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:30:14,159 INFO L225 Difference]: With dead ends: 1378 [2024-09-25 10:30:14,159 INFO L226 Difference]: Without dead ends: 1352 [2024-09-25 10:30:14,160 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 80.8s TimeCoverageRelationStatistics Valid=657, Invalid=1505, Unknown=0, NotChecked=0, Total=2162 [2024-09-25 10:30:14,160 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 179 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 142 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:30:14,160 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 339 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 220 Invalid, 3 Unknown, 0 Unchecked, 12.3s Time] [2024-09-25 10:30:14,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2024-09-25 10:30:14,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 781. [2024-09-25 10:30:14,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 776 states have (on average 1.4884020618556701) internal successors, (1155), 776 states have internal predecessors, (1155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:14,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1159 transitions. [2024-09-25 10:30:14,753 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1159 transitions. Word has length 38 [2024-09-25 10:30:14,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:30:14,753 INFO L474 AbstractCegarLoop]: Abstraction has 781 states and 1159 transitions. [2024-09-25 10:30:14,753 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:14,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:14,754 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1159 transitions. [2024-09-25 10:30:14,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-25 10:30:14,755 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:30:14,755 INFO L216 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:30:14,770 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-09-25 10:30:14,958 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-09-25 10:30:14,959 INFO L399 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:30:14,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:14,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1178248642, now seen corresponding path program 13 times [2024-09-25 10:30:14,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:30:14,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833640725] [2024-09-25 10:30:14,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:30:14,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:30:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:15,110 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:30:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:15,111 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-09-25 10:30:15,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:30:15,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833640725] [2024-09-25 10:30:15,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833640725] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:30:15,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621469274] [2024-09-25 10:30:15,112 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-25 10:30:15,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:30:15,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:30:15,117 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:30:15,121 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-09-25 10:30:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:15,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-09-25 10:30:15,162 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:30:15,249 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-09-25 10:30:15,249 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:30:15,493 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-09-25 10:30:15,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621469274] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:30:15,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:30:15,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 12] total 30 [2024-09-25 10:30:15,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623775185] [2024-09-25 10:30:15,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:30:15,494 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-25 10:30:15,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:30:15,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-25 10:30:15,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2024-09-25 10:30:15,495 INFO L87 Difference]: Start difference. First operand 781 states and 1159 transitions. Second operand has 30 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:17,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:30:17,709 INFO L93 Difference]: Finished difference Result 1202 states and 1667 transitions. [2024-09-25 10:30:17,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-09-25 10:30:17,710 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2024-09-25 10:30:17,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:30:17,719 INFO L225 Difference]: With dead ends: 1202 [2024-09-25 10:30:17,719 INFO L226 Difference]: Without dead ends: 1080 [2024-09-25 10:30:17,720 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=413, Invalid=3009, Unknown=0, NotChecked=0, Total=3422 [2024-09-25 10:30:17,720 INFO L434 NwaCegarLoop]: 55 mSDtfsCounter, 96 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-25 10:30:17,720 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 720 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-25 10:30:17,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2024-09-25 10:30:18,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 753. [2024-09-25 10:30:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 748 states have (on average 1.4705882352941178) internal successors, (1100), 748 states have internal predecessors, (1100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:18,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1104 transitions. [2024-09-25 10:30:18,297 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1104 transitions. Word has length 39 [2024-09-25 10:30:18,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:30:18,297 INFO L474 AbstractCegarLoop]: Abstraction has 753 states and 1104 transitions. [2024-09-25 10:30:18,297 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:18,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:18,298 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1104 transitions. [2024-09-25 10:30:18,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-25 10:30:18,298 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:30:18,298 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:30:18,311 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-09-25 10:30:18,499 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:30:18,499 INFO L399 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:30:18,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:18,499 INFO L85 PathProgramCache]: Analyzing trace with hash -958108414, now seen corresponding path program 14 times [2024-09-25 10:30:18,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:30:18,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605334323] [2024-09-25 10:30:18,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:30:18,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:30:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:19,099 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:30:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:19,101 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 10:30:19,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:30:19,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605334323] [2024-09-25 10:30:19,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605334323] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:30:19,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245306143] [2024-09-25 10:30:19,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:30:19,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:30:19,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:30:19,105 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:30:19,109 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-09-25 10:30:19,151 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:30:19,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:30:19,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-09-25 10:30:19,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:30:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 10:30:19,294 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:30:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 10:30:19,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245306143] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:30:19,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:30:19,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 10] total 28 [2024-09-25 10:30:19,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920245170] [2024-09-25 10:30:19,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:30:19,552 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-25 10:30:19,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:30:19,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-25 10:30:19,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2024-09-25 10:30:19,552 INFO L87 Difference]: Start difference. First operand 753 states and 1104 transitions. Second operand has 28 states, 28 states have (on average 3.142857142857143) internal successors, (88), 26 states have internal predecessors, (88), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:23,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-25 10:30:24,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:30:24,491 INFO L93 Difference]: Finished difference Result 770 states and 1120 transitions. [2024-09-25 10:30:24,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-25 10:30:24,491 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.142857142857143) internal successors, (88), 26 states have internal predecessors, (88), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2024-09-25 10:30:24,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:30:24,494 INFO L225 Difference]: With dead ends: 770 [2024-09-25 10:30:24,494 INFO L226 Difference]: Without dead ends: 740 [2024-09-25 10:30:24,494 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2024-09-25 10:30:24,495 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:30:24,495 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 210 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 447 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-09-25 10:30:24,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2024-09-25 10:30:25,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2024-09-25 10:30:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 735 states have (on average 1.4775510204081632) internal successors, (1086), 735 states have internal predecessors, (1086), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:25,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1090 transitions. [2024-09-25 10:30:25,054 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1090 transitions. Word has length 40 [2024-09-25 10:30:25,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:30:25,054 INFO L474 AbstractCegarLoop]: Abstraction has 740 states and 1090 transitions. [2024-09-25 10:30:25,054 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.142857142857143) internal successors, (88), 26 states have internal predecessors, (88), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:25,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:25,055 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1090 transitions. [2024-09-25 10:30:25,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-25 10:30:25,055 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:30:25,056 INFO L216 NwaCegarLoop]: trace histogram [14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:30:25,068 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-09-25 10:30:25,259 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,27 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:30:25,259 INFO L399 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:30:25,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:25,260 INFO L85 PathProgramCache]: Analyzing trace with hash -971466802, now seen corresponding path program 15 times [2024-09-25 10:30:25,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:30:25,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195291350] [2024-09-25 10:30:25,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:30:25,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:30:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:25,570 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:30:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-25 10:30:25,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:30:25,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195291350] [2024-09-25 10:30:25,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195291350] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:30:25,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434409173] [2024-09-25 10:30:25,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:30:25,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:30:25,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:30:25,578 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:30:25,580 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-09-25 10:30:25,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-09-25 10:30:25,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:30:25,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-09-25 10:30:25,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:30:25,729 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 10:30:25,729 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:30:26,313 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 10:30:26,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434409173] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:30:26,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:30:26,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2024-09-25 10:30:26,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508200364] [2024-09-25 10:30:26,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:30:26,314 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-09-25 10:30:26,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:30:26,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-09-25 10:30:26,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=1316, Unknown=0, NotChecked=0, Total=1640 [2024-09-25 10:30:26,315 INFO L87 Difference]: Start difference. First operand 740 states and 1090 transitions. Second operand has 41 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 41 states have internal predecessors, (74), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:15,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:15,823 INFO L93 Difference]: Finished difference Result 2703 states and 3973 transitions. [2024-09-25 10:31:15,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 306 states. [2024-09-25 10:31:15,823 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 41 states have internal predecessors, (74), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2024-09-25 10:31:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:15,829 INFO L225 Difference]: With dead ends: 2703 [2024-09-25 10:31:15,830 INFO L226 Difference]: Without dead ends: 2417 [2024-09-25 10:31:15,839 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45119 ImplicationChecksByTransitivity, 43.7s TimeCoverageRelationStatistics Valid=21007, Invalid=84943, Unknown=0, NotChecked=0, Total=105950 [2024-09-25 10:31:15,840 INFO L434 NwaCegarLoop]: 94 mSDtfsCounter, 2582 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 1891 mSolverCounterSat, 1187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2582 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 3078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1187 IncrementalHoareTripleChecker+Valid, 1891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:15,840 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2582 Valid, 1577 Invalid, 3078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1187 Valid, 1891 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-09-25 10:31:15,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2024-09-25 10:31:16,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 878. [2024-09-25 10:31:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 873 states have (on average 1.4490263459335624) internal successors, (1265), 873 states have internal predecessors, (1265), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:16,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1269 transitions. [2024-09-25 10:31:16,573 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1269 transitions. Word has length 41 [2024-09-25 10:31:16,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:16,573 INFO L474 AbstractCegarLoop]: Abstraction has 878 states and 1269 transitions. [2024-09-25 10:31:16,573 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 41 states have internal predecessors, (74), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:16,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:16,574 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1269 transitions. [2024-09-25 10:31:16,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-25 10:31:16,575 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:16,575 INFO L216 NwaCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:16,588 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-09-25 10:31:16,775 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:16,775 INFO L399 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:16,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:16,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1510494176, now seen corresponding path program 4 times [2024-09-25 10:31:16,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:16,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373202801] [2024-09-25 10:31:16,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:16,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:17,306 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:17,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:17,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373202801] [2024-09-25 10:31:17,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373202801] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:17,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398084126] [2024-09-25 10:31:17,309 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:31:17,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:17,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:17,310 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:17,311 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-09-25 10:31:17,354 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:31:17,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:31:17,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-09-25 10:31:17,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:17,437 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:17,437 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:18,798 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:18,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398084126] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:18,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:18,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2024-09-25 10:31:18,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054427253] [2024-09-25 10:31:18,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:18,799 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-09-25 10:31:18,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:18,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-09-25 10:31:18,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=2755, Unknown=0, NotChecked=0, Total=3660 [2024-09-25 10:31:18,800 INFO L87 Difference]: Start difference. First operand 878 states and 1269 transitions. Second operand has 61 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 61 states have internal predecessors, (71), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)