./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-new/count_by_2.i --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/loop-new/count_by_2.i -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 86d4e5d9ff4808cbd51f54a8e918c7da7f8f3d0797ade1f0adcb3da91d131026 --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:24:51,432 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:24:51,520 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:24:51,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:24:51,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:24:51,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:24:51,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:24:51,561 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:24:51,562 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:24:51,563 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:24:51,564 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:24:51,564 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:24:51,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:24:51,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:24:51,568 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:24:51,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:24:51,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:24:51,569 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:24:51,569 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:24:51,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:24:51,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:24:51,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:24:51,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:24:51,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:24:51,574 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:24:51,574 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:24:51,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:24:51,575 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:24:51,575 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:24:51,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:24:51,577 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:24:51,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:24:51,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:24:51,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:24:51,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:24:51,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:24:51,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:24:51,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:24:51,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:24:51,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:24:51,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:24:51,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:24:51,580 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 -> 86d4e5d9ff4808cbd51f54a8e918c7da7f8f3d0797ade1f0adcb3da91d131026 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:24:51,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:24:51,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:24:51,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:24:51,952 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:24:51,953 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:24:51,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-new/count_by_2.i [2024-09-25 10:24:53,485 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:24:53,709 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:24:53,711 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-new/count_by_2.i [2024-09-25 10:24:53,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/778a69945/649167d2de344c0a8b46726bc104e3c3/FLAG3d63a6120 [2024-09-25 10:24:53,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/778a69945/649167d2de344c0a8b46726bc104e3c3 [2024-09-25 10:24:53,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:24:53,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:24:53,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:24:53,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:24:53,754 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:24:53,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:24:53" (1/1) ... [2024-09-25 10:24:53,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1977ccda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:53, skipping insertion in model container [2024-09-25 10:24:53,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:24:53" (1/1) ... [2024-09-25 10:24:53,780 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:24:53,939 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/loop-new/count_by_2.i[891,904] [2024-09-25 10:24:53,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:24:53,966 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:24:53,978 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/loop-new/count_by_2.i[891,904] [2024-09-25 10:24:53,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:24:54,003 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:24:54,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:54 WrapperNode [2024-09-25 10:24:54,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:24:54,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:24:54,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:24:54,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:24:54,012 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:24:54" (1/1) ... [2024-09-25 10:24:54,019 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:24:54" (1/1) ... [2024-09-25 10:24:54,025 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:24:54,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:24:54,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:24:54,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:24:54,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:24:54,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:54" (1/1) ... [2024-09-25 10:24:54,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:54" (1/1) ... [2024-09-25 10:24:54,038 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:54" (1/1) ... [2024-09-25 10:24:54,048 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:24:54,049 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:54" (1/1) ... [2024-09-25 10:24:54,049 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:54" (1/1) ... [2024-09-25 10:24:54,050 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:54" (1/1) ... [2024-09-25 10:24:54,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:54" (1/1) ... [2024-09-25 10:24:54,059 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:54" (1/1) ... [2024-09-25 10:24:54,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:54" (1/1) ... [2024-09-25 10:24:54,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:24:54,062 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:24:54,062 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:24:54,062 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:24:54,063 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:54" (1/1) ... [2024-09-25 10:24:54,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:24:54,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:24:54,098 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:24:54,102 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:24:54,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:24:54,146 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:24:54,146 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:24:54,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:24:54,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:24:54,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:24:54,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:24:54,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:24:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:24:54,149 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:24:54,215 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:24:54,218 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:24:54,344 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-09-25 10:24:54,345 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:24:54,372 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:24:54,373 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 10:24:54,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:24:54 BoogieIcfgContainer [2024-09-25 10:24:54,374 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:24:54,376 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:24:54,376 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:24:54,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:24:54,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:24:53" (1/3) ... [2024-09-25 10:24:54,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33aedca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:24:54, skipping insertion in model container [2024-09-25 10:24:54,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:24:54" (2/3) ... [2024-09-25 10:24:54,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33aedca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:24:54, skipping insertion in model container [2024-09-25 10:24:54,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:24:54" (3/3) ... [2024-09-25 10:24:54,384 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_2.i [2024-09-25 10:24:54,401 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:24:54,401 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:24:54,458 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:24:54,468 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;@707f4e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:24:54,468 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:24:54,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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:24:54,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-25 10:24:54,481 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:24:54,482 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:24:54,483 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:24:54,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:24:54,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1179372921, now seen corresponding path program 1 times [2024-09-25 10:24:54,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:24:54,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109836239] [2024-09-25 10:24:54,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:24:54,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:24:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:54,636 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:24:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:54,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:24:54,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:24:54,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109836239] [2024-09-25 10:24:54,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109836239] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:24:54,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:24:54,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 10:24:54,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503050968] [2024-09-25 10:24:54,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:24:54,658 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 10:24:54,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:24:54,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 10:24:54,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:24:54,681 INFO L87 Difference]: Start difference. First operand has 17 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:24:54,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:24:54,704 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2024-09-25 10:24:54,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 10:24:54,710 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 10 [2024-09-25 10:24:54,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:24:54,720 INFO L225 Difference]: With dead ends: 28 [2024-09-25 10:24:54,720 INFO L226 Difference]: Without dead ends: 11 [2024-09-25 10:24:54,722 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:24:54,725 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:24:54,726 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:24:54,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-09-25 10:24:54,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-09-25 10:24:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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:24:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-09-25 10:24:54,752 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 10 [2024-09-25 10:24:54,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:24:54,752 INFO L474 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-09-25 10:24:54,753 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:24:54,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:24:54,753 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-09-25 10:24:54,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-25 10:24:54,754 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:24:54,754 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:24:54,754 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:24:54,754 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:24:54,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:24:54,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1184914047, now seen corresponding path program 1 times [2024-09-25 10:24:54,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:24:54,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455027315] [2024-09-25 10:24:54,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:24:54,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:24:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:54,850 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:24:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:54,867 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:24:54,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:24:54,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455027315] [2024-09-25 10:24:54,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455027315] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:24:54,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:24:54,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:24:54,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186984179] [2024-09-25 10:24:54,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:24:54,872 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:24:54,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:24:54,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:24:54,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:24:54,873 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:24:54,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:24:54,883 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-09-25 10:24:54,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:24:54,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 10 [2024-09-25 10:24:54,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:24:54,885 INFO L225 Difference]: With dead ends: 17 [2024-09-25 10:24:54,885 INFO L226 Difference]: Without dead ends: 12 [2024-09-25 10:24:54,885 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:24:54,886 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:24:54,887 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:24:54,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-09-25 10:24:54,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-09-25 10:24:54,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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:24:54,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-09-25 10:24:54,892 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2024-09-25 10:24:54,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:24:54,892 INFO L474 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-09-25 10:24:54,892 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:24:54,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:24:54,893 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-09-25 10:24:54,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 10:24:54,893 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:24:54,893 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:24:54,893 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:24:54,894 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:24:54,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:24:54,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1565919309, now seen corresponding path program 1 times [2024-09-25 10:24:54,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:24:54,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799851280] [2024-09-25 10:24:54,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:24:54,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:24:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:54,992 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:24:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:55,002 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:24:55,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:24:55,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799851280] [2024-09-25 10:24:55,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799851280] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:24:55,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887281315] [2024-09-25 10:24:55,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:24:55,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:24:55,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:24:55,008 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:24:55,010 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:24:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:55,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-25 10:24:55,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:24:55,110 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:24:55,110 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:24:55,155 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:24:55,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887281315] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:24:55,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:24:55,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-25 10:24:55,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546669933] [2024-09-25 10:24:55,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:24:55,157 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:24:55,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:24:55,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:24:55,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:24:55,158 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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:24:55,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:24:55,176 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2024-09-25 10:24:55,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:24:55,177 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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 11 [2024-09-25 10:24:55,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:24:55,178 INFO L225 Difference]: With dead ends: 20 [2024-09-25 10:24:55,178 INFO L226 Difference]: Without dead ends: 15 [2024-09-25 10:24:55,178 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:24:55,180 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:24:55,181 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:24:55,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-09-25 10:24:55,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-09-25 10:24:55,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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:24:55,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-09-25 10:24:55,187 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2024-09-25 10:24:55,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:24:55,187 INFO L474 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-09-25 10:24:55,188 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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:24:55,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:24:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-09-25 10:24:55,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-25 10:24:55,189 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:24:55,189 INFO L216 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:24:55,203 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:24:55,389 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:24:55,390 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:24:55,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:24:55,391 INFO L85 PathProgramCache]: Analyzing trace with hash -495214079, now seen corresponding path program 2 times [2024-09-25 10:24:55,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:24:55,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977526652] [2024-09-25 10:24:55,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:24:55,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:24:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:55,507 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:24:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:55,513 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:24:55,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:24:55,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977526652] [2024-09-25 10:24:55,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977526652] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:24:55,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259029725] [2024-09-25 10:24:55,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:24:55,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:24:55,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:24:55,521 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:24:55,522 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:24:55,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:24:55,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:24:55,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 10:24:55,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:24:55,591 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:24:55,592 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:24:55,673 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:24:55,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259029725] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:24:55,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:24:55,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-09-25 10:24:55,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108833969] [2024-09-25 10:24:55,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:24:55,675 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 10:24:55,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:24:55,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 10:24:55,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-09-25 10:24:55,679 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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:24:55,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:24:55,714 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2024-09-25 10:24:55,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-25 10:24:55,715 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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 14 [2024-09-25 10:24:55,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:24:55,716 INFO L225 Difference]: With dead ends: 26 [2024-09-25 10:24:55,716 INFO L226 Difference]: Without dead ends: 21 [2024-09-25 10:24:55,716 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-09-25 10:24:55,717 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:24:55,718 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:24:55,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-25 10:24:55,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-25 10:24:55,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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:24:55,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-09-25 10:24:55,723 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2024-09-25 10:24:55,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:24:55,723 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-09-25 10:24:55,723 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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:24:55,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:24:55,724 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-09-25 10:24:55,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-25 10:24:55,724 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:24:55,724 INFO L216 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:24:55,737 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:24:55,927 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:24:55,927 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:24:55,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:24:55,928 INFO L85 PathProgramCache]: Analyzing trace with hash -217750335, now seen corresponding path program 3 times [2024-09-25 10:24:55,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:24:55,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890120014] [2024-09-25 10:24:55,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:24:55,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:24:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:56,167 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:24:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:56,171 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:24:56,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:24:56,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890120014] [2024-09-25 10:24:56,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890120014] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:24:56,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011295651] [2024-09-25 10:24:56,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:24:56,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:24:56,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:24:56,175 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:24:56,176 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:24:56,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-09-25 10:24:56,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:24:56,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-25 10:24:56,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:24:56,271 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:24:56,274 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:24:56,530 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:24:56,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011295651] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:24:56,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:24:56,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-09-25 10:24:56,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410341043] [2024-09-25 10:24:56,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:24:56,532 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-25 10:24:56,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:24:56,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-25 10:24:56,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-09-25 10:24:56,534 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:24:56,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:24:56,574 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2024-09-25 10:24:56,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-25 10:24:56,574 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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 20 [2024-09-25 10:24:56,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:24:56,575 INFO L225 Difference]: With dead ends: 38 [2024-09-25 10:24:56,576 INFO L226 Difference]: Without dead ends: 33 [2024-09-25 10:24:56,576 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-09-25 10:24:56,578 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:24:56,578 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:24:56,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-25 10:24:56,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-09-25 10:24:56,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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:24:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2024-09-25 10:24:56,587 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 20 [2024-09-25 10:24:56,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:24:56,587 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2024-09-25 10:24:56,587 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:24:56,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:24:56,588 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2024-09-25 10:24:56,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-25 10:24:56,589 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:24:56,589 INFO L216 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:24:56,601 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-25 10:24:56,790 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:24:56,791 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:24:56,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:24:56,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1768048063, now seen corresponding path program 4 times [2024-09-25 10:24:56,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:24:56,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145239477] [2024-09-25 10:24:56,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:24:56,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:24:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:57,286 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:24:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:24:57,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:24:57,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145239477] [2024-09-25 10:24:57,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145239477] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:24:57,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478277826] [2024-09-25 10:24:57,291 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:24:57,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:24:57,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:24:57,293 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:24:57,295 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:24:57,347 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:24:57,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:24:57,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-25 10:24:57,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:24:57,412 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:24:57,412 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:24:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:24:58,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478277826] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:24:58,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:24:58,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2024-09-25 10:24:58,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987640963] [2024-09-25 10:24:58,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:24:58,190 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-09-25 10:24:58,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:24:58,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-09-25 10:24:58,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-09-25 10:24:58,192 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 49 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 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:24:58,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:24:58,263 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2024-09-25 10:24:58,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-09-25 10:24:58,267 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 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 32 [2024-09-25 10:24:58,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:24:58,268 INFO L225 Difference]: With dead ends: 62 [2024-09-25 10:24:58,268 INFO L226 Difference]: Without dead ends: 57 [2024-09-25 10:24:58,270 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-09-25 10:24:58,270 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:24:58,270 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:24:58,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-25 10:24:58,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-09-25 10:24:58,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 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:24:58,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2024-09-25 10:24:58,285 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 32 [2024-09-25 10:24:58,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:24:58,285 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2024-09-25 10:24:58,286 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 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:24:58,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:24:58,287 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2024-09-25 10:24:58,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-09-25 10:24:58,288 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:24:58,289 INFO L216 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:24:58,302 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-25 10:24:58,493 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:24:58,494 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:24:58,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:24:58,494 INFO L85 PathProgramCache]: Analyzing trace with hash -701389503, now seen corresponding path program 5 times [2024-09-25 10:24:58,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:24:58,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642915673] [2024-09-25 10:24:58,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:24:58,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:24:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:59,839 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:24:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:24:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:24:59,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:24:59,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642915673] [2024-09-25 10:24:59,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642915673] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:24:59,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009520788] [2024-09-25 10:24:59,844 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 10:24:59,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:24:59,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:24:59,847 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:24:59,849 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:24:59,902 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2024-09-25 10:24:59,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:24:59,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-09-25 10:24:59,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:25:00,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:00,006 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:25:02,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:02,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009520788] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:25:02,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:25:02,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2024-09-25 10:25:02,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003605843] [2024-09-25 10:25:02,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:25:02,392 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2024-09-25 10:25:02,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:25:02,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2024-09-25 10:25:02,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2024-09-25 10:25:02,401 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 97 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 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:25:02,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:25:02,557 INFO L93 Difference]: Finished difference Result 110 states and 157 transitions. [2024-09-25 10:25:02,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-09-25 10:25:02,560 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 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 56 [2024-09-25 10:25:02,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:25:02,561 INFO L225 Difference]: With dead ends: 110 [2024-09-25 10:25:02,561 INFO L226 Difference]: Without dead ends: 105 [2024-09-25 10:25:02,566 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2024-09-25 10:25:02,566 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:25:02,567 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:25:02,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-09-25 10:25:02,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-09-25 10:25:02,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 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:25:02,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2024-09-25 10:25:02,586 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 56 [2024-09-25 10:25:02,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:25:02,586 INFO L474 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2024-09-25 10:25:02,586 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 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:25:02,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:25:02,589 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2024-09-25 10:25:02,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-09-25 10:25:02,593 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:25:02,593 INFO L216 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:25:02,606 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:25:02,795 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-25 10:25:02,796 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:25:02,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:25:02,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1587119295, now seen corresponding path program 6 times [2024-09-25 10:25:02,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:25:02,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101551546] [2024-09-25 10:25:02,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:25:02,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:25:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:06,882 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:25:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:06,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:06,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:25:06,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101551546] [2024-09-25 10:25:06,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101551546] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:25:06,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325121652] [2024-09-25 10:25:06,888 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-25 10:25:06,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:25:06,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:25:06,890 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:25:06,891 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:25:06,999 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2024-09-25 10:25:06,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:25:07,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-09-25 10:25:07,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:25:07,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:07,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:25:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:15,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325121652] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:25:15,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:25:15,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2024-09-25 10:25:15,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801702728] [2024-09-25 10:25:15,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:25:15,838 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 193 states [2024-09-25 10:25:15,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:25:15,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2024-09-25 10:25:15,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2024-09-25 10:25:15,848 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand has 193 states, 193 states have (on average 1.0259067357512954) internal successors, (198), 193 states have internal predecessors, (198), 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:25:16,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:25:16,125 INFO L93 Difference]: Finished difference Result 206 states and 301 transitions. [2024-09-25 10:25:16,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2024-09-25 10:25:16,126 INFO L78 Accepts]: Start accepts. Automaton has has 193 states, 193 states have (on average 1.0259067357512954) internal successors, (198), 193 states have internal predecessors, (198), 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 104 [2024-09-25 10:25:16,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:25:16,128 INFO L225 Difference]: With dead ends: 206 [2024-09-25 10:25:16,128 INFO L226 Difference]: Without dead ends: 201 [2024-09-25 10:25:16,131 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2024-09-25 10:25:16,132 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:25:16,132 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:25:16,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-09-25 10:25:16,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-09-25 10:25:16,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 196 states have (on average 1.0051020408163265) internal successors, (197), 196 states have internal predecessors, (197), 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:25:16,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2024-09-25 10:25:16,162 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 104 [2024-09-25 10:25:16,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:25:16,163 INFO L474 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2024-09-25 10:25:16,163 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 193 states, 193 states have (on average 1.0259067357512954) internal successors, (198), 193 states have internal predecessors, (198), 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:25:16,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:25:16,164 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2024-09-25 10:25:16,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-09-25 10:25:16,168 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:25:16,168 INFO L216 NwaCegarLoop]: trace histogram [190, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:25:16,187 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-25 10:25:16,369 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:25:16,369 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:25:16,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:25:16,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1006905153, now seen corresponding path program 7 times [2024-09-25 10:25:16,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:25:16,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278651823] [2024-09-25 10:25:16,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:25:16,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:25:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:30,878 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:25:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:30,889 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:30,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:25:30,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278651823] [2024-09-25 10:25:30,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278651823] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:25:30,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775895467] [2024-09-25 10:25:30,890 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-25 10:25:30,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:25:30,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:25:30,892 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:25:30,893 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:25:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:31,005 INFO L262 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 192 conjuncts are in the unsatisfiable core [2024-09-25 10:25:31,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:25:31,282 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:31,282 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:26:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:26:05,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775895467] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:26:05,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:26:05,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [193, 193, 193] total 385 [2024-09-25 10:26:05,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475891962] [2024-09-25 10:26:05,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:26:05,393 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 385 states [2024-09-25 10:26:05,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:26:05,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 385 interpolants. [2024-09-25 10:26:05,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73920, Invalid=73920, Unknown=0, NotChecked=0, Total=147840 [2024-09-25 10:26:05,416 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand has 385 states, 385 states have (on average 1.0129870129870129) internal successors, (390), 385 states have internal predecessors, (390), 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:26:06,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:26:06,684 INFO L93 Difference]: Finished difference Result 398 states and 589 transitions. [2024-09-25 10:26:06,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 384 states. [2024-09-25 10:26:06,685 INFO L78 Accepts]: Start accepts. Automaton has has 385 states, 385 states have (on average 1.0129870129870129) internal successors, (390), 385 states have internal predecessors, (390), 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 200 [2024-09-25 10:26:06,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:26:06,688 INFO L225 Difference]: With dead ends: 398 [2024-09-25 10:26:06,688 INFO L226 Difference]: Without dead ends: 393 [2024-09-25 10:26:06,694 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 383 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 45.0s TimeCoverageRelationStatistics Valid=73920, Invalid=73920, Unknown=0, NotChecked=0, Total=147840 [2024-09-25 10:26:06,694 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:26:06,694 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:26:06,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-09-25 10:26:06,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-09-25 10:26:06,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.0025773195876289) internal successors, (389), 388 states have internal predecessors, (389), 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:26:06,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2024-09-25 10:26:06,750 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 200 [2024-09-25 10:26:06,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:26:06,751 INFO L474 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2024-09-25 10:26:06,751 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 385 states, 385 states have (on average 1.0129870129870129) internal successors, (390), 385 states have internal predecessors, (390), 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:26:06,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:26:06,752 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2024-09-25 10:26:06,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2024-09-25 10:26:06,758 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:26:06,758 INFO L216 NwaCegarLoop]: trace histogram [382, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:26:06,775 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:26:06,958 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:26:06,959 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:26:06,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:26:06,959 INFO L85 PathProgramCache]: Analyzing trace with hash 571440961, now seen corresponding path program 8 times [2024-09-25 10:26:06,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:26:06,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52696460] [2024-09-25 10:26:06,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:26:06,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:26:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:06,018 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:27:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:27:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 73153 backedges. 0 proven. 73153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:27:06,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:27:06,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52696460] [2024-09-25 10:27:06,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52696460] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:27:06,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711086554] [2024-09-25 10:27:06,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:27:06,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:27:06,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:27:06,033 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:06,034 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:06,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:27:06,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:27:06,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 1182 conjuncts, 384 conjuncts are in the unsatisfiable core [2024-09-25 10:27:06,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:27:06,686 INFO L134 CoverageAnalysis]: Checked inductivity of 73153 backedges. 0 proven. 73153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:27:06,686 INFO L327 TraceCheckSpWp]: Computing backward predicates...